Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-09
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.

Fresh constants may be eliminated from a finite proof

Statement

In ZF, if a constant c occurs in neither a sentence theory T nor an L-sentence σ, any L(c)-proof Tσ yields an L-proof. More generally replace c uniformly in a finite proof by a variable z absent from its formulas and annotations: this gives a proof from T of the replaced conclusion, which may then be universally generalized in z. Expanding a signature by any set of fresh constants is conservative for original-language sentences.

Facts & Assumptions

Given: A finite proof from sentence assumptions omitting c.

[F1]

The axioms, free-for restrictions and three inference rules are those of Formal proofs from sentence theories.

[F2]

Proof support and composition are finite. (Finite support, weakening, and composition of derivations)

Proof

1.1

The finite proof and its finitely many finite annotations mention only finitely many variables. Choose the least-index variable z not mentioned. Replace every token c in formulas and substitution data by z, leaving binders unchanged. No binder is z, so every inserted z remains free. Assumption lines are unchanged since c is absent from T.

F1F2
2.1

A Boolean axiom remains the same tautology pattern with transformed substituted formulas; reflexivity remains reflexivity. For either quantifier substitution axiom and the equality substitution axiom, token replacement commutes with the indicated free-variable substitution. Its new term can gain only the free variable z, and no binder in the transformed matrix is z, so every former free-for condition still holds. Universal distribution's restricted variable is an old variable: replacing c by z creates no free occurrence of that old variable in its antecedent. Thus every transformed axiom is an axiom of the smaller signature.

F1step 1.1
2.2

MP retains the identical implication/premise matching. A generalization in an old variable still generalizes that variable after replacement. For existential elimination the eliminated variable is old and distinct from z; the consequent gains no occurrence of it, so its restriction persists. Therefore induction along the unchanged reference indices gives a valid transformed derivation. Generalization in z may be appended because the base assumptions are sentences.

F1step 1.1
3.1

If the conclusion omits c, it is unchanged by this operation; we obtain the asserted smaller-language proof. A proof in an expansion by any set of fresh constants mentions only finitely many of them. Remove them one at a time by the operation above, each time taking a new variable outside the finite current proof. The final proof uses only the original signature. Conversely every original proof is still a proof in the expansion. Hence the expansion is conservative.

F2step 2.1step 2.2

Depends on

Used by

Dependency tree · two levels

9 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