proposition: Lemma nat_inc_list_hd: forall n, 0 < n -> Znth 0 (nat_inc_list (Z.to_nat n)) = 0.
proof: Proof. intros. induction (Z.to_nat n); trivial. simpl. destruct n0; trivial. rewrite app_Znth1; [lia|]. rewrite nat_inc_list_Zlength. rewrite <- Nat2Z.inj_0. apply inj_lt; lia. Qed.
imports: Coq.Lists.List Coq.micromega.Lia Coq.Sorting.Permutation Coq.ZArith.ZArith_base Coq.ZArith.Zcomplements Coq.Logic.FunctionalExtensionality CertiGraph.lib.Coqlib CertiGraph.lib.EquivDec_ext VST.zlist.sublist VST.zlist.list_solver