assumption.
change with nth_prime (max_prime_factor n) \divides r \to False.
intro.
-cut \lnot (mod r (nth_prime (max_prime_factor n))) = O.
+cut mod r (nth_prime (max_prime_factor n)) \neq O.
apply Hcut1.apply divides_to_mod_O.
apply lt_O_nth_prime_n.assumption.
apply plog_aux_to_not_mod_O n n ? q r.
simplify. intro.apply not_le_Sn_O O.
rewrite < H5 in \vdash (? ? %).assumption.
apply le_to_or_lt_eq.apply le_O_n.
-cut (S O) < r \lor \lnot (S O) < r.
+cut (S O) < r \lor (S O) \nlt r.
elim Hcut1.
right.
apply plog_to_lt_max_prime_factor1 n1 ? q r.
assumption.
apply le_to_or_lt_eq.apply le_O_n.assumption.
(* e adesso l'ultimo goal. TASSI: che ora non e' piu' l'ultimo :P *)
-cut (S O) < r \lor \lnot (S O) < r.
+cut (S O) < r \lor S O \nlt r.
elim Hcut2.
right.
apply plog_to_lt_max_prime_factor1 (S(S m1)) ? q r.