Here are DeMorgan's laws, given in logic notation: ¬(P ∨ Q) is logically equivalent to (¬P)∧ (¬Q) and ¬(P∧ Q) is logically equivalent to (¬P)∨ (¬Q).
(a) Express DeMorgan's laws using set notation.
(b) Prove DeMorgan's laws using truth tables.
(c) Prove De Morgan's laws using Venn diagrams.
(d) Prove De Morgan's laws using set-element notation. (Suggestion: use double-inclusion.)
(e) Can you state De Morgan's laws for three or more sets?
(f) Does that give you any ideas for stating, using logic notation, De Morgan's laws for three or more statements?