let n be Nat; :: thesis: for r being Real
for seq being Real_Sequence st seq is bounded_below holds
( r = (inferior_realsequence seq) . n iff ( ( for k being Nat holds r <= seq . (n + k) ) & ( for s being Real st 0 < s holds
ex k being Nat st seq . (n + k) < r + s ) ) )

let r be Real; :: thesis: for seq being Real_Sequence st seq is bounded_below holds
( r = (inferior_realsequence seq) . n iff ( ( for k being Nat holds r <= seq . (n + k) ) & ( for s being Real st 0 < s holds
ex k being Nat st seq . (n + k) < r + s ) ) )

let seq be Real_Sequence; :: thesis: ( seq is bounded_below implies ( r = (inferior_realsequence seq) . n iff ( ( for k being Nat holds r <= seq . (n + k) ) & ( for s being Real st 0 < s holds
ex k being Nat st seq . (n + k) < r + s ) ) ) )

reconsider Y1 = { (seq . k) where k is Nat : n <= k } as Subset of REAL by Th29;
assume seq is bounded_below ; :: thesis: ( r = (inferior_realsequence seq) . n iff ( ( for k being Nat holds r <= seq . (n + k) ) & ( for s being Real st 0 < s holds
ex k being Nat st seq . (n + k) < r + s ) ) )

then A1: ( not Y1 is empty & Y1 is bounded_below ) by Th32, SETLIM_1:1;
thus ( r = (inferior_realsequence seq) . n implies ( ( for k being Nat holds r <= seq . (n + k) ) & ( for s being Real st 0 < s holds
ex k being Nat st seq . (n + k) < r + s ) ) ) :: thesis: ( ( for k being Nat holds r <= seq . (n + k) ) & ( for s being Real st 0 < s holds
ex k being Nat st seq . (n + k) < r + s ) implies r = (inferior_realsequence seq) . n )
proof
assume r = (inferior_realsequence seq) . n ; :: thesis: ( ( for k being Nat holds r <= seq . (n + k) ) & ( for s being Real st 0 < s holds
ex k being Nat st seq . (n + k) < r + s ) )

then A2: r = lower_bound Y1 by Def4;
A3: for s being Real st 0 < s holds
ex k being Nat st seq . (n + k) < r + s
proof
let s be Real; :: thesis: ( 0 < s implies ex k being Nat st seq . (n + k) < r + s )
assume 0 < s ; :: thesis: ex k being Nat st seq . (n + k) < r + s
then consider r1 being Real such that
A4: r1 in Y1 and
A5: r1 < r + s by A1, A2, SEQ_4:def 2;
consider k1 being Nat such that
A6: r1 = seq . k1 and
A7: n <= k1 by A4;
consider k2 being Nat such that
A8: k1 = n + k2 by A7, NAT_1:10;
thus ex k being Nat st seq . (n + k) < r + s by A5, A6, A8; :: thesis: verum
end;
for k being Nat holds r <= seq . (n + k)
proof
let k be Nat; :: thesis: r <= seq . (n + k)
seq . (n + k) in Y1 by SETLIM_1:1;
hence r <= seq . (n + k) by A1, A2, SEQ_4:def 2; :: thesis: verum
end;
hence ( ( for k being Nat holds r <= seq . (n + k) ) & ( for s being Real st 0 < s holds
ex k being Nat st seq . (n + k) < r + s ) ) by A3; :: thesis: verum
end;
assume that
A9: for k being Nat holds r <= seq . (n + k) and
A10: for s being Real st 0 < s holds
ex k being Nat st seq . (n + k) < r + s ; :: thesis: r = (inferior_realsequence seq) . n
A11: for s being Real st 0 < s holds
ex r1 being Real st
( r1 in Y1 & r1 < r + s )
proof
let s be Real; :: thesis: ( 0 < s implies ex r1 being Real st
( r1 in Y1 & r1 < r + s ) )

assume 0 < s ; :: thesis: ex r1 being Real st
( r1 in Y1 & r1 < r + s )

then consider k being Nat such that
A12: seq . (n + k) < r + s by A10;
n + k >= n by NAT_1:11;
then seq . (n + k) in Y1 ;
hence ex r1 being Real st
( r1 in Y1 & r1 < r + s ) by A12; :: thesis: verum
end;
for r1 being Real st r1 in Y1 holds
r <= r1
proof
let r1 be Real; :: thesis: ( r1 in Y1 implies r <= r1 )
assume r1 in Y1 ; :: thesis: r <= r1
then consider k1 being Nat such that
A13: r1 = seq . k1 and
A14: n <= k1 ;
consider k2 being Nat such that
A15: k1 = n + k2 by A14, NAT_1:10;
thus r <= r1 by A9, A13, A15; :: thesis: verum
end;
then r = lower_bound Y1 by A1, A11, SEQ_4:def 2;
hence r = (inferior_realsequence seq) . n by Def4; :: thesis: verum