proposition: Lemma WeakEq_pop_SCA: forall (av : Type) (st : StringMap.t (Value av)) (k : StringMap.key) (ext : StringMap.t (Value av)) (v : W), k ∉ st -> WeakEq ext st -> WeakEq ext ([k |> wrap v]::st).
proof: Proof. unfold WeakEq; intuition eauto using SameSCAs_pop_SCA, SameADTs_pop_SCA, NotIn_not_mapsto_adt. Qed.
imports: Coq.Classes.Morphisms CertifiedExtraction.CoreLemmas CertifiedExtraction.PropertiesOfTelescopes CertifiedExtraction.PropertiesOfTelescopes CertifiedExtraction.FacadeLemmas