Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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 ϕ(x,y,p) and a,p1,…,pn∈L. If for every x∈a there is exactly one y∈L with ϕL(x,y,p), its image {y∈L:∃x∈a ϕL(x,y,p)} is an element of L. Thus Replacement holds in L, 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.

[F1]

Separation in the constructible universe: The already proved Separation scheme produces subsets of any set in L using fixed relativized formulas.

[F2]

Transitivity, growth, ordinals and rank in L: Ranks bound a set of constructible elements in a level; each level is in L.

[F3]

Finite reflection along constructible levels: Reflection gives the optional direct Def realization once the image and parameters have been bounded.

Proof

1.1F2given

The fixed ambient formula y∈L∧ϕL(x,y,p) is functional on the actual set a, since transitivity puts each x∈a 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 Y⊆Lβ and a,pi∈Lβ. Empty images require no exception to this bound.

2.1F1F2step 1.1

Apply Separation inside L to the set Lβ∈L with formula ∃x∈a ϕ(x,y,p). Its relativization singles out exactly Y, because step 1.1 bounded the entire image. Hence Y∈L, using neither internal Replacement nor a choice of witnesses.

3.1F3step 1.1step 2.1∎

Equivalently, reflect that fixed image-defining formula at a level Lγ above β. All image elements and parameters are in this level. Agreement makes its Def subset precisely Y, so Y∈Lγ+1. This also confirms that the assertion is a scheme for fixed formulas and has no uniform class-truth premise.

Depends on

Dependency tree · 2 levels

Sources