proposition: Lemma frr_gen_v_num_to: forall from to roots1 g1 roots2 g2, graph_has_gen g1 to -> forward_roots_relation from to roots1 g1 roots2 g2 -> gen_v_num g1 to <= gen_v_num g2 to.
proof: Proof. intros. induction H0. 1: lia. transitivity (gen_v_num g2 to). - eapply fr_O_gen_v_num_to; eauto. - apply IHforward_roots_relation; rewrite <- fr_graph_has_gen; eauto. 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