proposition: Lemma lcv_forward_condition_unchanged: forall g h v to (Hi : 0 <= Z.of_nat to < Zlength (spaces h)) (Hh : has_space (Znth (Z.of_nat to) (spaces h)) (vertex_size g v)), vgeneration v <> to -> graph_has_v g v -> raw_mark (vlabel g v) = false -> forward_condition g h (vgeneration v) to -> forward_condition (lgraph_copy_v g v to) (cut_heap h (Z.of_nat to) (vertex_size g v) Hi Hh) (vgeneration v) to.
proof: Proof. intros. destruct H2 as [? [? [? [? ?]]]]. split; [|split; [|split; [|split]]]. - apply forward_estc_unchanged; assumption. - apply lcv_graph_has_gen; assumption. - apply lcv_graph_has_gen; assumption. - apply lcv_copy_compatible; assumption. - apply lcv_no_dangling_dst; 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