proposition: Lemma mem_find m x : mem x m = true <-> find x m <> None.
proof: Proof. rewrite <- mem_in_iff. apply in_find. Qed.
imports: Coq(Bool Equalities Orders OrdersFacts OrdersLists) Coq(Morphisms Permutation SetoidPermutation) MMaps(Utils Comparisons Interface)