proposition: Lemma lcv_pvs_old: forall g v to gen, gen <> to -> graph_has_gen g to -> graph_has_gen g gen -> previous_vertices_size (lgraph_copy_v g v to) gen (number_of_vertices (nth_gen (lgraph_copy_v g v to) gen)) = previous_vertices_size g gen (number_of_vertices (nth_gen g gen)).
proof: Proof. intros. unfold nth_gen. simpl. rewrite cvmgil_not_eq by assumption. remember (number_of_vertices (nth gen (g_gen (glabel g)) null_info)). unfold previous_vertices_size. apply fold_left_ext. intros. unfold vertex_size_accum. f_equal. apply lcv_vertex_size_old. 1: assumption. rewrite nat_inc_list_In_iff in H2. subst. split; simpl; 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