proposition: Lemma uniq_map_app_l : forall (f : A -> A), uniq (F ++ E) -> uniq (map f F ++ E).
proof: Proof. clear. solve_uniq. Qed.
imports: Coq.FSets.FSets Coq.Lists.List Coq.Logic.Decidable Coq.Strings.String String Metalib.CoqFSetDecide Metalib.CoqListFacts Metalib.LibTactics Metalib.CoqFSetInterface Coq.Classes.Equivalence Coq.Classes.EquivDec Metalib.CoqEqDec