proposition: Lemma Equal_equal : forall eqb, (forall e e', eqb e e' = true <-> e = e') -> forall (m m':t elt), m == m' <-> equal eqb m m' = true.
proof: Proof. intros. rewrite equal_spec. now apply Equal_Equivb. Qed.
imports: Coq(Bool Equalities Orders OrdersFacts OrdersLists) Coq(Morphisms Permutation SetoidPermutation) MMaps(Utils Comparisons Interface)