proposition: Lemma Cons_PushExt': forall `{FacadeWrapper (Value av) A} key tenv ext (v: A) (st: State av), st ≲ Cons (NTSome key) (ret v) (fun _ => tenv) ∪ ext -> st ≲ tenv ∪ [key |> wrap v] :: ext.
proof: Proof. intros; change tenv with ((fun _ => tenv) v); eauto using Cons_PushExt. Qed.
imports: Coq.Classes.Morphisms CertifiedExtraction.CoreLemmas CertifiedExtraction.PropertiesOfTelescopes