X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;ds=sidebyside;f=helm%2Fsoftware%2Fmatita%2Flibrary%2Fnat%2Feuler_theorem.ma;h=e5933ad95d4dd16263c99d7b036869c5db12e93f;hb=4dc47c9675ffd5fa50296ffaa9b5997501518c98;hp=ab7d8242e1e5752573c61e187807a4aeeecfdbab;hpb=3ed7d56cf4fab7401f8b400c45b2e35579ba71dd;p=helm.git

diff --git a/helm/software/matita/library/nat/euler_theorem.ma b/helm/software/matita/library/nat/euler_theorem.ma
index ab7d8242e..e5933ad95 100644
--- a/helm/software/matita/library/nat/euler_theorem.ma
+++ b/helm/software/matita/library/nat/euler_theorem.ma
@@ -12,8 +12,6 @@
 (*                                                                        *)
 (**************************************************************************)
 
-set "baseuri" "cic:/matita/nat/euler_theorem".
-
 include "nat/map_iter_p.ma".
 include "nat/totient.ma".
 
@@ -55,7 +53,6 @@ intro.apply (nat_case n)
 qed.
 *)
 
-
 (*this obvious property is useful because simplify, sometimes,
   "simplifies too much", and doesn't allow to obtain this simple result.
  *)
@@ -86,7 +83,7 @@ elim (m)
         reflexivity
       | rewrite > gcd_O_n.
         apply not_eq_to_eqb_false.
-        apply cic:/matita/nat/nat/not_eq_S.con.                
+        apply not_eq_S.             
         unfold Not.
         intro.        
         cut ( (S n) \le O)
@@ -136,7 +133,6 @@ elim (m)
 ]
 qed.
   
-
 lemma totient_card: \forall n.
 totient n = card n (\lambda i.eqb (gcd i n) (S O)).
 intros.
@@ -163,7 +159,7 @@ elim n
       apply (totient_card_aux n2 n2).
       reflexivity    
     | apply not_eq_to_eqb_false.
-      apply cic:/matita/nat/nat/not_eq_S.con.
+      apply not_eq_S.
       unfold Not.
       intro.
       cut ( (S n2) \le O)