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