let a be real number ; :: thesis: for n being natural number st 1 < a & 2 <= n holds
a < a |^ n
let n be natural number ; :: thesis: ( 1 < a & 2 <= n implies a < a |^ n )
assume A1: ( 1 < a & 2 <= n ) ; :: thesis: a < a |^ n
then consider m being Nat such that
A2: n = 2 + m by NAT_1:10;
A3: m in NAT by ORDINAL1:def 13;
A4: a |^ (2 + 0 ) = (a GeoSeq ) . (1 + 1) by Def1
.= ((a GeoSeq ) . (0 + 1)) * a by Th4
.= (((a GeoSeq ) . 0 ) * a) * a by Th4
.= (1 * a) * a by Th4
.= a * a ;
defpred S₁[ Element of NAT ] means a < a |^ (2 + $1);
A5: a * a > a * 1 by A1, XREAL_1:70;
then A6: S₁[ 0 ] by A4;
A7: for m1 being Element of NAT st S₁[m1] holds
S₁[m1 + 1]

proof

let m1 be Element of NAT ; :: thesis: ( S₁[m1] implies S₁[m1 + 1] )
assume a < a |^ (2 + m1) ; :: thesis: S₁[m1 + 1]
then (a |^ (2 + m1)) * a > a * a by A1, XREAL_1:70;
then a |^ ((2 + m1) + 1) > a * a by NEWTON:11;
hence S₁[m1 + 1] by A5, XXREAL_0:2; :: thesis: verum

end;

for m1 being Element of NAT holds S₁[m1] from NAT_1:sch 1(A6, A7);
hence a < a |^ n by A2, A3; :: thesis: verum