Substitution (Lemma 3.3)
OpenLeanTT3.substitutionTyping is preserved under substitution: if and , then . This is the substitution lemma (Lemma 3.3), proved simultaneously with the corresponding statement for definitional equality.
Formalization Note. E.inst e a substitutes a for the outermost de Bruijn index (index 0) in e.
import Mathlib import Definitions.Def_ltt3_judgments
namespace LeanTT3 set_option autoImplicit true in theorem substitution : Ty (α::Γ) e β → Ty Γ a α → Ty Γ (E.inst e a) (E.inst β a) := 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 , types and , expression , and term , if the typing judgment derives in the context extended by , and derives in , then it derives the substitution instance of by at the substitution instance of by , in context . Substitution instantiates the outermost bound variable.