intros.elim n.assumption.apply H1.
qed.
+theorem nat_case1:
+\forall n:nat.\forall P:nat \to Prop.
+(n=O \to P O) \to (\forall m:nat. (n=(S m) \to P (S m))) \to P n.
+intros 2.elim n.
+apply H.reflexivity.
+apply H2.reflexivity.
+qed.
+
theorem nat_elim2 :
\forall R:nat \to nat \to Prop.
(\forall n:nat. R O n) \to