proposition: Lemma Permutation_incl: forall {A:Type} (l1 l2: list A), Permutation l1 l2 -> incl l1 l2.
proof: Proof. unfold incl; intros. apply (Permutation_in (l:=l1)); 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