proposition: Lemma fr_O_gen_v_num_to: forall from to p g g', graph_has_gen g to -> forward_relation from to O p g g' -> gen_v_num g to <= gen_v_num g' to.
proof: Proof. intros. inversion H0; subst; try lia; try subst new_g. - apply lcv_gen_v_num_to; auto. - rewrite lgd_gen_v_num_to. lia. - rewrite lgd_gen_v_num_to. apply lcv_gen_v_num_to. 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