TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-05 (gpt-5.6-sol-codex-subscription)

How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Every infinite cardinal is $ℵ_{α}$ for exactly one ordinal $α$ , in ZF; and, assuming the Axiom of Choice, every infinite set is equinumerous with exactly one aleph

Statement

(a) In ZF. Every infinite cardinal $κ$ (Cardinal (initial ordinal) and cardinality) equals $ℵ_{α}$ (The successor cardinal $κ^{+}$ , the alephs $ℵ_{α}$ , the beths $ℶ_{α}$ , successor and limit cardinals, and the identifications $ℵ_{0} = ω$ and $ℵ_{1} = ω_{1}$ ) for exactly one ordinal $α$ . So the alephs are not merely a supply of infinite cardinals: they are all of them, and the operation $α \mapsto ℵ_{α}$ is a bijective enumeration of the infinite cardinals by the ordinals.

(b) Assuming the Axiom of Choice (The Axiom of Choice). Every infinite set is equinumerous (Equinumerous sets, $A \approx B$ and $A ⪯ B$ ) with exactly one aleph.

The two clauses say different things, and the difference is the whole content of the choice hypothesis. Clause (a) classifies cardinals, which are ordinals; clause (b) classifies sets, and needs to know first that an arbitrary set has a cardinality at all.

Facts & Assumptions

Given: ZF; the Axiom of Choice only in clause (b).

[L1]

The operation $α \mapsto ℵ_{α}$ is defined at every ordinal, takes infinite cardinal values, is strictly increasing, satisfies $ℵ_{0} = ω$ , $ℵ_{α + 1} = ℵ_{α}^{+}$ , $ℵ_{λ} = ⋃ {ℵ_{β} : β \in λ}$ at limits, and satisfies $α \leq ℵ_{α}$ (The clauses at $0$ , at a successor and at a limit determine exactly one operation $α \mapsto ℵ_{α}$ , in ZF, and — assuming the Axiom of Choice — exactly one operation $α \mapsto ℶ_{α}$ ; each value is an infinite cardinal, each is strictly increasing and continuous at limits, and $α \leq ℵ_{α}$ , The successor cardinal $κ^{+}$ , the alephs $ℵ_{α}$ , the beths $ℶ_{α}$ , successor and limit cardinals, and the identifications $ℵ_{0} = ω$ and $ℵ_{1} = ω_{1}$ ).

[L2]

$κ^{+}$ is the least cardinal strictly above the cardinal $κ$ (For every set $A$ the Hartogs number $ℵ (A)$ is a cardinal, and for every cardinal $κ$ it is the least cardinal strictly above $κ$ ; this is a theorem of ZF).

[L3]

Every nonempty set of ordinals has an $\in$ -least element; ordinals satisfy trichotomy; $α \subseteq β$ iff $α \in β$ or $α = β$ ; an ordinal is a transitive set (Trichotomy and well-ordering of the ordinals, Basic closure properties of ordinals, Ordinal (von Neumann)).

[L4]

Every ordinal is exactly one of $0$ , a successor, or a limit (Successor and limit ordinals); $ω$ is the least limit ordinal ( $ω$ is the least limit ordinal).

[L5]

A cardinal $κ$ is finite when $κ \in ω$ and infinite when $ω \subseteq κ$ , that is $ω \leq κ$ (Cardinal sum $κ \oplus λ$ , product $κ \otimes λ$ and exponentiation $κ^{λ}$ , and why they are written apart from the ordinal operations); and $ω$ is a cardinal (claim (a) of Every natural number and $ω$ are cardinals, every infinite cardinal is a limit ordinal, and on the natural numbers the cardinal operations are the published finite counting operations, with $∣ A ∣$ in the finite sense equal to $∣ A ∣$ in the cardinal sense, Cardinal (initial ordinal) and cardinality).

[L6]

For a well-orderable $X$ , $∣ X ∣$ is the least ordinal equinumerous with $X$ , $X \approx ∣ X ∣$ , it is a cardinal, and $∣ α ∣ = α$ exactly when $α$ is a cardinal (A set equinumerous with some ordinal has a least such ordinal, that ordinal is a cardinal, and equinumerous sets get the same one; no choice principle is used).

[L7]

Assuming the Axiom of Choice, every set carries a well-order (The well-ordering theorem, The Axiom of Choice).

[L8]

A set is finite when it is equinumerous with a natural number (Finite, countably infinite, countable, uncountable).

Proof

technique · direct

1.1

Let $κ$ be an infinite cardinal and put $S = {α \in κ \cup {κ} : κ \leq ℵ_{α}}$ ; then $κ \in S$ , since $κ \in κ \cup {κ}$ and $κ \leq ℵ_{κ}$ by [L1], so $S$ is a nonempty set of ordinals.

L1L3

1.2

The enumeration is injective: if $ℵ_{α} = ℵ_{β}$ with $α \neq β$ then one of $α \in β$ , $β \in α$ holds by [L3], and strict increase in [L1] makes the two values distinct; so no infinite cardinal is an aleph at two different indices.

L1L3

2.1

Let $α$ be the $\in$ -least element of $S$ , which exists by [L3]; then $κ \leq ℵ_{α}$ , and $ℵ_{β} < κ$ for every $β \in α$ , because $β \in α \in κ \cup {κ}$ puts $β$ in $κ \cup {κ}$ by transitivity, so $β \notin S$ and trichotomy leaves $ℵ_{β} < κ$ .

step 1.1L3

3.1

In each of the three cases of [L4] this forces $κ = ℵ_{α}$ : if $α = 0$ then $ω = ℵ_{0} \leq κ \leq ℵ_{0}$ by [L5], so $κ = ℵ_{0}$ ; if $α = β + 1$ then $ℵ_{β} < κ$ by step 2.1 and $κ$ is a cardinal, so $ℵ_{β + 1} = ℵ_{β}^{+} \leq κ$ by [L2], while $κ \leq ℵ_{α}$ gives the reverse; and if $α$ is a limit then $ℵ_{β} \subseteq κ$ for every $β \in α$ by step 2.1, so $ℵ_{α} = ⋃ {ℵ_{β} : β \in α} \subseteq κ$ by [L1], again with the reverse inequality already in hand.

step 2.1L1L2L3L4L5

4.1

Claim (a) is step 3.1 with the uniqueness of step 1.2; and claim (b) follows: assuming the Axiom of Choice an infinite set $X$ is well-orderable by [L7], so $∣ X ∣$ exists by [L6] and is not a natural number, since $X \approx ∣ X ∣$ would then make $X$ finite by [L8], whence $∣ X ∣$ is an infinite cardinal by [L5] and $X \approx ∣ X ∣ = ℵ_{α}$ for exactly one $α$ , uniqueness holding because $X \approx ℵ_{α}$ forces $ℵ_{α} = ∣ X ∣$ by [L6].

step 1.2step 3.1L5L6L7L8∎

Remarks

What makes the enumeration exhaustive. Not the recursion, which only produces alephs, but the fact that $α \leq ℵ_{α}$ : it guarantees that the alephs eventually overtake any given cardinal, so a least index with $κ \leq ℵ_{α}$ exists, and the three-case analysis then shows that "least" forces equality. Without the inequality the search would have no place to start.

Clause (b) is exactly as strong as the well-ordering theorem. If every infinite set were equinumerous with an aleph then every set would be well-orderable, since an aleph is an ordinal, and that is equivalent to the Axiom of Choice (Choice, Zorn and well-ordering are equivalent). So clause (b) is not a theorem of ZF, and it is stated with its hypothesis rather than proved.

What is enumerated and what is not. The alephs enumerate the infinite cardinals in increasing order. They do not enumerate the values of the power operation: assuming the Axiom of Choice, so that $2^{ℵ_{0}}$ is a cardinal at all, it is an aleph by clause (a), but which one is not settled by the axioms in use here, and nothing on this page or its companion asserts a value.

Depends on

Used by

Dependency tree · two levels

61 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources

P. Koellner, Set Theory: The Independence Phenomenon, Theorem 3.11 (standard reference, not scraped)
Aleph number (Wikipedia) (standard reference, not scraped)
T. Jech, Set Theory, 3rd millennium ed., Ch. 3 (Cardinal numbers) (standard reference, not scraped)

Every infinite cardinal is ℵαℵα​ for exactly one ordinal αα, in ZF; and, assuming the Axiom of Choice, every infinite set is equinumerous with exactly one aleph