qed.
theorem increasing_to_le: \forall f:nat \to nat. (increasing f)
-\to \forall m:nat. ex nat (\lambda i. m \le (f i)).
+\to \forall m:nat. \exists i. m \le (f i).
intros.elim m.
apply ex_intro ? ? O.apply le_O_n.
elim H1.
theorem increasing_to_le2: \forall f:nat \to nat. (increasing f)
\to \forall m:nat. (f O) \le m \to
-ex nat (\lambda i. (f i) \le m \land m <(f (S i))).
+\exists i. (f i) \le m \land m <(f (S i)).
intros.elim H1.
apply ex_intro ? ? O.
split.apply le_n.apply H.