proposition: Lemma sublist_same_overshoot: forall {A:Type} (l: list A) hi, Zlength l <= hi -> sublist 0 hi l = l.
proof: Proof. intros. unfold sublist. rewrite skipn_0. rewrite firstn_same. auto. rewrite <- ZtoNat_Zlength. 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