let a, n be Nat; :: thesis: for b being Real st (a + 1) |^ n > b |^ n & b |^ n > a |^ n holds
not b is integer

let b be Real; :: thesis: ( (a + 1) |^ n > b |^ n & b |^ n > a |^ n implies not b is integer )
assume A1: ( (a + 1) |^ n > b |^ n & b |^ n > a |^ n ) ; :: thesis: not b is integer
assume b is integer ; :: thesis: contradiction
then reconsider b = b as Integer ;
per cases ( b >= 0 or b < 0 ) ;
suppose b >= 0 ; :: thesis: contradiction
then b in NAT by INT_1:3;
then reconsider b = b as Nat ;
b > a by A1, NEWTON02:41;
then b >= a + 1 by INT_1:7;
hence contradiction by A1, NEWTON02:41; :: thesis: verum
end;
suppose b < 0 ; :: thesis: contradiction
then - b in NAT by INT_1:3;
then reconsider c = - b as Nat ;
B1: ( c |^ n = b |^ n or c |^ n = - (b |^ n) ) by POWER:1, POWER:2;
then c > a by A1, NEWTON02:41;
then c >= a + 1 by INT_1:7;
hence contradiction by A1, B1, NEWTON02:41; :: thesis: verum
end;
end;