proposition: Lemma update_stack_cons s h d0 d x : (d .: env s h d0) x = env (update_stack s (Some (proj1_sig d))) h d0 x.
proof: Proof. destruct x as [|x]; try reflexivity. cbn. destruct Dec. - destruct d. now apply dom_eq. - contradict n. eapply squash_iff, proj2_sig. Qed.
imports: Undecidability.FOL(Semantics.FiniteTarski.Full) Undecidability.FOL(Syntax.Facts Semantics.Tarski.FullFacts Syntax.BinSig) Undecidability.SeparationLogic(MSL) Undecidability.Shared(Dec) Undecidability.Synthetic.DecidabilityFacts List