Theorem·T37
The variables of a term exist and are unique
The recursive variable-occurrence characterization genuinely determines exactly one set, for every term.
In words
For any term of the language not directly named here, its set of occurring 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 term of length has existing uniquely (the induction hypothesis, "IH"); show the same for of length .
- 2By T32 (ii), is either for a unique , or for a unique - never both.
- 3
- 4Function case, length bound. If with unique and : each for , by the same length bookkeeping as in the proof of T31.
- 5By the IH, exists uniquely for every , so is a genuine function (D018), its image is a set (Replacement), and is a specific set (Union). The func clause of D092 then forces to equal it; by mutual exclusivity and uniqueness of , this is the only set consistent with D092.
- 6T08 concludes: exists and is unique for every .
∎
Remarks
Confirms the notation
is well posed for every term. The proof is exactly the same strong-induction-on-length shape used for term values, again licensed by unique readability - only the specific existence justification for the function case changes (
of an image, rather than an application of
).