De Morgan's Laws (Set Theory)/Proof by Induction

From ProofWiki
Jump to: navigation, search


Let $\mathbb T = \left\{{T_i: i \mathop \in I}\right\}$, where each $T_i$ is a set and $I$ is some finite indexing set.


Difference with Intersection

$\displaystyle S \setminus \bigcap_{i \mathop \in I} T_i = \bigcup_{i \mathop \in I} \left({S \setminus T_i}\right)$

Difference with Union

$\displaystyle S \setminus \bigcup_{i \mathop \in I} T_i = \bigcap_{i \mathop \in I} \left({S \setminus T_i}\right)$

Source of Name

This entry was named for Augustus De Morgan.