X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fmatita%2Fdama%2Fordered_divisible_group.ma;fp=helm%2Fsoftware%2Fmatita%2Fdama%2Fordered_divisible_group.ma;h=805cce9568ad029a230fc4efc79e6081cec6115f;hb=855b41852b429f211c579b3a4b2095d370a3c983;hp=0b84d9add806f09caface73ae3800317d672bc2e;hpb=3a5b9647787e1402f6886d41824f664db290963f;p=helm.git diff --git a/helm/software/matita/dama/ordered_divisible_group.ma b/helm/software/matita/dama/ordered_divisible_group.ma index 0b84d9add..805cce956 100644 --- a/helm/software/matita/dama/ordered_divisible_group.ma +++ b/helm/software/matita/dama/ordered_divisible_group.ma @@ -103,26 +103,30 @@ apply (plus_cancr_ap ??? 0); assumption; qed. -lemma foo: ∀G:todgroup.∀x,y:G.∀n. +lemma lt_suplt: ∀G:todgroup.∀x,y:G.∀n. x < y → x\sup (S n) < y\sup (S n). intros; elim n; [simplify; apply flt_plusr; assumption] simplify; apply (ltplus); [assumption] assumption; qed. -lemma foo1: ∀G:todgroup.∀x,y:G.∀n. -x\sup (S n) < y\sup (S n) → x < y. +lemma suplt_lt: ∀G:todgroup.∀x,y:G.∀n. x\sup (S n) < y\sup (S n) → x < y. intros 4; elim n; [apply (plus_cancr_lt ??? 0); assumption] simplify in l; cases (ltplus_orlt ????? l); [assumption] apply f; assumption; qed. -alias num (instance 0) = "natural number". -lemma foo3: ∀G:todgroup.∀x,y:G. - 0 sym_plus; simplify; apply (lt_rewl ??? (0+(y+y\sup n))); [ + apply eq_sym; apply zero_neutral] + apply flt_plusr; assumption;] +apply (lt_transitive ???? l); rewrite > sym_plus; simplify; +rewrite > (sym_plus n); simplify; repeat apply flt_plusl; +apply (lt_rewl ???(0+y\sup(n1+n))); [apply eq_sym; apply zero_neutral] +apply flt_plusr; assumption; +qed. alias num (instance 0) = "natural number". lemma core1: ∀G:todgroup.∀e:G.0