Union of Bijections with Disjoint Domains and Codomains is Bijection

Theorem
Let $A$, $B$, $C$, and $D$ be sets or classes.

Suppose that $A \cap B = C \cap D = \varnothing$.

Let $f: A \to C$ and $g: B \to D$ be bijections.

Then $f \cup g: A \cup B \to C \cup D$ is also a bijection.

Proof
By the definition of bijection, $f$ and $g$ are many-to-one and one-to-many relations.

Thus by Union of Many-to-One Relations with Disjoint Domains is Many-to-One and Union of One-to-Many Relations with Disjoint Images is One-to-Many:


 * $f \cup g$ is many-to-one and one-to-many.

Thus to show it is a bijection requires us only to demonstrate that it is both left-total and right-total.

We will show that it is left-total. The proof that it is right-total is similar.

Let $x \in A \cup B$.

Then $x \in A$ or $x \in B$.

If $x \in A$ then since $f$ is left-total there is a $y \in C$ such that $(x,y) \in f$.

By the definition of union, $(x, y) \in f \cup g$.

If $x \in B$ then since $g$ is left-total there is a $y \in D$ such that $(x, y) \in g$.

Then by the definition of union, $(x, y) \in f \cup g$.

As this holds for all $x$, $f \cup g$ is left-total.