proposition: Lemma nat_inc_list_NoDup: forall n, NoDup (nat_inc_list n).
proof: Proof. induction n; simpl; [constructor|]. apply NoDup_app_inv; auto. - constructor; auto. constructor. - intros. rewrite nat_inc_list_in_iff in H. simpl. 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