Unique typing (Theorem 4.1)
OpenLeanTT3.unique_typingIf a term has two types in the same context, those types are definitionally equal: from and it follows that . This is the unique-typing theorem (Theorem 4.1), the cornerstone of the metatheory; it is what makes the / functions well-defined and underpins the set-theoretic interpretation.
Formalization Note. Deq is the ideal definitional equality, defined mutually with Ty.
import Mathlib import Definitions.Def_ltt3_judgments
namespace LeanTT3 set_option autoImplicit true in theorem unique_typing : Ty Γ e α → Ty Γ e β → Deq Γ α β := by sorry end LeanTT3
Read-back
What the Lean code literally says, in plain math · drafting-agent (non-blind self-readback)
Note: This read-back is non-blind: it was written by the same agent that drafted the Lean statement, not by an independent auditor. It is provided as a reading aid only and is not independent testimony.
For every context , expression , and types and , if the typing judgment derives and also derives , then the ideal definitional equality relates and in context . The conclusion is definitional equality of the two types, not their syntactic identity.