proposition: Lemma lcv_roots_graph_compatible: forall g roots v to z, graph_has_gen g to -> roots_graph_compatible roots g -> roots_graph_compatible (upd_Znth z roots (inr (new_copied_v g to))) (lgraph_copy_v g v to).
proof: Proof. intros. apply upd_Znth_graph_compatible. - apply lcv_rgc_unchanged; assumption. - 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