proposition: Lemma In_InT {A} (x : A) (ls : list A) (H : InT x ls) : In x ls.
proof: Proof. induction ls as [|y ys IHys]; simpl in *; trivial. destruct H; [ left | right ]; eauto with nocore. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Coq.ZArith.ZArith Coq.Lists.List Coq.Lists.SetoidList Coq.Bool.Bool Fiat.Common Fiat.Common.List.Operations Fiat.Common.Equality Fiat.Common.List.FlattenList Fiat.Common.LogicFacts