let X be non empty set ; for a, b being Real
for f being PartFunc of X,REAL st f is nonnegative & a > 0 & b > 0 holds
(f to_power a) (#) (f to_power b) = f to_power (a + b)
let a, b be Real; for f being PartFunc of X,REAL st f is nonnegative & a > 0 & b > 0 holds
(f to_power a) (#) (f to_power b) = f to_power (a + b)
let f be PartFunc of X,REAL ; ( f is nonnegative & a > 0 & b > 0 implies (f to_power a) (#) (f to_power b) = f to_power (a + b) )
assume AS:
( f is nonnegative & a > 0 & b > 0 )
; (f to_power a) (#) (f to_power b) = f to_power (a + b)
A1:
( dom (f to_power a) = dom f & dom (f to_power b) = dom f )
by MESFUN6C:def 6;
A2:
dom ((f to_power a) (#) (f to_power b)) = (dom (f to_power a)) /\ (dom (f to_power b))
by VALUED_1:def 4;
then A4:
dom ((f to_power a) (#) (f to_power b)) = dom (f to_power (a + b))
by A1, MESFUN6C:def 6;
for x being set st x in dom ((f to_power a) (#) (f to_power b)) holds
((f to_power a) (#) (f to_power b)) . x = (f to_power (a + b)) . x
proof
let x be
set ;
( x in dom ((f to_power a) (#) (f to_power b)) implies ((f to_power a) (#) (f to_power b)) . x = (f to_power (a + b)) . x )
assume A6:
x in dom ((f to_power a) (#) (f to_power b))
;
((f to_power a) (#) (f to_power b)) . x = (f to_power (a + b)) . x
(
(f to_power a) . x = (f . x) to_power a &
(f to_power b) . x = (f . x) to_power b )
by A1, A2, A6, MESFUN6C:def 6;
then A7:
((f to_power a) (#) (f to_power b)) . x = ((f . x) to_power a) * ((f . x) to_power b)
by A6, VALUED_1:def 4;
A8:
(f to_power (a + b)) . x = (f . x) to_power (a + b)
by A4, A6, MESFUN6C:def 6;
A9:
(
f . x > 0 implies
((f to_power a) (#) (f to_power b)) . x = (f to_power (a + b)) . x )
by A8, A7, POWER:32;
hence
((f to_power a) (#) (f to_power b)) . x = (f to_power (a + b)) . x
by AS, A9, MESFUNC6:51;
verum
end;
hence
(f to_power a) (#) (f to_power b) = f to_power (a + b)
by A4, FUNCT_1:9; verum