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.
The Easton class-generic union satisfies ZFC
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 is a transitive model of ZFC containing and having exactly the ordinals of , the class forcing relation satisfies the truth lemma in it, and for every ordinal of every subset of in belongs to a single set stage: there is an infinite regular with .
Facts & Assumptions
Given: a GBC + Global Choice + GCH ground , a definable Easton class function , the class product and an -generic filter .
, the stages are nested, every element of is the value of a -name, and the class forcing relation is definable and satisfies the truth lemma. (Set-stage names and the forcing truth lemma for the Easton class product)
Separation, Power Set and the bounded power-set clause hold in . (Separation and Power Set in the Easton class extension)
Replacement holds in . (Replacement in the Easton class extension)
Each stage is, via the regular-open completion of the set forcing , a transitive model of ZFC having exactly the ordinals of and satisfying Choice, and is its generic filter. (ZFC and ordinal preservation for supplied transitive Boolean generic extensions, Choice-free regular open completion of forcing preorders, Forcing preserves ordinals)
Every element of is for its check name, and check names with the top condition of a head are head names. (Set-stage names and the forcing truth lemma for the Easton class product)
The ground model satisfies the Axiom of Choice by hypothesis; each set-forcing stage satisfies Choice by [F4]. (The Axiom of Choice, ZFC and ordinal preservation for supplied transitive Boolean generic extensions)
Proof
Transitivity and ordinals. If , then for some pair by the valuation clause of [F1], so and is transitive; and every equals its check-name value in by [F5], so . Each stage has exactly the ordinals of by [F4], and the stages are nested by [F1], so the ordinals of are exactly those of .
The easy axioms. Extensionality and Foundation are inherited from the ambient universe because is transitive and its membership relation is the true one; Infinity holds because by step 1.1. For Pairing and Union, given , choose by [F1] a single stage containing all of them, possible because the stages are nested and every element lies in some stage; then and are elements of that ZFC model by [F4] and hence of . Choice holds because each stage satisfies it by [F4] and [F6], so every element of carries a well-ordering in , and the well-orderable sets of an extension form a model of Choice.
The hard axioms. Separation is [F2], Replacement is [F3], and Power Set with the bounded clause is [F2] as well; together with step 2.1 and step 1.1 this makes a transitive model of ZFC containing with the same ordinals and the truth lemma of [F1]. Applying the bounded power-set clause of [F2] to the ordinal gives an infinite regular with , which is the last clause.
Steps 1.1, 2.1 and 3.1 establish every clause: is a transitive ZFC model containing with the ordinals of , carries the definable class forcing relation and its truth lemma, and has all subsets of any ground ordinal inside one set 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
- Replacement in the Easton class extension
- ZFC and ordinal preservation for supplied transitive Boolean generic extensions
- Choice-free regular open completion of forcing preorders
- Forcing preserves ordinals
- The Axiom of Choice
Used by
Dependency tree · two levels
36 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, M[G] is a model of ZFC, printed p.237 (standard reference, not scraped)