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.
Soundness for arbitrary set signatures
Statement
In ZF, for any set signature and sentence theory , if , every nonempty set structure satisfying satisfies under every assignment. Consequently a theory with a model is consistent.
Facts & Assumptions
Given: A nonempty -structure , an arbitrary assignment , and a finite derivation from .
The six axiom schemes and three rules are in Formal proofs from sentence theories.
Free-for substitution satisfies iff . (Free-for substitution commutes with satisfaction)
Satisfaction depends only on free variables, and sentence truth is assignment-independent. (Coincidence for term values and satisfaction)
Semantic consequence quantifies over nonempty set structures and every assignment. (Theories, models and semantic consequence)
Proof
Assumptions in are true at every assignment by the hypothesis and coincidence. Boolean tautologies are true under the Boolean values of their constituent formulas. Reflexivity is true because a term's value equals itself. For equality substitution, if is true, their denotations agree; updating with either value gives the same assignment, so F2 gives equal truth values for the two substituted formulas. Thus its implication is true.
Universal instantiation is true: the universal truth clause includes the particular value , and F2 identifies the instance. Existential introduction is true: a true instance supplies precisely that value as a witness by F2. For distribution, if and are true at , then stays true at every because is not free in it. The universal premise gives at each such assignment, hence at .
Induct on proof lines with the invariant “true under every assignment in .” MP preserves this invariant by the implication truth table. For generalization, the invariant for its premise holds at each , so its universal conclusion holds at .
For existential elimination, suppose . Take one witness . The invariant for the earlier implication applies at , giving there. Since the rule requires absent from , F3 gives at . If the existential antecedent is false the conclusion is true by its Boolean clause. This verifies the third rule and finishes the induction.
Thus the last line is true at every assignment in every model of , exactly F4. No such model satisfies , because every candidate witness equals itself. A proof of would contradict the established invariant, so any theory with a model is consistent. Only one witness was used for one implication in step 3.1; no family of witnesses or AC is required.
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
- Moschovakis, Theorem 1H.4 p36; local semantic verification of all six axiom schemes and three rules. (standard reference, not scraped)