Finite Cartesian Product of Non-Empty Sets is Non-Empty

Theorem

Let $S_1, S_2, \ldots, S_n$ be non-empty sets.

Then their cartesian product $S_1 \times S_2 \times \cdots \times S_n$ is non-empty.

Proof

We use mathematical induction.

The base case $n = 2$ is proved in Kuratowski Formalization of Ordered Pair, and the induction step follows directly from the definition of an ordered tuple.

$\blacksquare$

This needs considerable tedious hard slog to complete it. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Finish}} from the code. If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.