proposition: Lemma uniq_map_2 : uniq E -> uniq (map f E).
proof: Proof. clear. intros J. alist induction E as [ | x1 a1 E' ]. apply uniq_nil. inversion J; subst. simpl_alist. apply uniq_push. auto. rewrite dom_map. trivial. 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