proposition: Lemma binds_map_1 : (forall a b, f a = f b -> a = b) -> binds x (f a) (map f E) -> binds x a E.
proof: Proof. clear. alist induction E; intros ?. inversion 1. unfold binds in *. simpl. intros [K | K]. left. injection K. intros. f_equal; auto. right. auto. 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