proposition: Lemma In_InA : forall (A : Type) (l : list A) (eqA : relation A) (x : A), Equivalence eqA -> List.In x l -> InA eqA x l.
proof: Proof. induction l; intros; simpl in *. exfalso; eauto using in_nil. destruct H0. apply InA_cons_hd; subst; reflexivity. apply InA_cons_tl, IHl; trivial. 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