proposition: Lemma Cons_PushAnonymous: forall {av A} (val: Comp A) tail (ext : StringMap.t (Value av)) (state : StringMap.t (Value av)), (exists v, val ↝ v) -> state ≲ tail ∪ ext -> state ≲ [[val as _]]::tail ∪ ext.
proof: Proof. SameValues_Fiat_t. Qed.
imports: Coq.Classes.Morphisms CertifiedExtraction.CoreLemmas CertifiedExtraction.PropertiesOfTelescopes