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.
Replacement in L
Statement
In ZF, fix a formula and . If for every there is exactly one with , its image is an element of . Thus Replacement holds in , as a scheme.
Facts & Assumptions
Given: ZF; a fixed formula internally functional on a constructible set. Ambient Replacement gives the set image and a rank bound, then internal Separation or reflected Def puts that image in L.
Separation in the constructible universe: The already proved Separation scheme produces subsets of any set in L using fixed relativized formulas.
Transitivity, growth, ordinals and rank in L: Ranks bound a set of constructible elements in a level; each level is in L.
Finite reflection along constructible levels: Reflection gives the optional direct Def realization once the image and parameters have been bounded.
Proof
The fixed ambient formula is functional on the actual set , since transitivity puts each in L. Ambient Replacement therefore forms its image Y as a set of constructible elements. Ambient Replacement again forms the set of their constructible ranks. A successor above their supremum and the finitely many parameter ranks gives with and . Empty images require no exception to this bound.
Apply Separation inside L to the set with formula . Its relativization singles out exactly Y, because step 1.1 bounded the entire image. Hence , using neither internal Replacement nor a choice of witnesses.
Equivalently, reflect that fixed image-defining formula at a level above . All image elements and parameters are in this level. Agreement makes its Def subset precisely Y, so . This also confirms that the assertion is a scheme for fixed formulas and has no uniform class-truth premise.
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
- Geschke Theorem 5.7 p15 (local expansion of omitted Replacement case); Marks Lemma 20.5 p87 (standard reference, not scraped)