proposition: Lemma inA_map : forall (A B : Type) eqA eqB (f : A -> B) (l : list A) (x : A), Proper (eqA ==> eqB) f -> InA eqA x l -> InA eqB (f x) (map f l).
proof: Proof. induction l; simpl; intros; inversion H0; subst. - econstructor; apply H; eauto. - econstructor 2; eauto. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Fiat.QueryStructure.Implementation.DataStructures.Bags.BagsInterface Fiat.QueryStructure.Implementation.DataStructures.Bags.BagsProperties Coq.Arith.Peano_dec Coq.Structures.OrdersEx Coq.FSets.FMapInterface Coq.FSets.FMapFacts Coq.FSets.FMapAVL Coq.ZArith.ZArith Fiat.Common Fiat.Common.String_as_OT Fiat.Common.List.ListFacts Fiat.Common.List.FlattenList Fiat.Common.SetEqProperties Fiat.Common.FMapExtensions Fiat.Common.List.PermutationFacts Fiat.QueryStructure.Specification.SearchTerms.ListInclusion