proposition: Lemma lmc_copy_compatible: forall g old new, graph_has_v g new -> vgeneration old <> vgeneration new -> copy_compatible g -> copy_compatible (lgraph_mark_copied g old new).
proof: Proof. repeat intro. destruct (V_EqDec old v). - compute in e. subst old. rewrite <- lmc_graph_has_v. simpl. unfold update_copied_old_vlabel, update_vlabel. rewrite if_true by reflexivity. simpl. split; assumption. - assert (v <> old) by intuition auto with *. clear c. rewrite lmc_vlabel_not_eq, <- lmc_graph_has_v in * by assumption. apply H1; 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