let seq be Real_Sequence; :: thesis: ( seq is non-increasing & seq is bounded_below implies seq is convergent )
assume that
A1:
seq is non-increasing
and
A2:
seq is bounded_below
; :: thesis: seq is convergent
consider r1 being real number such that
A3:
for n being Element of NAT holds r1 < seq . n
by A2, SEQ_2:def 4;
defpred S1[ Real] means ex n being Element of NAT st c1 = seq . n;
consider X being Subset of REAL such that
A4:
for p being Real holds
( p in X iff S1[p] )
from SUBSET_1:sch 3();
A5:
seq . 0 in X
by A4;
A6:
( X is bounded_below iff ex r being real number st
for p being real number st p in X holds
r <= p )
by Def2;
take g = lower_bound X; :: according to SEQ_2:def 6 :: thesis: for b1 being set holds
( b1 <= 0 or ex b2 being Element of NAT st
for b3 being Element of NAT holds
( not b2 <= b3 or not b1 <= abs ((seq . b3) - g) ) )
let s be real number ; :: thesis: ( s <= 0 or ex b1 being Element of NAT st
for b2 being Element of NAT holds
( not b1 <= b2 or not s <= abs ((seq . b2) - g) ) )
assume A8:
0 < s
; :: thesis: ex b1 being Element of NAT st
for b2 being Element of NAT holds
( not b1 <= b2 or not s <= abs ((seq . b2) - g) )
then consider p1 being real number such that
A9:
p1 in X
and
A10:
p1 < (lower_bound X) + s
by A5, A6, Def5;
consider n1 being Element of NAT such that
A11:
p1 = seq . n1
by A4, A9;
take n = n1; :: thesis: for b1 being Element of NAT holds
( not n <= b1 or not s <= abs ((seq . b1) - g) )
let m be Element of NAT ; :: thesis: ( not n <= m or not s <= abs ((seq . m) - g) )
assume
n <= m
; :: thesis: not s <= abs ((seq . m) - g)
then
seq . m <= seq . n
by A1, SEQM_3:14;
then
seq . m < g + s
by A10, A11, XXREAL_0:2;
then A12:
(seq . m) - g < s
by XREAL_1:21;
seq . m in X
by A4;
then
0 + g <= seq . m
by A6, A7, Def5;
then A13:
0 <= (seq . m) - g
by XREAL_1:21;
- s < - 0
by A8, XREAL_1:26;
hence
abs ((seq . m) - g) < s
by A12, A13, SEQ_2:9; :: thesis: verum