let D be non empty set ; :: thesis: for F being PartFunc of D,REAL holds
( F = (max+ F) - (max- F) & abs F = (max+ F) + (max- F) & 2 (#) (max+ F) = F + (abs F) )
let F be PartFunc of D,REAL ; :: thesis: ( F = (max+ F) - (max- F) & abs F = (max+ F) + (max- F) & 2 (#) (max+ F) = F + (abs F) )
A1:
dom (max+ F) = dom F
by Def10;
B1:
dom (max- F) = dom F
by Def11;
C1:
( dom (abs F) = dom F & dom (2 (#) (max+ F)) = dom (max+ F) )
by VALUED_1:def 5, VALUED_1:def 11;
X:
dom F = (dom F) /\ (dom F)
;
dom (- (max- F)) = dom (max- F)
by VALUED_1:def 5;
then A2:
dom F = dom ((max+ F) + (- (max- F)))
by X, A1, B1, VALUED_1:def 1;
B2:
( dom (abs F) = dom ((max+ F) + (max- F)) & dom (2 (#) (max+ F)) = dom (F + (abs F)) )
by X, A1, C1, B1, VALUED_1:def 1;
hence
F = (max+ F) - (max- F)
by A2, PARTFUN1:34; :: thesis: ( abs F = (max+ F) + (max- F) & 2 (#) (max+ F) = F + (abs F) )
hence
abs F = (max+ F) + (max- F)
by B2, PARTFUN1:34; :: thesis: 2 (#) (max+ F) = F + (abs F)
hence
2 (#) (max+ F) = F + (abs F)
by A1, C1, B2, PARTFUN1:34; :: thesis: verum