Condition for Set Equivalent to Cardinal Number

Theorem
Let $S$ be a set.

Let $\card S$ denote the cardinal number of $S$.

That is, let $\card S$ be the intersection of all ordinals equivalent to $S$.

Note that in the absence of the Axiom of Choice, $\card S$ may be the class of all sets.

Then the following are equivalent:


 * $(1): \quad S \sim \card S$
 * $(2): \quad \exists x \in \On: S \sim x$
 * $(3): \quad \exists x \in \On: \exists y: \paren {y \subseteq x \land S \sim y}$

where $A \sim B$ means that there is a bijection from $A$ onto $B$, and the quantification over $y$ is unbounded (so $y$ may be any set).

$2 \implies 1$
If $\exists x \in \On: S \sim x$, then by Ordinal Class is Well-Ordered by Subclass Relation there is a smallest ordinal $x$ such that $S \sim x$.

This smallest ordinal $x$ is the cardinal number of $S$, by definition.

$3 \implies 2$
Suppose that $y \subseteq x$ and $S \sim y$ for some ordinal $x$.

Since $y \subseteq x$, it follows that $y \sim z$ for some $z \in \On$ by Unique Isomorphism between Ordinal Subset and Unique Ordinal.

Therefore, by Set Equivalence behaves like Equivalence Relation, $S \sim z$.

$1 \implies 3$
Suppose that $3$ is not true.

It follows that $S \not \sim x$ for any ordinal $x$.

But $S \not \sim \mathbb U$, so $S \not \sim \card S$ by the definition of cardinal number.

The result follows by contraposition.