Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)
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,,pnL. If for every xa there is exactly one yL with ϕL(x,y,p), its image {yL:xa ϕ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.1

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

F2given
2.1

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

F1F2step 1.1
3.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 YLγ+1. This also confirms that the assertion is a scheme for fixed formulas and has no uniform class-truth premise.

F3step 1.1step 2.1

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