Theorem·T38
The free variables of a formula exist and are unique
The recursive free-variable characterization genuinely determines exactly one set, for every formula.
In words
For any formula of the language, its set of free variables exists and is unique.
Never needed: F05 · F10 · F13 · 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
- 4
- 5bin. If ( , as in the proof of T36): by the IH, and exist uniquely, so their union is a specific set; the bin clause forces to equal it.
- 6quant. If ( , ): by the IH, exists uniquely, so (Separation) is a specific set; the quant clause forces to equal it.
- 7
∎
Remarks
Confirms the notation
is well posed for every formula. Unlike satisfaction, no generalization over assignments is needed here:
is a purely syntactic notion, entirely independent of any structure or assignment, so a plain strong induction on length suffices.