proposition: Lemma binds_remove_mid : binds x a (F ++ (y ~ b) ++ G) -> x <> y -> binds x a (F ++ G).
proof: Proof. clear. intros H. analyze_binds H. 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