proposition: Lemma binds_cons_uniq_iff : uniq ((y, b) :: E) -> (binds x a ((y, b) :: E) <-> (x = y /\ a = b /\ ~ In x (dom E)) \/ (binds x a E /\ x <> y)).
proof: Proof. clear. intuition auto using binds_cons_uniq_1, binds_cons_2, binds_cons_3. 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