Proposition 3.6: Subject Reduction
ProvedAehligSchwichtenberg2002.proposition_3_6If Δ; Γ ⊢ r : ρ and r ↦ r', then Δ; Γ' ⊢ r' : ρ for a subcontext Γ' ⊆ Γ and d(r') ≤ d(r).
import Definitions.Def_AehligSchwichtenberg2002_Syntax
namespace AehligSchwichtenberg2002
theorem proposition_3_6 {Γ : Context} {t : Term}
(hac : ∀ v ∈ Γ, v.ty = .diamond) (hnorm : IsNormal t) :
(∀ τ : Ty, HasType Γ t (.list τ) → IsListTerm t) ∧
(HasType Γ t .bool → t = .const .tt ∨ t = .const .ff) ∧
(HasType Γ t .diamond → ∃ x : Var, x.ty = .diamond ∧ t = .var x) := 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_proposition_3_6.lean
Theorem proposition_3_6
Let be a context (a finite list of typed variables) and let be a raw term. Assume:
- Diamond-typed context (
hac): Every variable has type . (When , this condition holds vacuously.) - Normal form (
hnorm): is in normal form (IsNormal t), meaning there is no raw term such that (RedStep t t', where reduction occurs only at the root or inside application subterms, never under , , or ).
Then the following three canonical-form properties hold simultaneously:
- List type (
Ty.list): For every type , if (HasType Γ t (.list τ)), then holds; that is, there exists such that , meaning is syntactically of the form
for some types and raw terms . (Note that itself only constrains the outer / spine of , without explicitly restating in the conclusion that or that and are well-typed normal terms, although those properties are present in the hypotheses and .)
2. Boolean type (Ty.bool): If (HasType Γ t .bool), then is syntactically equal to the constructor constant or the constructor constant .
3. Diamond type (Ty.diamond): If (HasType Γ t .diamond), then there exists a variable such that and is syntactically the variable term . (Note that the conclusion does not explicitly include inside the existential conjunction, though is forced by the typing judgment .)