X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=matita%2Fmatita%2Fcontribs%2Flambdadelta%2Fground_2%2Fynat%2Fynat_le.ma;h=1f0195f15d0f528d7aa9243b13b4317c291d7787;hb=7a9a72fcbad46e7de5714a6a2eeb8b32e95e1ed5;hp=be13774f5813aa5ca9fcb86b3669f3e3d65f58a8;hpb=23da2aa16489e00889374d81f19cc090faa44582;p=helm.git

diff --git a/matita/matita/contribs/lambdadelta/ground_2/ynat/ynat_le.ma b/matita/matita/contribs/lambdadelta/ground_2/ynat/ynat_le.ma
index be13774f5..1f0195f15 100644
--- a/matita/matita/contribs/lambdadelta/ground_2/ynat/ynat_le.ma
+++ b/matita/matita/contribs/lambdadelta/ground_2/ynat/ynat_le.ma
@@ -62,31 +62,38 @@ lemma yle_inv_Y1: ∀n. ∞ ≤ n → n = ∞.
 
 (* Inversion lemmas on successor ********************************************)
 
-fact yle_inv_succ1_aux: ∀x,y. x ≤ y → ∀m. x = ⫯m → ∃∃n. m ≤ n & y = ⫯n.
+fact yle_inv_succ1_aux: ∀x,y. x ≤ y → ∀m. x = ⫯m → m ≤ ⫰y ∧ ⫯⫰y = y.
 #x #y * -x -y
 [ #x #y #Hxy #m #H elim (ysucc_inv_inj_sn … H) -H
   #n #H1 #H2 destruct elim (le_inv_S1 … Hxy) -Hxy
-  #m #Hnm #H destruct
-  @(ex2_intro … m) /2 width=1 by yle_inj/ (**) (* explicit constructor *)
-| #x #y #H destruct
-  @(ex2_intro … (∞)) /2 width=1 by yle_Y/ (**) (* explicit constructor *)
+  #m #Hnm #H destruct /3 width=1 by yle_inj, conj/
+| #x #y #H destruct /2 width=1 by yle_Y, conj/
 ]
 qed-.
 
-lemma yle_inv_succ1: ∀m,y.  ⫯m ≤ y → ∃∃n. m ≤ n & y = ⫯n.
+lemma yle_inv_succ1: ∀m,y. ⫯m ≤ y → m ≤ ⫰y ∧ ⫯⫰y = y.
 /2 width=3 by yle_inv_succ1_aux/ qed-.
 
 lemma yle_inv_succ: ∀m,n. ⫯m ≤ ⫯n → m ≤ n.
-#m #n #H elim (yle_inv_succ1 … H) -H
-#x #Hx #H destruct //
+#m #n #H elim (yle_inv_succ1 … H) -H //
 qed-.
 
 (* Basic properties *********************************************************)
 
+lemma le_O1: ∀n:ynat. 0 ≤ n.
+* /2 width=1 by yle_inj/
+qed.
+
 lemma yle_refl: reflexive … yle.
 * /2 width=1 by le_n, yle_inj/
 qed.
 
+lemma yle_split: ∀x,y:ynat. x ≤ y ∨ y ≤ x.
+* /2 width=1 by or_intror/
+#x * /2 width=1 by or_introl/
+#y elim (le_or_ge x y) /3 width=1 by yle_inj, or_introl, or_intror/
+qed-.
+
 (* Properties on predecessor ************************************************)
 
 lemma yle_pred_sn: ∀m,n. m ≤ n → ⫰m ≤ n.
@@ -96,14 +103,26 @@ qed.
 lemma yle_refl_pred_sn: ∀x. ⫰x ≤ x.
 /2 width=1 by yle_refl, yle_pred_sn/ qed.
 
+lemma yle_pred: ∀m,n. m ≤ n → ⫰m ≤ ⫰n.
+#m #n * -m -n /3 width=1 by yle_inj, monotonic_pred/
+qed.
+
 (* Properties on successor **************************************************)
 
+lemma yle_succ: ∀m,n. m ≤ n → ⫯m ≤ ⫯n.
+#m #n * -m -n /3 width=1 by yle_inj, le_S_S/
+qed.
+
 lemma yle_succ_dx: ∀m,n. m ≤ n → m ≤ ⫯n.
 #m #n * -m -n /3 width=1 by le_S, yle_inj/
 qed.
 
 lemma yle_refl_S_dx: ∀x. x ≤ ⫯x.
-/2 width=1 by yle_refl, yle_succ_dx/ qed.
+/2 width=1 by yle_succ_dx/ qed.
+
+lemma yle_refl_SP_dx: ∀x. x ≤ ⫯⫰x.
+* // * //
+qed. 
 
 (* Main properties **********************************************************)