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.
Free-for substitution commutes with satisfaction
Statement
If is free for in , then for every structure and assignment ,
Facts & Assumptions
Given: Work in ZF unless the statement explicitly weakens or supplements it; fix the objects and hypotheses of the statement.
For any terms , variable , structure and assignment , put . Then . (Term substitution commutes with evaluation)
Assignments agreeing on give equal denotations when is a term and the same truth value when is a formula. Also, passage to a reduct preserves denotations and satisfaction for expressions in the smaller signature. In particular sentence truth is independent of assignment; the truth of a formula can be specified by any tuple assigning all its free variables. (Coincidence for term values and satisfaction)
Proof
Write . The term substitution identity proves the assertion for both kinds of atoms. Negation and conjunction transport the inductive equivalences through their truth clauses.
At , if , raw substitution leaves this quantified formula unchanged and updating its bound variable externally cannot affect its truth by coincidence. If , substitution again changes nothing and coincidence gives the result.
Otherwise and . The free-for hypothesis gives and the free-for condition in . For each , coincidence makes . The two distinct-variable updates commute: . Applying the induction hypothesis to at therefore gives the same truth at each witness on both sides.
Existential quantification over these pointwise equivalent assertions proves both directions for . The cases above exhaust its possibilities, so structural induction gives the result for every formula.
Depends on
Used by
- Agreement at one assignment is insufficient Counterexample
- Fresh bound-variable renaming preserves truth Lemma
- Canonical capture-avoiding substitution Proposition
Dependency tree · two levels
5 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, Lecture Notes in Logic (2014) — x1.1.3, p.48 (formula case). (standard reference, not scraped)