The Laws of Sets Identity Laws

Commutative Laws A∪ø=A

A∩B=B∩A A∩U=A
A∪U=U
A∪B=B∪A A∩ø=ø

Associative Laws
(A ∩ B) ∩ C = A ∩ (B ∩ C) Complement Laws
(A ∪ B) ∪ C = A ∪ (B ∪ C)
A ∪ A' = U
A ∩ A' = ø
Distributive Laws
U′=ø
A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C) ø′=U
A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)
De Morgan’s Laws
Idempotent Laws
(A ∩ B) ′ = A ′ ∪ B ′
A∩A=A
(A ∪ B) ′ = A ′ ∩ B ′
A∪A=A

Involution Law (A ′) ′ = A
 Use the Laws of Sets to prove that A ∪ (A ∩ B) = A.

Law Used
A ∪ (A ∩ B) = (A ∩ U) ∪ (A ∩ B) Identity
= A ∩ (U ∪ B) Distributive
= A ∩ (B ∪ U) Commutative
=A∩U Identity
=A Identity
Prove that (A ∩ Bc)c∪ B= Ac ∪ B.

• (A ∩ Bc)c∪ B = [(Ac ∪ (Bc)c ]∪ B De Morgans

• = (Ac ∪ B) ∪ B Involution
• = Ac ∪ (B ∪ B) Associative
• = Ac ∪ B Idempotent
Using the Laws of Sets, prove that the set (A ∪ B) ∩ (A ′ ∩ B) ′ is simply the same as
the set A itself. State carefully which Law you are using at each stage.

Law Used
(A ∪ B) ∩ (A ′ ∩ B) ′ = (A ∪ B) ∩ ((A ′) ′ ∪ B ′) De Morgan’s
= (A ∪ B) ∩ (A ∪ B ′) Involution
= A ∪ (B ∩ B ′) Distributive
=A∪ø Complement
=A Identity