intro.simplify.rewrite < times_n_SO.reflexivity.
qed.
+theorem exp_SO_n : \forall n:nat. S O = (S O) \sup n.
+intro.elim n
+ [reflexivity
+ |simplify.rewrite < plus_n_O.assumption
+ ]
+qed.
+
theorem exp_SSO: \forall n. exp n (S(S O)) = n*n.
intro.simplify.
rewrite < times_n_SO.
]
qed.
+theorem lt_exp1: \forall n,m,p:nat. O < p \to n < m \to exp n p < exp m p.
+intros.
+elim H
+ [rewrite < exp_n_SO.rewrite < exp_n_SO.assumption
+ |simplify.
+ apply lt_times;assumption
+ ]
+qed.
+
theorem le_exp_to_le:
\forall a,n,m. S O < a \to exp a n \le exp a m \to n \le m.
intro.
]
qed.
+theorem le_exp_to_le1 : \forall n,m,p.O < p \to exp n p \leq exp m p \to n \leq m.
+intros;apply not_lt_to_le;intro;apply (lt_to_not_le ? ? ? H1);
+apply lt_exp1;assumption.
+qed.
+
theorem lt_exp_to_lt:
\forall a,n,m. S O < a \to exp a n < exp a m \to n < m.
intros.