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

Relativization agrees with induced set satisfaction

Statement

For every nonempty set M, let M=(M, ⁣M2) be its membership structure. For every fixed pure membership formula ϕ and assignment s:ωM, its set satisfaction agrees with the ambient evaluation of ϕM at those free-variable values and parameter M. No transitivity of M is required. For a definable proper class the corresponding relativized expression is only a formula-by-formula schema.

Facts & Assumptions

Given: Work in ZF unless the statement explicitly weakens or supplements it; fix the objects and hypotheses of the statement.

[F1]

Fix a pure membership formula δ(z,p) defining a class C={z:δ(z,p)}. This is eliminable notation for a predicate, not a class object. For a fixed pure membership formula ϕ, first rename its binders away from the parameter variables p. Define ϕC by keeping atoms, commuting with Boolean constructors, and setting (xψ)C=x(δ(x,p)ψC),(xψ)C=x(δ(x,p)ψC). Copies of δ(x,p) are inserted by capture-avoiding substitution and fresh internal bound variables. In the set case C=M use the predicate zM, with a fresh parameter variable for M. This operation is meaningful even for an empty class. It does not make the empty class an admitted structure: carriers of structures remain nonempty. For proper classes, evaluation of ϕC means a separate ambient formula for each fixed ϕ, not a uniform universe satisfaction relation. Conventions and prerequisites: prop-capture-avoiding-substitution. (Relativization to sets and definable classes)

[F2]

For every set signature L and L-structure M there is a unique set SatMFormL×Mω. Writing M,sϕ for membership, its clauses are M,su=v    us=vs, M,sR(t1,,tn)    (t1s,,tns)RM, M,s¬ϕ    not M,sϕ, M,sϕψ    (M,sϕ and M,sψ), M,sxϕ    bM (M,s[x:=b]ϕ). The set is uniformly first-order definable from L and the structure data. (Existence and uniqueness of set satisfaction)

Proof

1.1

All terms are variables. Equality and membership between two values in M are exactly the ambient equality and membership, because the structure restricts the ambient relation. Atoms are unchanged by relativization, giving the atomic equivalence.

F1F2
2.1

Negation and conjunction preserve the inductive equivalences. For xψ, the ambient guard xM ranges over exactly the same witnesses bM as the satisfaction clause, and the induction hypothesis applies at s[x:=b]. This proves both directions for quantifiers and hence all formulas. The parameter for M cannot be captured because the construction uses fresh binders.

F1F2step 1.1
3.1

The argument used only restriction of membership and equality, never transitivity. Replacing the set guard by a fixed defining formula for a class still makes a separate ambient formula at each syntactic step; it does not assemble a truth relation with proper-class assignment domain.

F1step 2.1

Depends on

Used by

Dependency tree · two levels

4 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