let n be non trivial Nat; :: thesis: for a being prime Nat
for b being Nat st a divides b & not a |^ n divides b holds
n -root b is irrational

let a be prime Nat; :: thesis: for b being Nat st a divides b & not a |^ n divides b holds
n -root b is irrational

let b be Nat; :: thesis: ( a divides b & not a |^ n divides b implies n -root b is irrational )
assume A1: a divides b ; :: thesis: ( a |^ n divides b or n -root b is irrational )
assume A2: not a |^ n divides b ; :: thesis: n -root b is irrational
then reconsider b = b as non zero Integer by INT_2:12;
a |^ 1 divides b by A1;
then reconsider m = a |-count b as non zero Nat by NEWTON03:59;
m < n by A2, NEWTON03:59;
then consider c being Nat such that
A4: n = m + c by NAT_1:10;
|.a.| > 1 by INT_2:def 4;
then a |^ m divides b by NEWTON03:def 7;
then consider k being Nat such that
A5: b = (a |^ m) * k by NAT_D:def 3;
reconsider k = k as non zero Nat by A5;
m + c > m + 0 by A2, NEWTON03:59, A4;
then (c + m) -root ((a |^ m) * k) is irrational by A5, Th9, NEWTON03:76;
hence n -root b is irrational by A4, A5; :: thesis: verum