proposition: Lemma lmc_raw_mark: forall g old new x, x <> old -> raw_mark (vlabel g x) = raw_mark (vlabel (lgraph_mark_copied g old new) x).
proof: Proof. intros. destruct (V_EqDec x old). - unfold equiv in e. contradiction. - rewrite lmc_vlabel_not_eq; [reflexivity | assumption]. Qed.
imports: Coq.ZArith.ZArith Coq.Program.Basics Coq.micromega.Lia compcert.lib.Integers compcert.common.Values VST.veric.base VST.veric.Clight_lemmas VST.veric.val_lemmas VST.veric.shares VST.msl.seplog VST.msl.shares VST.zlist.sublist VST.floyd.coqlib3 VST.floyd.functional_base VST.floyd.data_at_rec_lemmas VST.zlist.list_solver CertiGraph.lib.EquivDec_ext CertiGraph.lib.List_ext CertiGraph.graph.graph_model CertiGraph.graph.graph_gen