proposition: Lemma mapo_gt m x : x < m -> x < mapo f m.
proof: Proof. intros H y Hy. destruct (mapo_in Hy) as (y' & e & ? & ? & ?). order. Qed.
imports: Coq(Bool PeanoNat BinInt FunInd Int) Coq(Orders OrdersFacts OrdersLists) MMaps(Utils Interface OrdList GenTree)