X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=matita%2Flibrary%2Fnat%2Ffactorization.ma;h=0bd8e247836bb10a679b9f648f0603a1a5a899dc;hb=6ff5322f46c2e88e07b4c345bc45edda7042128a;hp=826a2670a70a6c80822c2baeb4764962822af120;hpb=cd91767a396b7bbc72e6e3ee90a3b758421f935d;p=helm.git diff --git a/matita/library/nat/factorization.ma b/matita/library/nat/factorization.ma index 826a2670a..0bd8e2478 100644 --- a/matita/library/nat/factorization.ma +++ b/matita/library/nat/factorization.ma @@ -46,13 +46,13 @@ cut (\exists i. nth_prime i = smallest_factor n); [ apply (trans_lt ? (S O)); [ unfold lt; apply le_n; | apply lt_SO_smallest_factor; assumption; ] - | letin x \def le.auto new. + | letin x \def le.autobatch new. (* apply divides_smallest_factor_n; apply (trans_lt ? (S O)); [ unfold lt; apply le_n; | assumption; ] *) ] ] - | auto. + | autobatch. (* apply prime_to_nth_prime; apply prime_smallest_factor_n; @@ -70,8 +70,8 @@ apply divides_to_divides_b_true. cut (prime (nth_prime (max_prime_factor n))). apply lt_O_nth_prime_n.apply prime_nth_prime. cut (nth_prime (max_prime_factor n) \divides n). -auto. -auto. +autobatch. +autobatch. (* [ apply (transitive_divides ? n); [ apply divides_max_prime_factor_n. @@ -116,7 +116,7 @@ apply divides_max_prime_factor_n. assumption.unfold Not. intro. cut (r \mod (nth_prime (max_prime_factor n)) \neq O); - [unfold Not in Hcut1.auto new. + [unfold Not in Hcut1.autobatch new. (* apply Hcut1.apply divides_to_mod_O; [ apply lt_O_nth_prime_n. @@ -125,7 +125,7 @@ cut (r \mod (nth_prime (max_prime_factor n)) \neq O); *) |letin z \def le. cut(pair nat nat q r=p_ord_aux n n (nth_prime (max_prime_factor n))); - [2: rewrite < H1.assumption.|letin x \def le.auto width = 4 new] + [2: rewrite < H1.assumption.|letin x \def le.autobatch width = 4 depth = 2] (* CERCA COME MAI le_n non lo applica se lo trova come Const e non Rel *) ]. (*