proposition: Lemma uniq_map_1 : uniq (map f1 f2 E) -> uniq E.
proof: Proof. clear. intros H. induction E as [ | a E']; simpl_asnlist in *. apply uniq_nil. destruct a. inversion H; subst. apply uniq_push; simpl_asnlist in *; auto. inversion H; subst. apply uniq_alt; simpl_asnlist in *; auto. Qed.
imports: Coq.FSets.FSets Coq.Lists.List Coq.Logic.Decidable Metalib.CoqFSetDecide Metalib.CoqListFacts Metalib.LibTactics Metalib.MetatheoryAtom Metalib.LibTactics