Properties of typing and lookup shared by preservation and progress: value weakening, and preservation/progress of positional and record lookup.
@[simp]
theorem
value_weaken
{E A : Core.Typ}
{v : Core.Exp}
:
HasType E v A → ∀ {E' : Core.Typ}, Core.Value v → HasType E' v A
@[simp]
theorem
lookupv_value
{v v' : Core.Exp}
{n : Nat}
:
Core.LookupV v n v' → Core.Value v → Core.Value v'
@[simp]
theorem
lookup_pres_ctx
{E : Core.Typ}
{n : Nat}
{A : Core.Typ}
:
Core.Lookup E n A → ∀ (v v' : Core.Exp), Core.LookupV v n v' → Core.Value v → HasType Core.Typ.top v E → HasType E v' A
@[simp]
theorem
lookup_pres
{E : Core.Typ}
{n : Nat}
{A : Core.Typ}
:
Core.Lookup E n A →
∀ (v v' : Core.Exp), Core.LookupV v n v' → Core.Value v → HasType Core.Typ.top v E → HasType Core.Typ.top v' A
@[simp]
theorem
rlookupv_value
{v : Core.Exp}
{l : String}
{v' : Core.Exp}
:
Core.RLookupV v l v' → Core.Value v → Core.Value v'
@[simp]
theorem
rlookup_pres_aux
{E : Core.Typ}
{l : String}
{A : Core.Typ}
:
Core.RLookup E l A →
∀ {v v' : Core.Exp}, Core.RLookupV v l v' → Core.Value v → HasType Core.Typ.top v E → HasType E v' A
@[simp]
theorem
rlookup_pres
{E : Core.Typ}
{l : String}
{A : Core.Typ}
:
Core.RLookup E l A →
∀ {v v' : Core.Exp}, Core.RLookupV v l v' → Core.Value v → HasType Core.Typ.top v E → HasType Core.Typ.top v' A
@[simp]
theorem
lookup_prog
{n : Nat}
{A B : Core.Typ}
:
Core.Lookup A n B → ∀ {v : Core.Exp}, HasType Core.Typ.top v A → Core.Value v → ∃ (e' : Core.Exp), Core.LookupV v n e'
@[simp]
theorem
rlookup_prog
{l : String}
{A B : Core.Typ}
:
Core.RLookup A l B → ∀ {v : Core.Exp}, HasType Core.Typ.top v A → Core.Value v → ∃ (e' : Core.Exp), Core.RLookupV v l e'