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 the Easton class extension
Statement
Let be a GBC + Global Choice + GCH ground, a definable Easton class function with class product and an -generic filter (Class-theoretic ground assumptions for Easton forcing, Set-stage names and the forcing truth lemma for the Easton class product).
Then satisfies the Replacement scheme: for every fixed formula and all set parameters , if for some , then the image is a set of ; indeed it is contained in the value of a ground set of witness names lying in one stage .
Facts & Assumptions
Given: a GBC + Global Choice + GCH ground, a definable Easton class function , the class product , an -generic filter , a fixed formula , parameter names and a set .
Stages, names, valuation, definable class forcing and truth lemma for . (Set-stage names and the forcing truth lemma for the Easton class product)
Uniform decisions with witnesses: applied to the formula and the tuples for a ground enumeration of with , there are and maximal antichains such that each cell carries a recorded truth value and, when positive, a ground set name with ; the truth values are computed in and all witness names lie in one stage . (Uniform head-antichain decisions below a class tail)
Separation and the bounded power-set clause hold in , and each is a transitive model of ZFC with the same ordinals as containing the stages below it, satisfying Choice. (Separation and Power Set in the Easton class extension, ZFC and ordinal preservation for supplied transitive Boolean generic extensions, Choice-free regular open completion of forcing preorders)
The Axiom of Choice, so ground sets can be enumerated and images formed. (The Axiom of Choice)
Proof
Fix , choose an infinite regular above the stages of and with , and enumerate [F4]; then and by the valuation and stage clauses of [F1]. Assume . This assertion concerns only the active values ; a name in whose coefficient is not met by may have a value outside .
Apply [F2] to the formula and the tuples , obtaining , maximal antichains and, for every cell with a positive recorded value, a ground name with . Put , a ground set indexed by the set [F3, F4]; by the last clause of [F2] there is an infinite regular with , and then by [F1].
Every actual value lies in that image. Let and let be the unique element of with . The truth value of the existential instance was decided on the antichain by the unique from [F2]. Its recorded value cannot be negative: then a condition of extending would force , contradicting soundness in the actual extension and the existence of . Hence the positive cell carries and forces . Soundness gives , so uniqueness yields . Thus the image is a subset of this set and is itself a set of by Separation [F3].
Replacement follows since , the parameters and were arbitrary, and the proof shows in addition that the image is contained in the value of a ground set of witness names all of which lie in the single stage : this is the statement. ∎
Depends on
- Class-theoretic ground assumptions for Easton forcing
- Set-stage names and the forcing truth lemma for the Easton class product
- Uniform head-antichain decisions below a class tail
- Separation and Power Set in the Easton class extension
- ZFC and ordinal preservation for supplied transitive Boolean generic extensions
- Choice-free regular open completion of forcing preorders
- The Axiom of Choice
Used by
Dependency tree · two levels
33 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
- Thomas Jech, Set Theory, Chapter 15, Replacement in the class extension, (15.16)-(15.17), printed pp.236-237 (standard reference, not scraped)