let X be set ; for S being non empty Subset-Family of X
for M being Function of S,ExtREAL
for F being disjoint_valued FinSequence of S
for x being FinSequence of ExtREAL st {} in S & S is cup-closed & M is zeroed & M is additive & dom x = dom F & ( for i being Nat st i in dom x holds
x . i = M . (F . i) ) holds
Sum x = M . (Union F)
let S be non empty Subset-Family of X; for M being Function of S,ExtREAL
for F being disjoint_valued FinSequence of S
for x being FinSequence of ExtREAL st {} in S & S is cup-closed & M is zeroed & M is additive & dom x = dom F & ( for i being Nat st i in dom x holds
x . i = M . (F . i) ) holds
Sum x = M . (Union F)
let M be Function of S,ExtREAL; for F being disjoint_valued FinSequence of S
for x being FinSequence of ExtREAL st {} in S & S is cup-closed & M is zeroed & M is additive & dom x = dom F & ( for i being Nat st i in dom x holds
x . i = M . (F . i) ) holds
Sum x = M . (Union F)
let F be disjoint_valued FinSequence of S; for x being FinSequence of ExtREAL st {} in S & S is cup-closed & M is zeroed & M is additive & dom x = dom F & ( for i being Nat st i in dom x holds
x . i = M . (F . i) ) holds
Sum x = M . (Union F)
let x be FinSequence of ExtREAL ; ( {} in S & S is cup-closed & M is zeroed & M is additive & dom x = dom F & ( for i being Nat st i in dom x holds
x . i = M . (F . i) ) implies Sum x = M . (Union F) )
assume that
A1:
{} in S
and
A2:
S is cup-closed
and
A3:
( M is zeroed & M is additive )
and
A4:
dom x = dom F
and
A5:
for i being Nat st i in dom x holds
x . i = M . (F . i)
; Sum x = M . (Union F)
defpred S1[ Nat] means for F being disjoint_valued FinSequence of S
for x being FinSequence of ExtREAL st len F = $1 & dom x = dom F & ( for i being Nat st i in dom x holds
x . i = M . (F . i) ) holds
Sum x = M . (Union F);
A6:
S1[ 0 ]
A10:
for n being Nat st S1[n] holds
S1[n + 1]
proof
let n be
Nat;
( S1[n] implies S1[n + 1] )
assume A11:
S1[
n]
;
S1[n + 1]
let F be
disjoint_valued FinSequence of
S;
for x being FinSequence of ExtREAL st len F = n + 1 & dom x = dom F & ( for i being Nat st i in dom x holds
x . i = M . (F . i) ) holds
Sum x = M . (Union F)let x be
FinSequence of
ExtREAL ;
( len F = n + 1 & dom x = dom F & ( for i being Nat st i in dom x holds
x . i = M . (F . i) ) implies Sum x = M . (Union F) )
assume that A12:
len F = n + 1
and A13:
dom x = dom F
and A14:
for
i being
Nat st
i in dom x holds
x . i = M . (F . i)
;
Sum x = M . (Union F)
reconsider Fn =
F | n as
disjoint_valued FinSequence of
S by ROUGHS_1:6, RELAT_1:59;
reconsider xn =
x | n as
FinSequence of
ExtREAL ;
A15:
len Fn = n
by A12, NAT_1:11, FINSEQ_1:59;
A16:
dom x = Seg (len F)
by A13, FINSEQ_1:def 3;
then A17:
len x = n + 1
by A12, FINSEQ_1:def 3;
then A18:
len xn = n
by FINSEQ_1:59, NAT_1:11;
A19:
Seg n c= Seg (n + 1)
by FINSEQ_1:5, NAT_1:11;
A20:
Fn is
disjoint_valued
;
A21:
dom xn = Seg (len xn)
by FINSEQ_1:def 3;
for
i being
Nat st
i in dom xn holds
xn . i = M . (Fn . i)
then A23:
Sum xn = M . (Union Fn)
by A11, A15, A20, A21, A18, FINSEQ_1:def 3;
reconsider xn1 =
x . (n + 1) as
Element of
ExtREAL ;
x = xn ^ <*xn1*>
by FINSEQ_3:55, A17;
then A24:
Sum x = (Sum xn) + xn1
by MEASURE9:21;
A25:
x . (n + 1) = M . (F . (n + 1))
by A14, A12, A16, FINSEQ_1:4;
F | (n + 1) = F
by A12, FINSEQ_1:58;
then A26:
Union F = (Union Fn) \/ (F . (n + 1))
by MEASUR11:3;
n < n + 1
by NAT_1:13;
then A27:
Union Fn misses F . (n + 1)
by MEASUR11:1;
then A28:
Union Fn is
Element of
S
by A1, A2, MEASUR11:5;
F . (n + 1) in rng F
by A13, A12, A16, FINSEQ_1:4, FUNCT_1:3;
hence
Sum x = M . (Union F)
by A2, A3, A24, A23, A25, A27, A28, A26;
verum
end;
for n being Nat holds S1[n]
from NAT_1:sch 2(A6, A10);
then
S1[ len F]
;
hence
Sum x = M . (Union F)
by A4, A5; verum