proposition: Lemma fr_O_graph_gen_size_unchanged: forall from to p g1 g2, graph_has_gen g1 to -> forward_relation from to O p g1 g2 -> forall gen, graph_has_gen g1 gen -> gen <> to -> graph_gen_size g1 gen = graph_gen_size g2 gen.
proof: Proof. intros. unfold graph_gen_size. erewrite <- (fr_O_nth_gen_unchanged from to _ g1 g2); eauto. unfold previous_vertices_size. apply fold_left_ext. intros. unfold vertex_size_accum. f_equal. rewrite nat_inc_list_In_iff in H3. eapply (fr_vertex_size O from to); eauto. 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