proposition: Lemma apart_node_l {elt} h l x v r (m:t elt) : (Node h l x v r) < m <-> l < m /\ x < m /\ r < m.
proof: Proof. apply allkeys_node. now intros ? ? ->. Qed.
imports: Coq(Bool Arith BinInt FunInd) Coq(Orders OrdersFacts OrdersLists) MMaps(Comparisons Interface OrdList)