let seq be Real_Sequence; :: thesis: ( ( ( for n being Nat holds seq . (n + 1) < seq . n ) implies for n, k being Nat holds seq . ((n + 1) + k) < seq . n ) & ( ( for n, k being Nat holds seq . ((n + 1) + k) < seq . n ) implies for n, m being Nat st n < m holds
seq . m < seq . n ) & ( ( for n, m being Nat st n < m holds
seq . m < seq . n ) implies for n being Nat holds seq . (n + 1) < seq . n ) )

thus ( ( for n being Nat holds seq . (n + 1) < seq . n ) implies for n, k being Nat holds seq . ((n + 1) + k) < seq . n ) :: thesis: ( ( ( for n, k being Nat holds seq . ((n + 1) + k) < seq . n ) implies for n, m being Nat st n < m holds
seq . m < seq . n ) & ( ( for n, m being Nat st n < m holds
seq . m < seq . n ) implies for n being Nat holds seq . (n + 1) < seq . n ) )
proof
assume A1: for n being Nat holds seq . (n + 1) < seq . n ; :: thesis: for n, k being Nat holds seq . ((n + 1) + k) < seq . n
let n be Nat; :: thesis: for k being Nat holds seq . ((n + 1) + k) < seq . n
defpred S1[ Nat] means seq . ((n + 1) + $1) < seq . n;
A2: now :: thesis: for k being Nat st S1[k] holds
S1[k + 1]
let k be Nat; :: thesis: ( S1[k] implies S1[k + 1] )
assume A3: S1[k] ; :: thesis: S1[k + 1]
seq . (((n + 1) + k) + 1) < seq . ((n + 1) + k) by A1;
hence S1[k + 1] by A3, XXREAL_0:2; :: thesis: verum
end;
A4: S1[ 0 ] by A1;
thus for k being Nat holds S1[k] from NAT_1:sch 2(A4, A2); :: thesis: verum
end;
thus ( ( for n, k being Nat holds seq . ((n + 1) + k) < seq . n ) implies for n, m being Nat st n < m holds
seq . m < seq . n ) :: thesis: ( ( for n, m being Nat st n < m holds
seq . m < seq . n ) implies for n being Nat holds seq . (n + 1) < seq . n )
proof
assume A5: for n, k being Nat holds seq . ((n + 1) + k) < seq . n ; :: thesis: for n, m being Nat st n < m holds
seq . m < seq . n

let n, m be Nat; :: thesis: ( n < m implies seq . m < seq . n )
assume n < m ; :: thesis: seq . m < seq . n
then ex k being Nat st m = (n + 1) + k by Lm1;
hence seq . m < seq . n by A5; :: thesis: verum
end;
assume A6: for n, m being Nat st n < m holds
seq . m < seq . n ; :: thesis: for n being Nat holds seq . (n + 1) < seq . n
let n be Nat; :: thesis: seq . (n + 1) < seq . n
n < n + 1 by NAT_1:13;
hence seq . (n + 1) < seq . n by A6; :: thesis: verum