proposition: Lemma pvs_mono: forall g gen i j, i <= j -> (previous_vertices_size g gen i <= previous_vertices_size g gen j)%Z.
proof: Proof. intros. rewrite Nat.le_lteq in H. destruct H. 2: subst; lia. rewrite Z.le_lteq. left. apply pvs_mono_strict. 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