proposition: Lemma singleton_add x (e:elt) : singleton x e == add x e empty.
proof: Proof. intros y. now rewrite singleton_o, add_o, empty_o. Qed.
imports: Coq(Bool Equalities Orders OrdersFacts OrdersLists) Coq(Morphisms Permutation SetoidPermutation) MMaps(Utils Comparisons Interface)