:: MEASURE3 semantic presentation

theorem Th1: :: MEASURE3:1
for b1 being R_eal st -infty <' b1 & b1 <' +infty holds
b1 is Real
proof end;

theorem Th2: :: MEASURE3:2
for b1 being R_eal st not b1 = -infty & not b1 = +infty holds
b1 is Real
proof end;

theorem Th3: :: MEASURE3:3
for b1, b2 being Function of NAT , ExtREAL st ( for b3 being Nat holds (Ser b1) . b3 <=' (Ser b2) . b3 ) holds
SUM b1 <=' SUM b2
proof end;

theorem Th4: :: MEASURE3:4
for b1, b2 being Function of NAT , ExtREAL st ( for b3 being Nat holds (Ser b1) . b3 = (Ser b2) . b3 ) holds
SUM b1 = SUM b2
proof end;

notation
let c1 be set ;
let c2 be sigma_Field_Subset of c1;
synonym N_Sub_fam of c2 for N_Measure_fam of c2;
end;

definition
let c1 be set ;
let c2 be sigma_Field_Subset of c1;
let c3 be Function of NAT ,c2;
redefine func rng as rng c3 -> N_Measure_fam of a2;
coherence
rng c3 is N_Measure_fam of c2
proof end;
end;

theorem Th5: :: MEASURE3:5
for b1 being set
for b2 being sigma_Field_Subset of b1
for b3 being sigma_Measure of b2
for b4 being Function of NAT ,b2
for b5 being Element of b2 st meet (rng b4) c= b5 & ( for b6 being Element of NAT holds b5 c= b4 . b6 ) holds
b3 . b5 = b3 . (meet (rng b4))
proof end;

theorem Th6: :: MEASURE3:6
for b1 being set
for b2 being sigma_Field_Subset of b1
for b3, b4 being Function of NAT ,b2 st b3 . 0 = {} & ( for b5 being Element of NAT holds
( b3 . (b5 + 1) = (b4 . 0) \ (b4 . b5) & b4 . (b5 + 1) c= b4 . b5 ) ) holds
union (rng b3) = (b4 . 0) \ (meet (rng b4))
proof end;

theorem Th7: :: MEASURE3:7
for b1 being set
for b2 being sigma_Field_Subset of b1
for b3, b4 being Function of NAT ,b2 st b3 . 0 = {} & ( for b5 being Element of NAT holds
( b3 . (b5 + 1) = (b4 . 0) \ (b4 . b5) & b4 . (b5 + 1) c= b4 . b5 ) ) holds
meet (rng b4) = (b4 . 0) \ (union (rng b3))
proof end;

theorem Th8: :: MEASURE3:8
for b1 being set
for b2 being sigma_Field_Subset of b1
for b3 being sigma_Measure of b2
for b4, b5 being Function of NAT ,b2 st b3 . (b5 . 0) <' +infty & b4 . 0 = {} & ( for b6 being Element of NAT holds
( b4 . (b6 + 1) = (b5 . 0) \ (b5 . b6) & b5 . (b6 + 1) c= b5 . b6 ) ) holds
b3 . (meet (rng b5)) = (b3 . (b5 . 0)) - (b3 . (union (rng b4)))
proof end;

theorem Th9: :: MEASURE3:9
for b1 being set
for b2 being sigma_Field_Subset of b1
for b3 being sigma_Measure of b2
for b4, b5 being Function of NAT ,b2 st b3 . (b5 . 0) <' +infty & b4 . 0 = {} & ( for b6 being Element of NAT holds
( b4 . (b6 + 1) = (b5 . 0) \ (b5 . b6) & b5 . (b6 + 1) c= b5 . b6 ) ) holds
b3 . (union (rng b4)) = (b3 . (b5 . 0)) - (b3 . (meet (rng b5)))
proof end;

theorem Th10: :: MEASURE3:10
for b1 being set
for b2 being sigma_Field_Subset of b1
for b3 being sigma_Measure of b2
for b4, b5 being Function of NAT ,b2 st b3 . (b5 . 0) <' +infty & b4 . 0 = {} & ( for b6 being Element of NAT holds
( b4 . (b6 + 1) = (b5 . 0) \ (b5 . b6) & b5 . (b6 + 1) c= b5 . b6 ) ) holds
b3 . (meet (rng b5)) = (b3 . (b5 . 0)) - (sup (rng (b3 * b4)))
proof end;

theorem Th11: :: MEASURE3:11
for b1 being set
for b2 being sigma_Field_Subset of b1
for b3 being sigma_Measure of b2
for b4, b5 being Function of NAT ,b2 st b3 . (b5 . 0) <' +infty & b4 . 0 = {} & ( for b6 being Element of NAT holds
( b4 . (b6 + 1) = (b5 . 0) \ (b5 . b6) & b5 . (b6 + 1) c= b5 . b6 ) ) holds
( sup (rng (b3 * b4)) is Real & b3 . (b5 . 0) is Real & inf (rng (b3 * b5)) is Real )
proof end;

theorem Th12: :: MEASURE3:12
for b1 being set
for b2 being sigma_Field_Subset of b1
for b3 being sigma_Measure of b2
for b4, b5 being Function of NAT ,b2 st b3 . (b5 . 0) <' +infty & b4 . 0 = {} & ( for b6 being Element of NAT holds
( b4 . (b6 + 1) = (b5 . 0) \ (b5 . b6) & b5 . (b6 + 1) c= b5 . b6 ) ) holds
sup (rng (b3 * b4)) = (b3 . (b5 . 0)) - (inf (rng (b3 * b5)))
proof end;

theorem Th13: :: MEASURE3:13
for b1 being set
for b2 being sigma_Field_Subset of b1
for b3 being sigma_Measure of b2
for b4, b5 being Function of NAT ,b2 st b3 . (b5 . 0) <' +infty & b4 . 0 = {} & ( for b6 being Element of NAT holds
( b4 . (b6 + 1) = (b5 . 0) \ (b5 . b6) & b5 . (b6 + 1) c= b5 . b6 ) ) holds
inf (rng (b3 * b5)) = (b3 . (b5 . 0)) - (sup (rng (b3 * b4)))
proof end;

theorem Th14: :: MEASURE3:14
for b1 being set
for b2 being sigma_Field_Subset of b1
for b3 being sigma_Measure of b2
for b4 being Function of NAT ,b2 st ( for b5 being Element of NAT holds b4 . (b5 + 1) c= b4 . b5 ) & b3 . (b4 . 0) <' +infty holds
b3 . (meet (rng b4)) = inf (rng (b3 * b4))
proof end;

theorem Th15: :: MEASURE3:15
for b1 being set
for b2 being sigma_Field_Subset of b1
for b3 being Measure of b2
for b4 being N_Measure_fam of b2
for b5 being Sep_Sequence of b2 st b4 = rng b5 holds
SUM (b3 * b5) <=' b3 . (union b4)
proof end;

theorem Th16: :: MEASURE3:16
for b1 being set
for b2 being sigma_Field_Subset of b1
for b3 being Measure of b2
for b4 being Sep_Sequence of b2 holds SUM (b3 * b4) <=' b3 . (union (rng b4)) by Th15;

theorem Th17: :: MEASURE3:17
for b1 being set
for b2 being sigma_Field_Subset of b1
for b3 being Measure of b2 st ( for b4 being Sep_Sequence of b2 holds b3 . (union (rng b4)) <=' SUM (b3 * b4) ) holds
b3 is sigma_Measure of b2
proof end;

definition
let c1 be set ;
let c2 be sigma_Field_Subset of c1;
let c3 be sigma_Measure of c2;
canceled;
pred c3 is_complete c2 means :Def2: :: MEASURE3:def 2
for b1 being Subset of a1
for b2 being set st b2 in a2 & b1 c= b2 & a3 . b2 = 0. holds
b1 in a2;
end;

:: deftheorem Def1 MEASURE3:def 1 :
canceled;

:: deftheorem Def2 defines is_complete MEASURE3:def 2 :
for b1 being set
for b2 being sigma_Field_Subset of b1
for b3 being sigma_Measure of b2 holds
( b3 is_complete b2 iff for b4 being Subset of b1
for b5 being set st b5 in b2 & b4 c= b5 & b3 . b5 = 0. holds
b4 in b2 );

definition
let c1 be set ;
let c2 be sigma_Field_Subset of c1;
let c3 be sigma_Measure of c2;
mode thin of c3 -> Subset of a1 means :Def3: :: MEASURE3:def 3
ex b1 being set st
( b1 in a2 & a4 c= b1 & a3 . b1 = 0. );
existence
ex b1 being Subset of c1ex b2 being set st
( b2 in c2 & b1 c= b2 & c3 . b2 = 0. )
proof end;
end;

:: deftheorem Def3 defines thin MEASURE3:def 3 :
for b1 being set
for b2 being sigma_Field_Subset of b1
for b3 being sigma_Measure of b2
for b4 being Subset of b1 holds
( b4 is thin of b3 iff ex b5 being set st
( b5 in b2 & b4 c= b5 & b3 . b5 = 0. ) );

definition
let c1 be set ;
let c2 be sigma_Field_Subset of c1;
let c3 be sigma_Measure of c2;
func COM c2,c3 -> non empty Subset-Family of a1 means :Def4: :: MEASURE3:def 4
for b1 being set holds
( b1 in a4 iff ex b2 being set st
( b2 in a2 & ex b3 being thin of a3 st b1 = b2 \/ b3 ) );
existence
ex b1 being non empty Subset-Family of c1 st
for b2 being set holds
( b2 in b1 iff ex b3 being set st
( b3 in c2 & ex b4 being thin of c3 st b2 = b3 \/ b4 ) )
proof end;
uniqueness
for b1, b2 being non empty Subset-Family of c1 st ( for b3 being set holds
( b3 in b1 iff ex b4 being set st
( b4 in c2 & ex b5 being thin of c3 st b3 = b4 \/ b5 ) ) ) & ( for b3 being set holds
( b3 in b2 iff ex b4 being set st
( b4 in c2 & ex b5 being thin of c3 st b3 = b4 \/ b5 ) ) ) holds
b1 = b2
proof end;
end;

:: deftheorem Def4 defines COM MEASURE3:def 4 :
for b1 being set
for b2 being sigma_Field_Subset of b1
for b3 being sigma_Measure of b2
for b4 being non empty Subset-Family of b1 holds
( b4 = COM b2,b3 iff for b5 being set holds
( b5 in b4 iff ex b6 being set st
( b6 in b2 & ex b7 being thin of b3 st b5 = b6 \/ b7 ) ) );

definition
let c1 be set ;
let c2 be sigma_Field_Subset of c1;
let c3 be sigma_Measure of c2;
let c4 be Element of COM c2,c3;
func MeasPart c4 -> non empty Subset-Family of a1 means :Def5: :: MEASURE3:def 5
for b1 being set holds
( b1 in a5 iff ( b1 in a2 & b1 c= a4 & a4 \ b1 is thin of a3 ) );
existence
ex b1 being non empty Subset-Family of c1 st
for b2 being set holds
( b2 in b1 iff ( b2 in c2 & b2 c= c4 & c4 \ b2 is thin of c3 ) )
proof end;
uniqueness
for b1, b2 being non empty Subset-Family of c1 st ( for b3 being set holds
( b3 in b1 iff ( b3 in c2 & b3 c= c4 & c4 \ b3 is thin of c3 ) ) ) & ( for b3 being set holds
( b3 in b2 iff ( b3 in c2 & b3 c= c4 & c4 \ b3 is thin of c3 ) ) ) holds
b1 = b2
proof end;
end;

:: deftheorem Def5 defines MeasPart MEASURE3:def 5 :
for b1 being set
for b2 being sigma_Field_Subset of b1
for b3 being sigma_Measure of b2
for b4 being Element of COM b2,b3
for b5 being non empty Subset-Family of b1 holds
( b5 = MeasPart b4 iff for b6 being set holds
( b6 in b5 iff ( b6 in b2 & b6 c= b4 & b4 \ b6 is thin of b3 ) ) );

theorem Th18: :: MEASURE3:18
for b1 being set
for b2 being sigma_Field_Subset of b1
for b3 being sigma_Measure of b2
for b4 being Function of NAT , COM b2,b3 ex b5 being Function of NAT ,b2 st
for b6 being Element of NAT holds b5 . b6 in MeasPart (b4 . b6)
proof end;

theorem Th19: :: MEASURE3:19
for b1 being set
for b2 being sigma_Field_Subset of b1
for b3 being sigma_Measure of b2
for b4 being Function of NAT , COM b2,b3
for b5 being Function of NAT ,b2 ex b6 being Function of NAT , bool b1 st
for b7 being Element of NAT holds b6 . b7 = (b4 . b7) \ (b5 . b7)
proof end;

theorem Th20: :: MEASURE3:20
for b1 being set
for b2 being sigma_Field_Subset of b1
for b3 being sigma_Measure of b2
for b4 being Function of NAT , bool b1 st ( for b5 being Element of NAT holds b4 . b5 is thin of b3 ) holds
ex b5 being Function of NAT ,b2 st
for b6 being Element of NAT holds
( b4 . b6 c= b5 . b6 & b3 . (b5 . b6) = 0. )
proof end;

Lemma18: for b1, b2, b3 being set st b3 c= b2 holds
b1 \ b3 = (b1 \ b2) \/ (b1 /\ (b2 \ b3))
proof end;

theorem Th21: :: MEASURE3:21
for b1 being set
for b2 being sigma_Field_Subset of b1
for b3 being sigma_Measure of b2
for b4 being non empty Subset-Family of b1 st ( for b5 being set holds
( b5 in b4 iff ex b6 being set st
( b6 in b2 & ex b7 being thin of b3 st b5 = b6 \/ b7 ) ) ) holds
b4 is sigma_Field_Subset of b1
proof end;

registration
let c1 be set ;
let c2 be sigma_Field_Subset of c1;
let c3 be sigma_Measure of c2;
cluster COM a2,a3 -> non empty compl-closed sigma_Field_Subset-like ;
coherence
( COM c2,c3 is sigma_Field_Subset-like & COM c2,c3 is compl-closed & not COM c2,c3 is empty )
proof end;
end;

theorem Th22: :: MEASURE3:22
for b1 being set
for b2 being sigma_Field_Subset of b1
for b3 being sigma_Measure of b2
for b4, b5 being set st b4 in b2 & b5 in b2 holds
for b6, b7 being thin of b3 st b4 \/ b6 = b5 \/ b7 holds
b3 . b4 = b3 . b5
proof end;

definition
let c1 be set ;
let c2 be sigma_Field_Subset of c1;
let c3 be sigma_Measure of c2;
func COM c3 -> sigma_Measure of COM a2,a3 means :Def6: :: MEASURE3:def 6
for b1 being set st b1 in a2 holds
for b2 being thin of a3 holds a4 . (b1 \/ b2) = a3 . b1;
existence
ex b1 being sigma_Measure of COM c2,c3 st
for b2 being set st b2 in c2 holds
for b3 being thin of c3 holds b1 . (b2 \/ b3) = c3 . b2
proof end;
uniqueness
for b1, b2 being sigma_Measure of COM c2,c3 st ( for b3 being set st b3 in c2 holds
for b4 being thin of c3 holds b1 . (b3 \/ b4) = c3 . b3 ) & ( for b3 being set st b3 in c2 holds
for b4 being thin of c3 holds b2 . (b3 \/ b4) = c3 . b3 ) holds
b1 = b2
proof end;
end;

:: deftheorem Def6 defines COM MEASURE3:def 6 :
for b1 being set
for b2 being sigma_Field_Subset of b1
for b3 being sigma_Measure of b2
for b4 being sigma_Measure of COM b2,b3 holds
( b4 = COM b3 iff for b5 being set st b5 in b2 holds
for b6 being thin of b3 holds b4 . (b5 \/ b6) = b3 . b5 );

theorem Th23: :: MEASURE3:23
for b1 being set
for b2 being sigma_Field_Subset of b1
for b3 being sigma_Measure of b2 holds COM b3 is_complete COM b2,b3
proof end;