Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-27
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 (M,C) be a GBC + Global Choice + GCH ground, F a definable Easton class function with class product P=P(F) and G an M-generic filter (Class-theoretic ground assumptions for Easton forcing, Set-stage names and the forcing truth lemma for the Easton class product).

Then M[G]=⋃λM[G≤λ] is a transitive model of ZFC containing M and having exactly the ordinals of M, the class forcing relation satisfies the truth lemma in it, and for every ordinal λ of M every subset of λ in M[G] belongs to a single set stage: there is an infinite regular γ with P(λ)M[G]=P(λ)M[G≤γ]∈M[G≤γ].

Facts & Assumptions

Given: a GBC + Global Choice + GCH ground (M,C), a definable Easton class function F, the class product P=P(F) and an M-generic filter G.

[F1]

M[G]=⋃λM[G≤λ], the stages are nested, every element of M[G] is the value of a P-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)

[F2]

Separation, Power Set and the bounded power-set clause hold in M[G]. (Separation and Power Set in the Easton class extension)

[F3]

Replacement holds in M[G]. (Replacement in the Easton class extension)

[F4]

Each stage M[G≤λ] is, via the regular-open completion of the set forcing P≤λ, a transitive model of ZFC having exactly the ordinals of M and satisfying Choice, and G≤λ 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)

[F5]

Every element of M is xˇG 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)

[F6]

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

1.1

Transitivity and ordinals. If u∈τG∈M[G], then u=σG for some pair ⟨σ,p⟩∈τ by the valuation clause of [F1], so u∈M[G] and M[G] is transitive; and every x∈M equals its check-name value in M[G] by [F5], so M⊆M[G]. Each stage has exactly the ordinals of M by [F4], and the stages are nested by [F1], so the ordinals of M[G] are exactly those of M.

F1F4F5
2.1

The easy axioms. Extensionality and Foundation are inherited from the ambient universe because M[G] is transitive and its membership relation is the true one; Infinity holds because ω∈M⊆M[G] by step 1.1. For Pairing and Union, given x1,…,xn∈M[G], choose by [F1] a single stage M[G≤λ] containing all of them, possible because the stages are nested and every element lies in some stage; then {x1,…,xn} and ⋃x1 are elements of that ZFC model by [F4] and hence of M[G]. Choice holds because each stage satisfies it by [F4] and [F6], so every element of M[G] carries a well-ordering in M[G], and the well-orderable sets of an extension form a model of Choice.

F1F4F6step 1.1
3.1

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 M[G] a transitive model of ZFC containing M with the same ordinals and the truth lemma of [F1]. Applying the bounded power-set clause of [F2] to the ordinal a=λ∈M⊆M[G] gives an infinite regular γ with P(λ)M[G]=P(λ)M[G≤γ]∈M[G≤γ], which is the last clause.

F1F2F3step 2.1
4.1

Steps 1.1, 2.1 and 3.1 establish every clause: M[G] is a transitive ZFC model containing M with the ordinals of M, 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. ∎

step 1.1step 2.1step 3.1

Depends on

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