proposition: Lemma sublist_of_nil: forall {A:Type} lo hi, sublist lo hi (nil (A:=A)) = nil.
proof: Proof. intros. unfold sublist. rewrite firstn_nil. rewrite skipn_nil. auto. 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