proposition: Lemma ins_below m x v y : y < m -> y < x -> y < ins x v m.
proof: Proof. intros. treeorder. Qed.
imports: Coq(Bool BinPos Pnat Setoid SetoidList PeanoNat) Coq(Orders OrdersFacts OrdersLists) MMaps(Utils Interface OrdList GenTree)