proposition: Lemma in_iff m x y : K.eq x y -> (In x m <-> In y m).
proof: Proof. now intros ->. Qed.
imports: Coq(Bool Equalities Orders OrdersFacts OrdersLists) Coq(Morphisms Permutation SetoidPermutation) MMaps(Utils Comparisons Interface)