proposition: Lemma pvs_mono_strict: forall g gen i j, i < j -> (previous_vertices_size g gen i < previous_vertices_size g gen j)%Z.
proof: Proof. intros. assert (j = i + (j - i)) by lia. rewrite H0. remember (j - i). subst j. unfold previous_vertices_size. rewrite nat_inc_list_app, fold_left_app. apply vs_accum_list_lt. pose proof (nat_seq_length i n). destruct (nat_seq i n). - simpl in H0. lia. - intro S; inversion S. 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