let seq be ExtREAL_sequence; :: thesis: for rseq being Real_Sequence st seq = rseq & rseq is bounded holds

( superior_realsequence seq = superior_realsequence rseq & lim_sup seq = lim_sup rseq )

let rseq be Real_Sequence; :: thesis: ( seq = rseq & rseq is bounded implies ( superior_realsequence seq = superior_realsequence rseq & lim_sup seq = lim_sup rseq ) )

assume that

A1: seq = rseq and

A2: rseq is bounded ; :: thesis: ( superior_realsequence seq = superior_realsequence rseq & lim_sup seq = lim_sup rseq )

A3: NAT = dom (superior_realsequence rseq) by FUNCT_2:def 1;

then A6: rng (superior_realsequence rseq) is bounded_below by RINFSUP1:6;

NAT = dom (superior_realsequence seq) by FUNCT_2:def 1;

then superior_realsequence seq = superior_realsequence rseq by A4, A3, FUNCT_1:2;

hence ( superior_realsequence seq = superior_realsequence rseq & lim_sup seq = lim_sup rseq ) by A6, Th3; :: thesis: verum

( superior_realsequence seq = superior_realsequence rseq & lim_sup seq = lim_sup rseq )

let rseq be Real_Sequence; :: thesis: ( seq = rseq & rseq is bounded implies ( superior_realsequence seq = superior_realsequence rseq & lim_sup seq = lim_sup rseq ) )

assume that

A1: seq = rseq and

A2: rseq is bounded ; :: thesis: ( superior_realsequence seq = superior_realsequence rseq & lim_sup seq = lim_sup rseq )

A3: NAT = dom (superior_realsequence rseq) by FUNCT_2:def 1;

A4: now :: thesis: for x being object st x in NAT holds

(superior_realsequence seq) . x = (superior_realsequence rseq) . x

superior_realsequence rseq is bounded
by A2, RINFSUP1:56;(superior_realsequence seq) . x = (superior_realsequence rseq) . x

let x be object ; :: thesis: ( x in NAT implies (superior_realsequence seq) . x = (superior_realsequence rseq) . x )

assume x in NAT ; :: thesis: (superior_realsequence seq) . x = (superior_realsequence rseq) . x

then reconsider n = x as Element of NAT ;

A5: Y2 is bounded_above by A2, RINFSUP1:31;

ex Y1 being non empty Subset of ExtREAL st

( Y1 = { (seq . k) where k is Nat : n <= k } & (superior_realsequence seq) . n = sup Y1 ) by Def7;

then (superior_realsequence seq) . x = upper_bound Y2 by A1, A5, Th1;

hence (superior_realsequence seq) . x = (superior_realsequence rseq) . x by RINFSUP1:def 5; :: thesis: verum

end;assume x in NAT ; :: thesis: (superior_realsequence seq) . x = (superior_realsequence rseq) . x

then reconsider n = x as Element of NAT ;

now :: thesis: for x being object st x in { (rseq . k) where k is Nat : n <= k } holds

x in REAL

then reconsider Y2 = { (rseq . k) where k is Nat : n <= k } as Subset of REAL by TARSKI:def 3;x in REAL

let x be object ; :: thesis: ( x in { (rseq . k) where k is Nat : n <= k } implies x in REAL )

assume x in { (rseq . k) where k is Nat : n <= k } ; :: thesis: x in REAL

then ex k being Nat st

( x = rseq . k & n <= k ) ;

hence x in REAL by XREAL_0:def 1; :: thesis: verum

end;assume x in { (rseq . k) where k is Nat : n <= k } ; :: thesis: x in REAL

then ex k being Nat st

( x = rseq . k & n <= k ) ;

hence x in REAL by XREAL_0:def 1; :: thesis: verum

A5: Y2 is bounded_above by A2, RINFSUP1:31;

ex Y1 being non empty Subset of ExtREAL st

( Y1 = { (seq . k) where k is Nat : n <= k } & (superior_realsequence seq) . n = sup Y1 ) by Def7;

then (superior_realsequence seq) . x = upper_bound Y2 by A1, A5, Th1;

hence (superior_realsequence seq) . x = (superior_realsequence rseq) . x by RINFSUP1:def 5; :: thesis: verum

then A6: rng (superior_realsequence rseq) is bounded_below by RINFSUP1:6;

NAT = dom (superior_realsequence seq) by FUNCT_2:def 1;

then superior_realsequence seq = superior_realsequence rseq by A4, A3, FUNCT_1:2;

hence ( superior_realsequence seq = superior_realsequence rseq & lim_sup seq = lim_sup rseq ) by A6, Th3; :: thesis: verum