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

Boolean and witness closure of a complete Henkin theory

Statement

In ZF let H be a consistent, deductively closed, syntactically complete sentence theory in a language with a seed constant and all Henkin witness axioms. For sentences σ,τ and an existential sentence xϕ,

¬σH    σH,στH    (σH and τH), xϕH    ϕ[t/x]H for some closed term t.

No countability assumption on the language or H is needed.

Facts & Assumptions

Given: H has the stated four properties; all displayed instances are sentences.

[F1]

A witness axiom xϕϕ[c/x] is in H for each existential sentence, for some constant c. (Witness constants and Henkin theories)

[F2]

Consistency excludes a proof of bottom, and syntactic completeness decides every sentence by provability. (Consistency and syntactic completeness)

[F3]

Boolean conjunction and explosion and free-for existential introduction are derivable. (Derived propositional, quantifier and equality rules)

[F4]

Finite proofs may be composed; deductive closure retains sentence conclusions. (Finite support, weakening, and composition of derivations)

Proof

1.1

If both σ and ¬σ belonged to H, their assumption proofs and explosion would prove bottom, contrary to consistency. If σH, completeness gives a proof of σ or ¬σ; the first would put σ in H by deductive closure, so the second puts ¬σ in H. Conversely ¬σH excludes σH by the first argument.

F2F3F4
1.2

If στH, conjunction elimination and closure put both conjuncts in H. If both conjuncts belong, the conjunction introduction tautology and two MP applications give their conjunction in H. Thus both conjunction directions hold.

F3F4
2.1

If xϕH, take the single witness constant in F1; MP and closure yield ϕ[c/x]H, with c a closed term. Conversely a closed term t has no free variables and is free for x in ϕ; applying existential introduction to ϕ[t/x]H and closing gives xϕH. This proves the existential equivalence even for vacuous x. No simultaneous selection of witnesses and no rewriting inside a quantifier is used.

F1F3F4

Depends on

Used by

Dependency tree · two levels

10 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