proposition: Lemma Permutation_cons_In: forall {A} (l1 l2: list A) a, Permutation l1 (a :: l2) -> In a l1.
proof: Proof. intros. pose proof (in_eq a l2). apply Permutation_sym in H. apply (Permutation_in _ H); trivial. 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