proposition: Lemma binds_mid_eq : binds x a (F ++ (x ~ b) ++ E) -> uniq (F ++ (x ~ b) ++ E) -> a = b.
proof: Proof. clear. intros J ?. analyze_binds_uniq J. 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