Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 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.

Truth lemma for the term quotient

Statement

In ZF let H be any consistent deductively closed complete Henkin theory with a seed, and MH its term quotient. For a formula ϕ, distinct variables x1,,xn covering its free variables, closed terms t1,,tn, and an assignment a with a(xi)=[ti],

MH,aϕ    ϕ[t1/x1,,tn/xn]H.

Substitution is simultaneous at original free occurrences. In particular MHH. Neither the size of H nor choice of representatives for all classes is required.

Facts & Assumptions

Given: H, its quotient, a formula and a finite representative tuple as in the statement.

[F1]

The quotient interprets constants, functions, relations and equality by closed terms and congruence. (The closed-term quotient structure)

[F2]

Membership in H obeys negation, conjunction and existential closed-term witness equivalences. (Boolean and witness closure of a complete Henkin theory)

[F3]

Free-for substitution commutes with satisfaction. (Free-for substitution commutes with satisfaction)

[F4]

Constructor induction holds for terms and formulas. (Structural induction and recursion on syntax)

[F5]

Equal closed terms can be substituted in formula instances in either direction. (Provable equality is a congruence on closed terms)

Proof

1.1

By term induction, the denotation of a term u whose variables lie in the tuple is [u[tˉ/xˉ]]. At a variable this is the given value, at a constant it is F1, and at f(u1,,ur) the induction hypotheses and F1 give [f(u1[tˉ/xˉ],,ur[tˉ/xˉ])], the required substituted term. Closed insertions do not acquire free variables; sequential substitution at distinct variables agrees here with simultaneous substitution, since inserted terms contain no free variables.

F1F4
2.1

For equality atoms step 1.1 gives equality of classes iff the two closed terms are equivalent, which is exactly membership of their equality in H. For a relation atom, step 1.1 and its definition in F1 identify truth with membership of the substituted atom. F5 ensures the result is unchanged if any representative is replaced by an equivalent term.

F1F5step 1.1
3.1

Suppose the equivalence has been proved for immediate subformulas, with arbitrary finite representative tuples. At ¬ψ, its semantic truth means failure of ψ; the induction hypothesis and F2 translate that to membership of the closed negation. At ψθ, truth means truth of both subformulas, which the hypotheses and F2 identify with membership of the closed conjunction. Both calculations are equivalences.

F2F4step 2.1
3.2

For ϕ=yψ, substitute the supplied closed terms for the free variables other than y in ψ, obtaining a matrix ρ with free variables at most y. The closed instance of ϕ is literally yρ. If MH,ayψ, take its one witness class b and one closed term u with b=[u]. The induction hypothesis for ψ with the updated finite tuple gives ρ[u/y]H. F2 gives yρH. Free-for composition here is legitimate because all inserted terms are closed: binders cannot capture them, and insertions in distinct free positions do not interfere; equivalently their semantic updates agree by F3.

F1F2F3F4step 2.1
4.1

Conversely if yρH, F2 supplies a closed term u with ρ[u/y]H. The induction hypothesis for ψ gives MH,a[y:=[u]]ψ, hence the existential formula is true. If y is vacuous, the same argument uses the nonempty quotient and the unchanged instance. These two directions establish the constructor case.

F1F2F4step 3.2
5.1

The atom, Boolean and existential cases exhaust the primitive syntax, so F4 proves the equivalence for every formula. For a sentence the tuple is empty and the closed instance is the sentence itself; each member of H is therefore true in the quotient. At any induction step only finitely many representative classes and at most one additional witness are involved; finite existential selections are available in ZF and no global representative function is constructed.

F4step 2.1step 3.1step 4.1

Depends on

Used by

Dependency tree · two levels

15 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