proposition: Lemma lcv_graph_has_v_new: forall g v to, graph_has_gen g to -> graph_has_v (lgraph_copy_v g v to) (new_copied_v g to).
proof: Proof. intros. unfold lgraph_copy_v. rewrite <- lmc_graph_has_v. apply lacv_graph_has_v_new. 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