proposition: Lemma lcv_super_compatible_unchanged: forall g h rootpairs roots outlier to v (Hi : 0 <= Z.of_nat to < Zlength (spaces h)) (Hh : has_space (Znth (Z.of_nat to) (spaces h)) (vertex_size g v)), graph_has_gen g to -> graph_has_v g v -> super_compatible g h rootpairs roots outlier -> super_compatible (lgraph_copy_v g v to) (cut_heap h (Z.of_nat to) (vertex_size g v) Hi Hh) rootpairs roots outlier.
proof: Proof. intros. destruct H1 as [? [? [? ?]]]. split; [|split; [|split]]. - apply lcv_graph_thread_info_compatible; assumption. - destruct H3. apply lcv_rootpairs_compatible_unchanged; assumption. - apply lcv_roots_compatible_unchanged; assumption. - apply lcv_outlier_compatible; 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