proposition: Lemma split_gt_l m x y : y < m -> y < (split x m)#l.
proof: Proof. intros ? z Hz. apply split_in_l0 in Hz. order. Qed.
imports: Coq(Bool PeanoNat BinInt FunInd Int) Coq(Orders OrdersFacts OrdersLists) MMaps(Utils Interface OrdList GenTree)