Union of Finite Sets is Finite/Proof 1

Proof
If $S$ or $T$ is empty, the result is trivial.

Otherwise, let $f: \N_{<n} \to S$ and $g: \N_{<m} \to T$ be bijections, where $\N_{<n}$ is an initial segment of $\N$.

Now define $h: \N_{< n + m} \to S \cup T$ by:


 * $\map h i = \begin{cases} \map f i : & \text {if $i < n$} \\ \map g {i - n} : & \text{if $i \ge n$} \end{cases}$

By Set Finite iff Surjection from Initial Segment of Natural Numbers, it suffices to show that $h$ is surjective.

Let $s \in S$.

Then:

Next let $t \in T$.

We have that:
 * $n + \map {g^{-1} } t < n + m$

so that:
 * $n + \map {g^{-1} } t \in \N_{< n + m}$

Then:

Thus it has been shown that for all $s \in S$ and $t \in T$, there exists an element of $\N_{< n + m}$ which maps to it.

So by definition of set union, for all $x \in S \cup T$:
 * $\exists y \in \N_{< n + m}: \map h y = x$.

Hence, by definition, $h$ is a surjection.

Therefore $S \cup T$ is finite.