Theorem·T40
Substitution into a formula exists and is unique
The recursive substitution characterization genuinely determines exactly one formula, for every formula substituted into.
In words
For any formula substituted into, its substitution result exists and is unique.
Never needed: F05 · F10 · F13 · A03 · A04 · A05 · A09 (computed from the citation graph, not asserted).
Proof
- 1By strong induction on : assume every formula of length has existing uniquely (the induction hypothesis, "IH"); show the same for of length .
- 2
- 3
- 4neg, bin. If ( , as in the proof of T36): by the IH, exists uniquely, so the neg clause forces . Likewise if ( , ): by the IH applied to and to , both and exist uniquely, and the bin clause forces the value.
- 5quant. If ( , ): exactly one of or holds. If , the same clause of D098 forces outright - no induction needed. If , the diff clause applies instead: by the IH, exists uniquely, so the clause forces . The same and diff clauses never both apply (their hypotheses , are exclusive).
- 6
∎
Remarks
Confirms the notation
is well posed for every formula. As in the free-variable case, no generalization over assignments is needed - substitution is purely syntactic - but unlike that case, the quantifier clause genuinely splits in two (same variable versus a different one), each pinning down the value by a different route.