Finite Union of Finite Sets is Finite/Proof 1

From ProofWiki
Jump to navigation Jump to search

Theorem

Let $S$ be a finite set of finite sets.


Then the union of $S$ is finite.


Proof

The proof proceeds by induction.

Let $S$ be a finite set with cardinality $n$.

If $n = 0$ then $S = \varnothing$, so $\bigcup S = \varnothing$, which is finite.

Suppose that the union of any finite set of finite sets with cardinality $n$ has a finite union.



Let $S$ have cardinality $n^+$.

Then there is a bijection $f: n^+ \to S$.

Then:

$\displaystyle \bigcup S = \bigcup_{k \mathop \in n^+} f \left({k}\right) = \bigcup_{k \mathop \in n} f \left({k}\right) \cup f \left({n}\right)$


By Union of Finite Sets is Finite, $\displaystyle \bigcup S$ is finite.

$\blacksquare$


Sources