X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=matita%2Fmatita%2Fcontribs%2Flambdadelta%2Fground_2%2Fynat%2Fynat_lt.ma;h=664510dda2b8f2e631c69e03288457f6c67dd609;hb=5102e7f780e83c7fef1d3826f81dfd37ee4028bc;hp=2a9fbb5152e8225158bb3cf212a4e29b429368eb;hpb=174ee1889b5c91ef5339c718d7657ed0e5da21e8;p=helm.git diff --git a/matita/matita/contribs/lambdadelta/ground_2/ynat/ynat_lt.ma b/matita/matita/contribs/lambdadelta/ground_2/ynat/ynat_lt.ma index 2a9fbb515..664510dda 100644 --- a/matita/matita/contribs/lambdadelta/ground_2/ynat/ynat_lt.ma +++ b/matita/matita/contribs/lambdadelta/ground_2/ynat/ynat_lt.ma @@ -64,14 +64,14 @@ lemma ylt_inv_Y2: ∀x:ynat. x < ∞ → ∃n. x = yinj n. #H elim (ylt_inv_Y1 … H) qed-. -lemma ylt_inv_O1: ∀n. 0 < n → ⫯⫰n = n. +lemma ylt_inv_O1: ∀n:ynat. 0 < n → ⫯⫰n = n. * // #n #H lapply (ylt_inv_inj … H) -H normalize /3 width=1 by S_pred, eq_f/ qed-. (* Inversion lemmas on successor ********************************************) -fact ylt_inv_succ1_aux: ∀x,y. x < y → ∀m. x = ⫯m → m < ⫰y ∧ ⫯⫰y = y. +fact ylt_inv_succ1_aux: ∀x,y:ynat. 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 @@ -81,7 +81,7 @@ fact ylt_inv_succ1_aux: ∀x,y. x < y → ∀m. x = ⫯m → m < ⫰y ∧ ⫯⫰ ] qed-. -lemma ylt_inv_succ1: ∀m,y. ⫯m < y → m < ⫰y ∧ ⫯⫰y = y. +lemma ylt_inv_succ1: ∀m,y:ynat. ⫯m < y → m < ⫰y ∧ ⫯⫰y = y. /2 width=3 by ylt_inv_succ1_aux/ qed-. lemma ylt_inv_succ: ∀m,n. ⫯m < ⫯n → m < n. @@ -130,14 +130,14 @@ qed-. (* Basic properties *********************************************************) -lemma ylt_O1: ∀x. ⫯⫰x = x → 0 < x. +lemma ylt_O1: ∀x:ynat. ⫯⫰x = x → 0 < x. * // * /2 width=1 by ylt_inj/ normalize #H destruct qed. (* Properties on predecessor ************************************************) -lemma ylt_pred: ∀m,n. m < n → 0 < m → ⫰m < ⫰n. +lemma ylt_pred: ∀m,n:ynat. m < n → 0 < m → ⫰m < ⫰n. #m #n * -m -n /4 width=1 by ylt_inv_inj, ylt_inj, monotonic_lt_pred/ qed. @@ -155,10 +155,14 @@ qed. lemma ylt_succ_Y: ∀x. x < ∞ → ⫯x < ∞. * /2 width=1 by/ qed. -lemma yle_succ1_inj: ∀x,y. ⫯yinj x ≤ y → x < y. +lemma yle_succ1_inj: ∀x. ∀y:ynat. ⫯yinj x ≤ y → x < y. #x * /3 width=1 by yle_inv_inj, ylt_inj/ qed. +lemma ylt_succ2_refl: ∀x,y:ynat. x < y → x < ⫯x. +#x #y #H elim (ylt_fwd_gen … H) -y /2 width=1 by ylt_inj/ +qed. + (* Properties on order ******************************************************) lemma yle_split_eq: ∀m,n:ynat. m ≤ n → m < n ∨ m = n. @@ -195,7 +199,7 @@ lemma yle_ylt_trans: ∀x:ynat. ∀y:ynat. ∀z:ynat. y < z → x ≤ y → x < ] qed-. -lemma yle_inv_succ1_lt: ∀x,y. ⫯x ≤ y → 0 < y ∧ x ≤ ⫰y. +lemma yle_inv_succ1_lt: ∀x,y:ynat. ⫯x ≤ y → 0 < y ∧ x ≤ ⫰y. #x #y #H elim (yle_inv_succ1 … H) -H /3 width=1 by ylt_O1, conj/ qed-.