In: Advanced Math
Investigate the following theorems
(h) For sets A, B and C we have
i. A\(B ∪ C) = (A\B) ∩ (A\C),
ii. A\(B ∩ C) = (A\B) ∪ (A\C),
iii. A ̸= B if and only if (A\B) ∪ (B\A) ̸= ∅,
iv. A ∪ B ⊆ C if and only if A ⊆ C and B ⊆ C.
What happens in the extreme case(s) where some (or all) sets are empty?