- #1
the baby boy
- 7
- 0
I can't think of a counterexample to disprove this set theory "theorem"
Assume F and G are families of sets.
IF [itex]\cup[/itex]F [itex]\bigcap[/itex] [itex]\cup[/itex]G = ∅ (disjoint), THEN F [itex]\bigcap[/itex] G are disjoint as well.
Assume F and G are families of sets.
IF [itex]\cup[/itex]F [itex]\bigcap[/itex] [itex]\cup[/itex]G = ∅ (disjoint), THEN F [itex]\bigcap[/itex] G are disjoint as well.