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