proposition: Lemma lcv_rootpairs_compatible: forall g h rootpairs roots z v to i s (Hi : 0 <= i < Zlength (spaces h)) (Hh : has_space (Znth i (spaces h)) s) (Hm : 0 <= z < Zlength roots), graph_has_gen g to -> roots_graph_compatible roots g -> rootpairs_compatible g rootpairs roots -> rootpairs_compatible (lgraph_copy_v g v to) (update_rootpairs rootpairs (upd_Znth z (map rp_val rootpairs) (vertex_address g (new_copied_v g to)))) (upd_Znth z roots (inr (new_copied_v g to))).
proof: Proof. intros. rewrite <- (lcv_vertex_address_new g v to H). apply upd_rootpairs_compatible; auto. apply lcv_rootpairs_compatible_unchanged; 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