proposition: Lemma add_neq_b m x y e : ~K.eq x y -> mem y (add x e m) = mem y m.
proof: Proof. intros. now rewrite !mem_find_b, add_neq_o. Qed.
imports: Coq(Bool Equalities Orders OrdersFacts OrdersLists) Coq(Morphisms Permutation SetoidPermutation) MMaps(Utils Comparisons Interface)