proposition: Theorem add_spec1: forall (m: t A) (i: key) (x: A), find i (add i x m) = Some x.
proof: Proof. intros m i; revert m. induction i; destruct m; simpl; auto. Qed.
imports: Coq(Bool PeanoNat BinPos Orders OrdersEx OrdersLists) MMaps(Utils Comparisons Interface)