Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-07-26 (claude-opus-5)
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.

Basic closure properties of ordinals

Statement

Let α and β be ordinals (Ordinal (von Neumann)). Then:

(a) every element of α is an ordinal;

(b) α∉α;

(c) α+=α∪{α} is an ordinal;

(d) if A is a nonempty set of ordinals then ⋂A is an ordinal;

(e) if A is any set of ordinals then ⋃A is an ordinal;

(f) α⊆β if and only if α∈β or α=β;

(g) any two ordinals are comparable under inclusion: α⊆β or β⊆α.

Everything here is a theorem of ZF and uses no choice principle.

Facts & Assumptions

Given: Ordinals α, β and, where stated, a set A all of whose members are ordinals. Claim (g) is not in the usual list of basic facts, but claim (e) needs it, so it is proved here rather than deferred; the trichotomy statement is then read off from it on the next item of this page.

[A1]

An ordinal is a transitive set on which ∈ is a strict well-order: irreflexive, transitive as a relation, trichotomous, and with a least element in every nonempty subset (Ordinal (von Neumann)).

[L1]

The restriction of a strict well-order to a subset is again a strict well-order, since totality and least elements are inherited by subsets (Well-order and well-ordered set).

Proof

technique · direct
1.1

Claim (a): let x∈α; then x⊆α by transitivity of α, so ∈ strictly well-orders x by [L1], and x is transitive, because z∈y∈x gives y∈α and z∈α by transitivity of α, whence z∈x by transitivity of the relation ∈ on α; so x is an ordinal.

A1L1
1.2

Claim (b): if α∈α then α is an element of α satisfying α∈α, contradicting irreflexivity of ∈ on α; hence α∉α.

A1
1.3

Claim (f), the easy direction: α∈β gives α⊆β by transitivity of β, and α=β gives α⊆β trivially.

A1
2.1

Claim (f), the substantial direction: assume α⊆β and α≠β, let γ be the ∈-least element of the nonempty set β∖α⊆β, and check γ=α; indeed δ∈γ forces δ∈β by transitivity of β and then δ∈α, since otherwise δ∈β∖α with δ∈γ contradicts minimality, so γ⊆α; conversely δ∈α⊆β compared with γ by trichotomy in β cannot satisfy δ=γ or γ∈δ, since each would put γ∈α, using transitivity of α in the second case, so δ∈γ and α⊆γ; hence α=γ∈β.

step 1.3A1
2.2

Claim (c): α+ is transitive, because x∈α+ means x∈α, whence x⊆α⊆α+, or x=α⊆α+; the relation ∈ is irreflexive on α+ by [A1] and step 1.2, transitive there because x∈y∈z with z=α gives x∈y⊆α=z and with z∈α reduces to transitivity in α, and trichotomous there because two elements of α are comparable in α while x∈α satisfies x∈α and neither α∈x nor x=α, both of which would give α∈α; finally a nonempty S⊆α+ has an ∈-least element, namely the ∈-least element of S∩α when that is nonempty and α otherwise.

step 1.2step 1.1A1
2.3

Claim (d): ⋂A is transitive, since x∈⋂A gives x∈δ and hence x⊆δ for every δ∈A, so x⊆⋂A; and ⋂A is a subset of any fixed member of the nonempty set A, so ∈ strictly well-orders it by [L1].

step 1.1A1L1
3.1

Claim (g): γ=α∩β is an ordinal by claim (d) applied to {α,β}, and γ⊆α and γ⊆β, so claim (f) gives γ∈α or γ=α, and likewise for β; both memberships at once would give γ∈α∩β=γ, contradicting claim (b), so γ=α or γ=β, that is α⊆β or β⊆α.

step 2.3step 2.1step 1.3step 1.2
4.1

Claim (e): ⋃A is transitive, since x∈δ∈A gives x⊆δ⊆⋃A; its elements are ordinals by claim (a), so ∈ is irreflexive on it by claim (b) and transitive on it because x∈y∈z with z∈δ∈A puts x,y,z all in the ordinal δ; any two of its elements lie in a common member of A by claim (g) and are therefore comparable, which gives trichotomy by claim (b) and claim (f); and a nonempty S⊆⋃A has an ∈-least element, namely the ∈-least element of S∩δ for any δ∈A meeting S, since an element of S lying ∈-below it would lie in δ by transitivity and contradict minimality.

step 3.1step 1.1step 1.2step 2.1A1
5.1

Claims (a) to (g) are established.

step 1.1step 1.2step 1.3step 2.1step 2.2step 2.3step 3.1step 4.1∎

Remarks

The successor is the immediate successor. Claim (c) makes α+ an ordinal, and it is the least ordinal strictly above α: any γ with α∈γ satisfies α+⊆γ, hence α+≤γ by claim (f). So the ordinals have no gaps immediately above a given point, which is what makes the successor and limit dichotomy of Successor and limit ordinals exhaustive.

Suprema come for free. Claim (e) says a set of ordinals always has a least upper bound, namely ⋃A: it contains every member of A as a subset, hence lies weakly above each by claim (f), and any ordinal weakly above all of them contains ⋃A. Claim (d) gives the dual statement for a nonempty set. Neither needs any completeness assumption, in sharp contrast with the situation for R.

Nonemptiness in claim (d) is essential. The intersection of the empty family is not a set, so the hypothesis cannot be dropped. The union of the empty family, by contrast, is ∅=0, which is why claim (e) needs no such hypothesis.

Claim (g) is a departure from the usual bookkeeping. It is normally derived alongside trichotomy. It is proved here because claim (e) cannot be proved without it, and separating them would either duplicate the argument or create a circular dependency between this lemma and Trichotomy and well-ordering of the ordinals.

The naturals are the model case. Every natural number is a transitive set and satisfies n∉n (Every natural number is a transitive set and is not a member of itself), which is exactly claims (a) and (b) in the situation this definition abstracts, and σ(n)=n∪{n} is the successor operation of claim (c). That every natural number, and ω itself, really is an ordinal is proved in ω is the least limit ordinal.

Depends on

Used by

…and 42 more results.

Dependency tree · two levels

10 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