Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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.

Hereditary size exhausts V under Choice

Statement

Assume ZFC. For every set x there is an infinite initial ordinal κ with xHκ. Hence the hereditary-size stages exhaust the universe in the class sense under Choice.

Facts & Assumptions

Given: Work in ZF unless the statement explicitly weakens or supplements it; fix the objects and hypotheses of the statement.

[F1]

In ZF, for every infinite initial ordinal κ, Hκ is a transitive set and HκVκ. For infinite initial ordinals κμ, one has HκHμ. (H_kappa is a transitive subset of V_kappa)

[F2]

Assume the Axiom of Choice (def-axiom-of-choice). Then every set X can be well ordered: there is a relation on X making it a well-ordered set (def-well-order). The Axiom of Choice is used only inside thm-zorn, and nowhere else in the argument below. (The well-ordering theorem)

[F3]

For every set A there is an ordinal (def-ordinal) that does not inject into A, that is, admits no injective function into A. The least such ordinal is the Hartogs number (A), and it is exactly (A)={ot(S,R):SA and R well-orders S}, the set of order types (thm-mostowski-collapse) of the well-ordered subsets of A. The proof is choice free. That is the whole point of the theorem: in ZF alone, with no assumption that A can be well ordered, one still gets an ordinal too long to be laid inside A. (Hartogs: an ordinal that does not inject into a given set)

Proof

1.1

Let T=TC({x}). By the well-ordering theorem and AC, T is well-orderable and has an ordinal order type α. Set δ=αω, an infinite ordinal into which T injects.

F1F2
2.1

Let κ be the Hartogs number of δ. It is initial: a bijection with any smaller ordinal would combine with an injection of that smaller ordinal into δ to contradict its defining noninjection. Also δ<κ, since every ordinal at most δ injects into δ. Thus κ is infinite and the injection Tδ<κ witnesses xHκ.

F1F3step 1.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

18 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