let c be Real; :: thesis: x_+_ c = (id REAL) + (const c)
A1: dom ((id REAL) + (const c)) = REAL by FUNCT_2:def 1;
for x being object st x in dom (x_+_ c) holds
(x_+_ c) . x = ((id REAL) + (const c)) . x
proof
let x be object ; :: thesis: ( x in dom (x_+_ c) implies (x_+_ c) . x = ((id REAL) + (const c)) . x )
assume A2: x in dom (x_+_ c) ; :: thesis: (x_+_ c) . x = ((id REAL) + (const c)) . x
then reconsider x1 = x as Real ;
A3: (x_+_ c) . x1 = (1 * x1) + c by FCONT_1:def 4;
A4: (id REAL) . x1 = x1 by A2, FUNCT_1:18;
((id REAL) + (const c)) . x1 = ((id REAL) . x1) + ((const c) . x1) by A2, A1, VALUED_1:def 1
.= x1 + ((0 * x1) + c) by A4, FCONT_1:def 4
.= x1 + c ;
hence (x_+_ c) . x = ((id REAL) + (const c)) . x by A3; :: thesis: verum
end;
hence x_+_ c = (id REAL) + (const c) by FUNCT_2:def 1, A1; :: thesis: verum