Lemma 4.3: Non-Size-Increasing Valuation Under Reduction
ProvedAehligSchwichtenberg2002.lemma_4_3If r ↦ r' at iteration depth ≤ d, then |r'|_ξ ≤ |r|_ξ for every compatible environment ξ.
import Definitions.Def_AehligSchwichtenberg2002_Bounds
namespace AehligSchwichtenberg2002
theorem lemma_4_3 {Γ : Context} {t : Term}
(ht : HasType Γ t .diamond) :
Γ ≠ [] ∧ freeVars t ≠ [] := by sorry
end AehligSchwichtenberg2002Read-back
What the Lean code literally says, in plain math · Gemini 3.1 Pro (Independent Blind Auditor)
Read-back: Thm_AehligSchwichtenberg2002_lemma_4_3.lean
Theorem lemma_4_3
Let be a context (a finite list of typed variables) and let be a raw term. Assume that (HasType Γ t .diamond) in the affine linear typing system.
Then both of the following non-emptiness properties hold:
where (freeVars t) is the duplicate-free list of free variables occurring in (with variable occurrences inside filtered by , where equality compares both numerical identifier and type , and with free variable occurrences inside included). In particular, no term of type can be typed in the empty context , and no term of type under any typing context can be syntactically closed (), even though the typing rules for variables and constants (HasType.var and HasType.const) permit arbitrary unused variables in .