let L, K be ExtREAL_sequence; for c being Real st 0 <= c & L is without-infty & ( for n being Nat holds K . n = (R_EAL c) * (L . n) ) holds
( sup (rng K) = (R_EAL c) * (sup (rng L)) & K is without-infty )
let c be Real; ( 0 <= c & L is without-infty & ( for n being Nat holds K . n = (R_EAL c) * (L . n) ) implies ( sup (rng K) = (R_EAL c) * (sup (rng L)) & K is without-infty ) )
assume that
A1:
0 <= c
and
A2:
L is without-infty
and
A3:
for n being Nat holds K . n = (R_EAL c) * (L . n)
; ( sup (rng K) = (R_EAL c) * (sup (rng L)) & K is without-infty )
now per cases
( sup (rng L) in REAL or sup (rng L) = +infty )
by A2, Lm8;
suppose A6:
sup (rng L) in REAL
;
sup (rng K) = c * (sup (rng L))A7:
for
y being
UpperBound of
rng K holds
(R_EAL c) * (sup (rng L)) <= y
proof
let y be
UpperBound of
rng K;
(R_EAL c) * (sup (rng L)) <= y
reconsider y =
y as
R_eal by XXREAL_0:def 1;
A8:
dom L = NAT
by FUNCT_2:def 1;
A9:
dom K = NAT
by FUNCT_2:def 1;
per cases
( c = 0 or c <> 0 )
;
suppose A12:
c <> 0
;
(R_EAL c) * (sup (rng L)) <= ythen
y / (R_EAL c) is
UpperBound of
rng L
by XXREAL_2:def 1;
then A16:
sup (rng L) <= y / (R_EAL c)
by XXREAL_2:def 3;
A17:
now assume A18:
y = -infty
;
contradiction
K . 1
in rng K
by A9, FUNCT_1:12;
then
K . 1
= -infty
by A18, XXREAL_0:6, XXREAL_2:def 1;
then A19:
(R_EAL c) * (L . 1) = -infty
by A3;
L . 1
<= sup (rng L)
by A8, FUNCT_1:12, XXREAL_2:4;
then A20:
L . 1
< +infty
by A6, XXREAL_0:2, XXREAL_0:9;
-infty < L . 1
by A2, Def5;
hence
contradiction
by A19, A20, XXREAL_3:81;
verum end; end; end;
end; then
(R_EAL c) * (sup (rng L)) is
UpperBound of
rng K
by XXREAL_2:def 1;
hence
sup (rng K) = c * (sup (rng L))
by A7, XXREAL_2:def 3;
verum end; end; end;
hence
sup (rng K) = (R_EAL c) * (sup (rng L))
; K is without-infty
hence
K is without-infty
by Def5; verum