Union is Associative

From ProofWiki
Jump to: navigation, search

Contents

Theorem

Set union is associative:

$A \cup \left({B \cup C}\right) = \left({A \cup B}\right) \cup C$


Proof

\(\displaystyle \) \(\displaystyle x \in A \cup \left({B \cup C}\right)\) \(\iff\) \(\displaystyle x \in A \lor \left({x \in B \lor x \in C}\right)\) \(\displaystyle \)          Definition of Union          
\(\displaystyle \) \(\displaystyle \) \(\iff\) \(\displaystyle \left({x \in A \lor x \in B}\right) \lor x \in C\) \(\displaystyle \)          Rule of Association          
\(\displaystyle \) \(\displaystyle \) \(\iff\) \(\displaystyle x \in \left({A \cup B}\right) \cup C\) \(\displaystyle \)          Definition of Union          


Therefore, $x \in A \cup \left({B \cup C}\right)$ iff $x \in \left({A \cup B}\right) \cup C$.

Thus it has been shown that $A \cup \left({B \cup C}\right) = \left({A \cup B}\right) \cup C$.

$\blacksquare$


Also see


Sources

Personal tools
Namespaces
Variants
Actions
Navigation
ProofWiki.org
ToDo
Toolbox
Google AdSense