Regularity (Lemma 3.1)
OpenLeanTT3.regularityEvery well-typed term has a well-typed type: if then is itself a type, i.e. for some universe level . This is the regularity lemma (Lemma 3.1), recording the basic invariant of the typing judgment.
Formalization Note. Levels are concrete natural numbers in the proof-split language, so the universe is E.sort n.
import Mathlib import Definitions.Def_ltt3_judgments
namespace LeanTT3 set_option autoImplicit true in theorem regularity : Ty Γ e α → ∃ n, Ty Γ α (E.sort n) := 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 type , if holds, then there exists a natural number such that holds. Thus the type of any well-typed term is itself classifiable in some universe.