assumption.
qed.
(* questo va spostato in primes1.ma *)
-theorem plog_exp: \forall n,m,i. O < m \to \not (mod n m = O) \to
+theorem plog_exp: \forall n,m,i. O < m \to \lnot (mod n m = O) \to
\forall p. i \le p \to plog_aux p (m \sup i * n) m = pair nat nat i n.
intros 5.
elim i.