Theorem·T33
The value of a term exists and is unique
The recursive value characterization genuinely determines exactly one element of the domain, for every term.
For an L-structure
, assignment
, and
:
(D089) exists and is unique.
In words
For any term of the language, its value in a structure, under an assignment, exists and is unique.
Never needed: F05 · F10 · F13 · A03 · A04 · A05 (computed from the citation graph, not asserted).
Proof
- 1By strong induction on : assume every term of length has a value 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 (each partial application there is obtained from by appending , so ).
- 5
- 6T08 concludes: exists and is unique for every .
∎
Remarks
Confirms the notation
is well posed for every term, not just an informally plausible recursive scheme. The proof is exactly the same strong-induction-on-length shape used for
-ary concatenation, but now the case split at each length is genuinely justified by unique readability rather than an ad hoc splitting of a sequence of sequences. With this in hand, a formula's truth in a structure can be defined the same way, once the analogous unique-readability fact is established for formulas.