let L be ExtREAL_sequence; :: thesis: for K being R_eal st ( for n being Nat holds L . n <= K ) holds
sup (rng L) <= K
let K be R_eal; :: thesis: ( ( for n being Nat holds L . n <= K ) implies sup (rng L) <= K )
assume A1: for n being Nat holds L . n <= K ; :: thesis: sup (rng L) <= K
now :: thesis: for x being ExtReal st x in rng L holds
x <= K
let x be ExtReal; :: thesis: ( x in rng L implies x <= K )
assume x in rng L ; :: thesis: x <= K
then ex z being object st
( z in dom L & x = L . z ) by FUNCT_1:def 3;
hence x <= K by A1; :: thesis: verum
end;
then K is UpperBound of rng L by XXREAL_2:def 1;
hence sup (rng L) <= K by XXREAL_2:def 3; :: thesis: verum