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.
H_omega equals V_omega
Statement
In ZF, . These are exactly the sets whose root-inclusive transitive closure is finite, called hereditarily finite sets.
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)
In ZF without Foundation define the cumulative hierarchy by For each ordinal , use the set well-order recursion schema on . On histories of domain return ; on domain return the power set of the last value; on nonzero limit domains return the union of the range. Each is a unique set. Recursions on different ordinal intervals agree on overlaps by the uniqueness clause applied to the smaller interval. Hence the definition of as the value at is uniform and independent of the chosen interval. Power Set is used at successors and Replacement and Union at limits. The notation denotes a definable class function, not a set sequence. Conventions and prerequisites: thm-transfinite-recursion, lem-ordinal-basics, def-limit-ordinal. (The cumulative hierarchy)
Proof
The general bound gives . The definition of says its root closure injects into a finite ordinal, exactly finiteness: a subset of a finite ordinal can be enumerated in increasing order, and a finite set injects into its size.
Every is finite by natural induction. is empty. If has elements, membership bits relative to a finite enumeration biject its power set with the length- binary words. Those form a finite set: for zero length there is one word, and appending either bit doubles the previous finite number. Thus is finite.
If , choose with . The finite transitive set contains as an element, hence contains by minimality. That closure is finite, so . Together with step 1.1 this proves equality.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
7 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 42, omega case pp.101–102. (standard reference, not scraped)