X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fmatita%2Flibrary%2Fnat%2Fdiv_and_mod.ma;h=cbab87206ee5457cf967e25505b3772ed9180b15;hb=HEAD;hp=538515a8cc806003287340ef9d1299b4625a17a0;hpb=c445ba5534cccde19016c92660ab52777af221c0;p=helm.git

diff --git a/helm/software/matita/library/nat/div_and_mod.ma b/helm/software/matita/library/nat/div_and_mod.ma
index 538515a8c..cbab87206 100644
--- a/helm/software/matita/library/nat/div_and_mod.ma
+++ b/helm/software/matita/library/nat/div_and_mod.ma
@@ -29,8 +29,7 @@ match m with
 [O \Rightarrow n
 | (S p) \Rightarrow mod_aux n n p]. 
 
-interpretation "natural remainder" 'module x y =
-  (cic:/matita/nat/div_and_mod/mod.con x y).
+interpretation "natural remainder" 'module x y = (mod x y).
 
 let rec div_aux p m n : nat \def
 match (leb m n) with
@@ -46,8 +45,7 @@ match m with
 [O \Rightarrow S n
 | (S p) \Rightarrow div_aux n n p]. 
 
-interpretation "natural divide" 'divide x y =
-  (cic:/matita/nat/div_and_mod/div.con x y).
+interpretation "natural divide" 'divide x y = (div x y).
 
 theorem le_mod_aux_m_m: 
 \forall p,n,m. n \leq p \to (mod_aux p n m) \leq m.
@@ -149,11 +147,14 @@ apply le_plus_n.
 rewrite < sym_times.
 rewrite > distr_times_minus.
 rewrite > plus_minus.
+lapply(plus_to_minus ??? H3); demodulate all.
+(*
 rewrite > sym_times.
 rewrite < H5.
 rewrite < sym_times. 
 apply plus_to_minus.
 apply H3.
+*)
 apply le_times_r.
 apply lt_to_le.
 apply H6.
@@ -197,8 +198,8 @@ qed.
 
 theorem div_mod_spec_times : \forall n,m:nat.div_mod_spec ((S n)*m) (S n) m O.
 intros.constructor 1.
-unfold lt.apply le_S_S.apply le_O_n.
-rewrite < plus_n_O.rewrite < sym_times.reflexivity.
+unfold lt.apply le_S_S.apply le_O_n. demodulate. reflexivity.
+(*rewrite < plus_n_O.rewrite < sym_times.reflexivity.*)
 qed.
 
 lemma div_plus_times: \forall m,q,r:nat. r < m \to  (q*m+r)/ m = q. 
@@ -245,8 +246,8 @@ theorem div_n_n: \forall n:nat. O < n \to n / n = S O.
 intros.
 apply (div_mod_spec_to_eq n n (n / n) (n \mod n) (S O) O).
 apply div_mod_spec_div_mod.assumption.
-constructor 1.assumption.
-rewrite < plus_n_O.simplify.rewrite < plus_n_O.reflexivity.
+constructor 1.assumption. demodulate. reflexivity. (*
+rewrite < plus_n_O.simplify.rewrite < plus_n_O.reflexivity.*)
 qed.
 
 theorem eq_div_O: \forall n,m. n < m \to n / m = O.
@@ -262,8 +263,8 @@ theorem mod_n_n: \forall n:nat. O < n \to n \mod n = O.
 intros.
 apply (div_mod_spec_to_eq2 n n (n / n) (n \mod n) (S O) O).
 apply div_mod_spec_div_mod.assumption.
-constructor 1.assumption.
-rewrite < plus_n_O.simplify.rewrite < plus_n_O.reflexivity.
+constructor 1.assumption. demodulate. reflexivity.(*
+rewrite < plus_n_O.simplify.rewrite < plus_n_O.reflexivity.*)
 qed.
 
 theorem mod_S: \forall n,m:nat. O < m \to S (n \mod m) < m \to