Set Union is Self-Distributive/Families of Sets

Theorem
Let $I$ be an indexing set.

Let $\left \langle {A_\alpha} \right \rangle_{\alpha \mathop \in I}$ and $\left \langle {B_\alpha} \right \rangle_{\alpha \mathop \in I}$ be families of subsets of a set $S$.

Then:
 * $\displaystyle \bigcup_{\alpha \mathop \in I} \left({A_\alpha \cup B_\alpha}\right) = \left({\bigcup_{\alpha \mathop \in I} A_\alpha}\right) \cup \left({\bigcup_{\alpha \mathop \in I} B_\alpha}\right)$

where $\displaystyle \bigcup_{\alpha \mathop \in I} A_\alpha$ denotes the union of $\left \langle {A_\alpha} \right \rangle_{\alpha \mathop \in I}$.

Proof
Thus by definition of subset:
 * $\displaystyle \bigcup_{\alpha \mathop \in I} \left({A_\alpha \cup B_\alpha}\right) \subseteq \left({\bigcup_{\alpha \mathop \in I} A_\alpha}\right) \cup \left({\bigcup_{\alpha \mathop \in I} B_\alpha}\right)$

Thus by definition of subset:
 * $\displaystyle \left({\bigcup_{\alpha \mathop \in I} A_\alpha}\right) \cup \left({\bigcup_{\alpha \mathop \in I} B_\alpha}\right) \subseteq \bigcup_{\alpha \mathop \in I} \left({A_\alpha \cup B_\alpha}\right)$

By definition of set equality:


 * $\displaystyle \bigcup_{\alpha \mathop \in I} \left({A_\alpha \cup B_\alpha}\right) = \left({\bigcup_{\alpha \mathop \in I} A_\alpha}\right) \cup \left({\bigcup_{\alpha \mathop \in I} B_\alpha}\right)$