let a be prime Nat; :: thesis: for m being Nat
for n being non trivial Nat holds
( n -root (a |^ m) is rational iff n divides m )

let m be Nat; :: thesis: for n being non trivial Nat holds
( n -root (a |^ m) is rational iff n divides m )

let n be non trivial Nat; :: thesis: ( n -root (a |^ m) is rational iff n divides m )
thus ( n -root (a |^ m) is rational implies n divides m ) :: thesis: ( n divides m implies n -root (a |^ m) is rational )
proof
assume A: n -root (a |^ m) is rational ; :: thesis: n divides m
assume not n divides m ; :: thesis: contradiction
then reconsider d = m mod n as non zero Nat by INT_1:62;
reconsider c = m div n as Nat ;
B1: n >= 1 by NEWTON03:def 1;
d < n by NAT_D:1;
then consider k being Nat such that
B2: n = d + k by NAT_1:10;
reconsider k = k as non zero Nat by B2, NAT_D:1;
B3: (d + k) -root (a |^ d) is irrational ;
n -root (a |^ m) = n -root (a |^ ((c * n) + d)) by NAT_D:2
.= n -root ((a |^ (n * c)) * (a |^ d)) by NEWTON:8
.= (n -root (a |^ (n * c))) * (n -root (a |^ d)) by POWER:11, B1
.= (n -root ((a |^ c) |^ n)) * (n -root (a |^ d)) by NEWTON:9
.= (a |^ c) * (n -root (a |^ d)) ;
hence contradiction by A, B2, B3; :: thesis: verum
end;
assume n divides m ; :: thesis: n -root (a |^ m) is rational
then n -root (a |^ m) = n -root (a |^ (n * (m div n)))
.= n -root ((a |^ (m div n)) |^ n) by NEWTON:9 ;
hence n -root (a |^ m) is rational ; :: thesis: verum