proposition: Lemma bindings_node (t1 t2:t elt) x e z : bindings (Node z t1 x e t2) = bindings t1 ++ (x,e) :: bindings t2.
proof: Proof. rewrite <- (app_nil_r (bindings _)), bindings_node_acc. now rewrite app_nil_r. Qed.
imports: Coq(Bool Arith BinInt FunInd) Coq(Orders OrdersFacts OrdersLists) MMaps(Comparisons Interface OrdList)