let A be Ordinal; :: thesis: for r being Sequence of REAL
for y being positive decreasing_infinitely Surreal-Sequence
for x being Real st A c= (dom r) /\ (dom y) holds
Sum (((x (#) r) | A),(y | A)) == (uReal . x) * (Sum ((r | A),(y | A)))

let r be Sequence of REAL ; :: thesis: for y being positive decreasing_infinitely Surreal-Sequence
for x being Real st A c= (dom r) /\ (dom y) holds
Sum (((x (#) r) | A),(y | A)) == (uReal . x) * (Sum ((r | A),(y | A)))

let y be positive decreasing_infinitely Surreal-Sequence; :: thesis: for x being Real st A c= (dom r) /\ (dom y) holds
Sum (((x (#) r) | A),(y | A)) == (uReal . x) * (Sum ((r | A),(y | A)))

let x be Real; :: thesis: ( A c= (dom r) /\ (dom y) implies Sum (((x (#) r) | A),(y | A)) == (uReal . x) * (Sum ((r | A),(y | A))) )
assume A1: A c= (dom r) /\ (dom y) ; :: thesis: Sum (((x (#) r) | A),(y | A)) == (uReal . x) * (Sum ((r | A),(y | A)))
per cases ( x > 0 or x = 0 or x < 0 ) ;
suppose x > 0 ; :: thesis: Sum (((x (#) r) | A),(y | A)) == (uReal . x) * (Sum ((r | A),(y | A)))
hence Sum (((x (#) r) | A),(y | A)) == (uReal . x) * (Sum ((r | A),(y | A))) by A1, Lm5; :: thesis: verum
end;
suppose A2: x = 0 ; :: thesis: Sum (((x (#) r) | A),(y | A)) == (uReal . x) * (Sum ((r | A),(y | A)))
rng ((x (#) r) | A) c= {0}
proof
let y be object ; :: according to TARSKI:def 3 :: thesis: ( not y in rng ((x (#) r) | A) or y in {0} )
assume y in rng ((x (#) r) | A) ; :: thesis: y in {0}
then consider a being object such that
A3: ( a in dom ((x (#) r) | A) & ((x (#) r) | A) . a = y ) by FUNCT_1:def 3;
( y = (x (#) r) . a & (x (#) r) . a = x * (r . a) ) by A3, FUNCT_1:47, VALUED_1:6;
hence y in {0} by A2, TARSKI:def 1; :: thesis: verum
end;
hence Sum (((x (#) r) | A),(y | A)) == (uReal . x) * (Sum ((r | A),(y | A))) by A2, Th66, SURREALN:47; :: thesis: verum
end;
suppose x < 0 ; :: thesis: Sum (((x (#) r) | A),(y | A)) == (uReal . x) * (Sum ((r | A),(y | A)))
then reconsider mx = - x as positive Real ;
A4: dom (mx (#) r) = dom r by VALUED_1:def 5;
- (mx (#) r) = (- 1) (#) (mx (#) r) by VALUED_1:def 6
.= ((- 1) * mx) (#) r by VALUED_2:16 ;
then A5: - (Sum (((mx (#) r) | A),(y | A))) == Sum (((x (#) r) | A),(y | A)) by A4, A1, Th75;
Sum (((mx (#) r) | A),(y | A)) == (uReal . mx) * (Sum ((r | A),(y | A))) by A1, Lm5;
then A6: ( - (Sum (((mx (#) r) | A),(y | A))) == - ((uReal . mx) * (Sum ((r | A),(y | A)))) & - ((uReal . mx) * (Sum ((r | A),(y | A)))) = (- (uReal . mx)) * (Sum ((r | A),(y | A))) ) by SURREALR:10, SURREALR:58;
(- (uReal . mx)) * (Sum ((r | A),(y | A))) == (uReal . (- mx)) * (Sum ((r | A),(y | A))) by SURREALN:56, SURREALR:54;
then - (Sum (((mx (#) r) | A),(y | A))) == (uReal . (- mx)) * (Sum ((r | A),(y | A))) by A6, SURREALO:4;
hence Sum (((x (#) r) | A),(y | A)) == (uReal . x) * (Sum ((r | A),(y | A))) by A5, SURREALO:4; :: thesis: verum
end;
end;