Set Union is Self-Distributive/Families of Sets

Theorem
Let $I$ be an indexing set.

Let $\family {A_\alpha}_{\alpha \mathop \in I}$ and $\family {B_\alpha}_{\alpha \mathop \in I}$ be indexed families of subsets of a set $S$.

Then:
 * $\ds \map {\bigcup_{\alpha \mathop \in I} } {A_\alpha \cup B_\alpha} = \paren {\bigcup_{\alpha \mathop \in I} A_\alpha} \cup \paren {\bigcup_{\alpha \mathop \in I} B_\alpha}$

where $\ds \bigcup_{\alpha \mathop \in I} A_\alpha$ denotes the union of $\family {A_\alpha}_{\alpha \mathop \in I}$.

Proof
Thus by definition of subset:
 * $\ds \map {\bigcup_{\alpha \mathop \in I} } {A_\alpha \cup B_\alpha} \subseteq \paren {\bigcup_{\alpha \mathop \in I} A_\alpha} \cup \paren {\bigcup_{\alpha \mathop \in I} B_\alpha}$

Thus by definition of subset:
 * $\ds \paren {\bigcup_{\alpha \mathop \in I} A_\alpha} \cup \paren {\bigcup_{\alpha \mathop \in I} B_\alpha} \subseteq \map {\bigcup_{\alpha \mathop \in I} } {A_\alpha \cup B_\alpha}$

By definition of set equality:


 * $\ds \map {\bigcup_{\alpha \mathop \in I} } {A_\alpha \cup B_\alpha} = \paren {\bigcup_{\alpha \mathop \in I} A_\alpha} \cup \paren {\bigcup_{\alpha \mathop \in I} B_\alpha}$