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 there is an infinite initial ordinal with . 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.
In ZF, for every infinite initial ordinal , is a transitive set and . For infinite initial ordinals , one has . (H_kappa is a transitive subset of V_kappa)
Assume the Axiom of Choice (def-axiom-of-choice). Then every set can be well ordered: there is a relation on 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)
For every set there is an ordinal (def-ordinal) that does not inject into , that is, admits no injective function into . The least such ordinal is the Hartogs number , and it is exactly the set of order types (thm-mostowski-collapse) of the well-ordered subsets of . The proof is choice free. That is the whole point of the theorem: in ZF alone, with no assumption that can be well ordered, one still gets an ordinal too long to be laid inside . (Hartogs: an ordinal that does not inject into a given set)
Proof
Let . By the well-ordering theorem and AC, is well-orderable and has an ordinal order type . Set , an infinite ordinal into which injects.
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 witnesses .
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
- Weiss, An Introduction to Set Theory (2014) — Theorem 41(2), p.101. (standard reference, not scraped)