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.
Transitivity and a valuation rank bound
Statement
In ZF, for a transitive ZF ground model M and any , is transitive. For each name tau, . No axiom satisfaction or no-new-ordinals theorem is asserted here.
Facts & Assumptions
Given: ZF; arbitrary G subset P. Subname decoding in transitive M proves transitivity, and the two recursive supremum formulas prove the rank bound even for empty G.
Valuation of names and M[G]: Valuation selects values of subnames, and M[G] consists of values of names in M.
Forcing names and their rank: Every descendant of a name is a name, and name rank is the supremum of predecessor name-ranks plus one.
Membership rank under Foundation: Membership rank is the supremum of the ranks of members plus one.
Proof
If , write for a name . By F1 some has and . Transitivity of M, applied through the Kuratowski pair, gives ; F2 says that sigma is a name. Thus , proving transitivity.
Induct on the subname relation. Every member of the valuation of tau is the valuation of some sigma below tau, so F3 gives its rank as the supremum of their value-ranks plus one. By induction this is at most the supremum of over all subnames sigma, which F2 identifies with . With no selected subnames the value rank is zero and the inequality still holds. This includes both the empty name and empty G.
Depends on
Used by
Dependency tree · two levels
8 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
- Karagila Proposition 2.9 p7; Marks Lemma 24.3 p98 (standard reference, not scraped)