let r be Real; :: thesis: for s being Surreal
for y being positive Surreal holds s + ((uReal . r) * y) is s,y,r _Term

let s be Surreal; :: thesis: for y being positive Surreal holds s + ((uReal . r) * y) is s,y,r _Term
let y be positive Surreal; :: thesis: s + ((uReal . r) * y) is s,y,r _Term
set R = uReal . r;
set N = y;
y is positive ;
then A1: not y == 0_No ;
0_No <= y by SURREALI:def 8;
then A2: |.y.| = y by Def6;
|.((s + ((uReal . r) * y)) - (s + ((uReal . r) * y))).| == 0_No by Th33, SURREALR:39;
hence s + ((uReal . r) * y) is s,y,r _Term by A2, A1, Th64; :: thesis: verum