proposition: Lemma below_trans {elt} (m:t elt) x y : y < x -> x < m -> y < m.
proof: Proof. intros until 3; order. Qed.
imports: Coq(Bool Arith BinInt FunInd) Coq(Orders OrdersFacts OrdersLists) MMaps(Comparisons Interface OrdList)