update in basic_2 and ground_2

[helm.git] / matita / matita / contribs / lambdadelta / ground_2 / ynat / ynat_succ.ma

diff --git a/matita/matita/contribs/lambdadelta/ground_2/ynat/ynat_succ.ma b/matita/matita/contribs/lambdadelta/ground_2/ynat/ynat_succ.ma
index c95c72d152872c8b67f8b063c8be137a911b1c74..f08e632937ee67dd06dfb6bac7392125d1ce9389 100644 (file)
--- a/matita/matita/contribs/lambdadelta/ground_2/ynat/ynat_succ.ma
+++ b/matita/matita/contribs/lambdadelta/ground_2/ynat/ynat_succ.ma
@@ -12,20 +12,19 @@
 (*                                                                        *)
 (**************************************************************************)
 
-include "ground_2/notation/functions/successor_1.ma".
 include "ground_2/ynat/ynat_pred.ma".
 
 (* NATURAL NUMBERS WITH INFINITY ********************************************)
 
 (* the successor function *)
 definition ysucc: ynat → ynat ≝ λm. match m with
-[ yinj m ⇒ S m
+[ yinj m ⇒ ⫯m
 | Y      ⇒ Y
 ].
 
 interpretation "ynat successor" 'Successor m = (ysucc m).
 
-lemma ysucc_inj: ∀m:nat. ⫯m = S m.
+lemma ysucc_inj: ∀m:nat. ⫯(yinj m) = yinj (⫯m).
 // qed.
 
 lemma ysucc_Y: ⫯(∞) = ∞.
@@ -36,7 +35,7 @@ lemma ysucc_Y: ⫯(∞) = ∞.
 lemma ypred_succ: ∀m. ⫰⫯m = m.
 * // qed.
 
-lemma ynat_cases: ∀n:ynat. n = 0 ∨ ∃m. n = ⫯m.
+lemma ynat_cases: ∀n:ynat. n = 0 ∨ ∃m:ynat. n = ⫯m.
 *
 [ * /2 width=1 by or_introl/
   #n @or_intror @(ex_intro … n) // (**) (* explicit constructor *)
@@ -86,5 +85,13 @@ lemma ysucc_inv_O_sn: ∀m. yinj 0 = ⫯m → ⊥. (**) (* explicit coercion *)
 #n #_ #H destruct
 qed-.
 
-lemma ysucc_inv_O_dx: ∀m. ⫯m = 0 → ⊥.
+lemma ysucc_inv_O_dx: ∀m:ynat. ⫯m = 0 → ⊥.
 /2 width=2 by ysucc_inv_O_sn/ qed-.
+
+(* Eliminators **************************************************************)
+
+lemma ynat_ind: ∀R:predicate ynat.
+                R 0 → (∀n:nat. R n → R (⫯n)) → R (∞) →
+                ∀x. R x.
+#R #H1 #H2 #H3 * // #n elim n -n /2 width=1 by/
+qed-.