let X be Subset of REAL; :: thesis: ( X <> {} & X is closed & X is bounded_below implies lower_bound X in X )
assume that
A1: X <> {} and
A2: X is closed and
A3: X is bounded_below and
A4: not lower_bound X in X ; :: thesis: contradiction
set i1 = lower_bound X;
defpred S1[ Element of NAT , Element of REAL ] means ex q being Real st
( q = $2 & q in X & q - (lower_bound X) < 1 / ($1 + 1) );
A5: for n being Element of NAT ex p being Element of REAL st S1[n,p]
proof
let n be Element of NAT ; :: thesis: ex p being Element of REAL st S1[n,p]
0 < (n + 1) " ;
then 0 < 1 / (n + 1) by XCMPLX_1:215;
then consider t being Real such that
A6: t in X and
A7: t < (lower_bound X) + (1 / (n + 1)) by A1, A3, SEQ_4:def 2;
take t ; :: thesis: ( t is set & t is Element of REAL & S1[n,t] )
t - (lower_bound X) < 1 / (n + 1) by A7, XREAL_1:19;
hence ( t is set & t is Element of REAL & S1[n,t] ) by A6; :: thesis: verum
end;
consider f being sequence of REAL such that
A8: for n being Element of NAT holds S1[n,f . n] from FUNCT_2:sch 3(A5);
A9: now :: thesis: for n being Nat holds
( f . n in X & (f . n) - (lower_bound X) < 1 / (n + 1) )
let n be Nat; :: thesis: ( f . n in X & (f . n) - (lower_bound X) < 1 / (n + 1) )
n in NAT by ORDINAL1:def 12;
then ex q being Real st
( q = f . n & q in X & q - (lower_bound X) < 1 / (n + 1) ) by A8;
hence ( f . n in X & (f . n) - (lower_bound X) < 1 / (n + 1) ) ; :: thesis: verum
end;
A10: rng f c= X
proof
let x be object ; :: according to TARSKI:def 3 :: thesis: ( not x in rng f or x in X )
assume x in rng f ; :: thesis: x in X
then consider y being object such that
A11: y in dom f and
A12: x = f . y by FUNCT_1:def 3;
reconsider y = y as Element of NAT by A11, FUNCT_2:def 1;
f . y in X by A9;
hence x in X by A12; :: thesis: verum
end;
A13: now :: thesis: for s being Real st 0 < s holds
ex k being Nat st
for m being Nat st k <= m holds
|.((f . m) - (lower_bound X)).| < s
let s be Real; :: thesis: ( 0 < s implies ex k being Nat st
for m being Nat st k <= m holds
|.((f . m) - (lower_bound X)).| < s )

assume A14: 0 < s ; :: thesis: ex k being Nat st
for m being Nat st k <= m holds
|.((f . m) - (lower_bound X)).| < s

consider n being Nat such that
A15: s " < n by SEQ_4:3;
take k = n; :: thesis: for m being Nat st k <= m holds
|.((f . m) - (lower_bound X)).| < s

let m be Nat; :: thesis: ( k <= m implies |.((f . m) - (lower_bound X)).| < s )
assume k <= m ; :: thesis: |.((f . m) - (lower_bound X)).| < s
then k + 1 <= m + 1 by XREAL_1:6;
then A16: 1 / (m + 1) <= 1 / (k + 1) by XREAL_1:118;
f . m in X by A9;
then lower_bound X <= f . m by A3, SEQ_4:def 2;
then A17: 0 <= (f . m) - (lower_bound X) by XREAL_1:48;
(s ") + 0 < n + 1 by A15, XREAL_1:8;
then 1 / (n + 1) < 1 / (s ") by A14, XREAL_1:76;
then 1 / (n + 1) < s by XCMPLX_1:216;
then 1 / (m + 1) < s by A16, XXREAL_0:2;
then (f . m) - (lower_bound X) < s by A9, XXREAL_0:2;
hence |.((f . m) - (lower_bound X)).| < s by A17, ABSVALUE:def 1; :: thesis: verum
end;
then A18: f is convergent ;
then lim f = lower_bound X by A13, SEQ_2:def 7;
hence contradiction by A2, A4, A18, A10; :: thesis: verum