At:
sqrt prime irrational11121112
1.
p:
2.
prime(p)
3.
0 < p
4.
m:
5.
m1:. m1 < m (n:. m1m1 = pnn n = 0)
6.
n:
7.
((m p)p+(m mod p))((m p)p+(m mod p)) = pnn
8.
n = 0
9.
m = (m p)p+(m mod p)
10.
(m mod p) < p
11.
n@0:. nn = pn@0n@0 n@0 = 0
12.
p | ((m mod p)(m mod p))
13.
p | (m mod p)
n = 0
By:
Unfold `divides` -1
THEN
ExRepD
Generated subgoal: