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