let X be set ; :: thesis: for f being PartFunc of X,ExtREAL
for S being SigmaField of X
for F being sequence of S
for A being set
for r being Real st ( for n being Element of NAT holds F . n = A /\ (less_dom (f,(r + (1 / (n + 1))))) ) holds
A /\ (less_eq_dom (f,r)) = meet (rng F)

let f be PartFunc of X,ExtREAL; :: thesis: for S being SigmaField of X
for F being sequence of S
for A being set
for r being Real st ( for n being Element of NAT holds F . n = A /\ (less_dom (f,(r + (1 / (n + 1))))) ) holds
A /\ (less_eq_dom (f,r)) = meet (rng F)

let S be SigmaField of X; :: thesis: for F being sequence of S
for A being set
for r being Real st ( for n being Element of NAT holds F . n = A /\ (less_dom (f,(r + (1 / (n + 1))))) ) holds
A /\ (less_eq_dom (f,r)) = meet (rng F)

let F be sequence of S; :: thesis: for A being set
for r being Real st ( for n being Element of NAT holds F . n = A /\ (less_dom (f,(r + (1 / (n + 1))))) ) holds
A /\ (less_eq_dom (f,r)) = meet (rng F)

let A be set ; :: thesis: for r being Real st ( for n being Element of NAT holds F . n = A /\ (less_dom (f,(r + (1 / (n + 1))))) ) holds
A /\ (less_eq_dom (f,r)) = meet (rng F)

let r be Real; :: thesis: ( ( for n being Element of NAT holds F . n = A /\ (less_dom (f,(r + (1 / (n + 1))))) ) implies A /\ (less_eq_dom (f,r)) = meet (rng F) )
assume A1: for n being Element of NAT holds F . n = A /\ (less_dom (f,(r + (1 / (n + 1))))) ; :: thesis: A /\ (less_eq_dom (f,r)) = meet (rng F)
for x being object st x in A /\ (less_eq_dom (f,r)) holds
x in meet (rng F)
proof
let x be object ; :: thesis: ( x in A /\ (less_eq_dom (f,r)) implies x in meet (rng F) )
assume A2: x in A /\ (less_eq_dom (f,r)) ; :: thesis: x in meet (rng F)
then A3: x in A by XBOOLE_0:def 4;
A4: x in less_eq_dom (f,r) by A2, XBOOLE_0:def 4;
for Y being set st Y in rng F holds
x in Y
proof
let Y be set ; :: thesis: ( Y in rng F implies x in Y )
( Y in rng F implies x in Y )
proof
assume Y in rng F ; :: thesis: x in Y
then consider m being Element of NAT such that
m in dom F and
A5: Y = F . m by PARTFUN1:3;
A6: Y = A /\ (less_dom (f,(r + (1 / (m + 1))))) by A1, A5;
A7: x in dom f by A4, Def12;
reconsider x = x as Element of X by A2;
A8: f . x <= r by A4, Def12;
(m + 1) " > 0 ;
then 1 / (m + 1) > 0 by XCMPLX_1:215;
then r < r + (1 / (m + 1)) by XREAL_1:29;
then f . x < r + (1 / (m + 1)) by A8, XXREAL_0:2;
then x in less_dom (f,(r + (1 / (m + 1)))) by A7, Def11;
hence x in Y by A3, A6, XBOOLE_0:def 4; :: thesis: verum
end;
hence ( Y in rng F implies x in Y ) ; :: thesis: verum
end;
hence x in meet (rng F) by SETFAM_1:def 1; :: thesis: verum
end;
then A9: A /\ (less_eq_dom (f,r)) c= meet (rng F) ;
for x being object st x in meet (rng F) holds
x in A /\ (less_eq_dom (f,r))
proof
let x be object ; :: thesis: ( x in meet (rng F) implies x in A /\ (less_eq_dom (f,r)) )
assume A10: x in meet (rng F) ; :: thesis: x in A /\ (less_eq_dom (f,r))
A11: for m being Element of NAT holds
( x in A & x in dom f & f . x < r + (1 / (m + 1)) )
proof
let m be Element of NAT ; :: thesis: ( x in A & x in dom f & f . x < r + (1 / (m + 1)) )
m in NAT ;
then m in dom F by FUNCT_2:def 1;
then F . m in rng F by FUNCT_1:def 3;
then x in F . m by A10, SETFAM_1:def 1;
then A12: x in A /\ (less_dom (f,(r + (1 / (m + 1))))) by A1;
then x in less_dom (f,(r + (1 / (m + 1)))) by XBOOLE_0:def 4;
hence ( x in A & x in dom f & f . x < r + (1 / (m + 1)) ) by A12, Def11, XBOOLE_0:def 4; :: thesis: verum
end;
reconsider y = f . x as R_eal by XXREAL_0:def 1;
1 in NAT ;
then 1 in dom F by FUNCT_2:def 1;
then F . 1 in rng F by FUNCT_1:def 3;
then x in F . 1 by A10, SETFAM_1:def 1;
then x in A /\ (less_dom (f,(r + (1 / (1 + 1))))) by A1;
then reconsider x = x as Element of X ;
y <= r
proof
now :: thesis: y <= r
per cases ( y = -infty or not y = -infty ) ;
suppose not y = -infty ; :: thesis: y <= r
then A13: not y <= -infty by XXREAL_0:6;
y < r + (1 / (1 + 1)) by A11;
then reconsider y1 = y as Element of REAL by A13, XXREAL_0:48;
for m being Element of NAT holds y1 - (1 / (m + 1)) <= r
proof
let m be Element of NAT ; :: thesis: y1 - (1 / (m + 1)) <= r
y1 < r + (1 / (m + 1)) by A11;
hence y1 - (1 / (m + 1)) <= r by XREAL_1:20; :: thesis: verum
end;
hence y <= r by Th11; :: thesis: verum
end;
end;
end;
hence y <= r ; :: thesis: verum
end;
then x in less_eq_dom (f,r) by A11, Def12;
hence x in A /\ (less_eq_dom (f,r)) by A11, XBOOLE_0:def 4; :: thesis: verum
end;
then meet (rng F) c= A /\ (less_eq_dom (f,r)) ;
hence A /\ (less_eq_dom (f,r)) = meet (rng F) by A9, XBOOLE_0:def 10; :: thesis: verum