Consistency of the kernel (no closed proof of )
OpenLeanTT3.consistencyThere is no closed term of the empty type: no expression satisfies the ideal typing judgment in the empty context. Since the kernel's algorithmic equality implies the ideal definitional equality, no proof of is verified by the Lean kernel either. This is the consistency corollary of Section 6, derived there from the set-theoretic soundness theorem; combined with the -type reduction of Part II it applies to the full kernel.
Formalization Note. is the primitive empty type E.empty of the proof-split menagerie, and Ty is the inductively defined ideal typing judgment.
import Mathlib import Definitions.Def_ltt3_judgments
namespace LeanTT3 set_option autoImplicit true in theorem consistency : ¬ ∃ e, Ty [] e E.empty := 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.
The statement asserts the negation of an existential: there is no expression such that the typing judgment Ty, applied to the empty context [], the expression , and the empty-type constant E.empty, holds. In other words, the empty type has no closed inhabitant in the ideal typing judgment. The judgment Ty is the inductively defined typing relation of the proof-split core calculus; E.empty is its primitive empty type. No hypothesis is assumed.