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

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

let F be Function of NAT,S; :: thesis: for f being PartFunc of X,ExtREAL
for A being set
for r being Real st ( for n being Element of NAT holds F . n = A /\ (great_dom (f,(R_EAL (r - (1 / (n + 1)))))) ) holds
A /\ (great_eq_dom (f,(R_EAL r))) = meet (rng F)

let f be PartFunc of X,ExtREAL; :: thesis: for A being set
for r being Real st ( for n being Element of NAT holds F . n = A /\ (great_dom (f,(R_EAL (r - (1 / (n + 1)))))) ) holds
A /\ (great_eq_dom (f,(R_EAL r))) = meet (rng F)

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

let r be Real; :: thesis: ( ( for n being Element of NAT holds F . n = A /\ (great_dom (f,(R_EAL (r - (1 / (n + 1)))))) ) implies A /\ (great_eq_dom (f,(R_EAL r))) = meet (rng F) )
assume A1: for n being Element of NAT holds F . n = A /\ (great_dom (f,(R_EAL (r - (1 / (n + 1)))))) ; :: thesis: A /\ (great_eq_dom (f,(R_EAL r))) = meet (rng F)
for x being set st x in A /\ (great_eq_dom (f,(R_EAL r))) holds
x in meet (rng F)
proof
let x be set ; :: thesis: ( x in A /\ (great_eq_dom (f,(R_EAL r))) implies x in meet (rng F) )
assume A2: x in A /\ (great_eq_dom (f,(R_EAL r))) ; :: thesis: x in meet (rng F)
then A3: x in A by XBOOLE_0:def 4;
A4: x in great_eq_dom (f,(R_EAL 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 /\ (great_dom (f,(R_EAL (r - (1 / (m + 1)))))) by A1, A5;
A7: x in dom f by A4, Def15;
reconsider x = x as Element of X by A2;
A8: R_EAL r <= f . x by A4, Def15;
(m + 1) " > 0 ;
then 1 / (m + 1) > 0 by XCMPLX_1:215;
then r < r + (1 / (m + 1)) by XREAL_1:29;
then R_EAL (r - (1 / (m + 1))) < R_EAL r by XREAL_1:19;
then R_EAL (r - (1 / (m + 1))) < f . x by A8, XXREAL_0:2;
then x in great_dom (f,(R_EAL (r - (1 / (m + 1))))) by A7, Def14;
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 /\ (great_eq_dom (f,(R_EAL r))) c= meet (rng F) by TARSKI:def 3;
for x being set st x in meet (rng F) holds
x in A /\ (great_eq_dom (f,(R_EAL r)))
proof
let x be set ; :: thesis: ( x in meet (rng F) implies x in A /\ (great_eq_dom (f,(R_EAL r))) )
assume A10: x in meet (rng F) ; :: thesis: x in A /\ (great_eq_dom (f,(R_EAL r)))
A11: for m being Element of NAT holds
( x in A & x in dom f & R_EAL (r - (1 / (m + 1))) < f . x )
proof
let m be Element of NAT ; :: thesis: ( x in A & x in dom f & R_EAL (r - (1 / (m + 1))) < f . x )
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 /\ (great_dom (f,(R_EAL (r - (1 / (m + 1)))))) by A1;
then x in great_dom (f,(R_EAL (r - (1 / (m + 1))))) by XBOOLE_0:def 4;
hence ( x in A & x in dom f & R_EAL (r - (1 / (m + 1))) < f . x ) by A12, Def14, XBOOLE_0:def 4; :: thesis: verum
end;
reconsider y = f . x as R_eal ;
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 /\ (great_dom (f,(R_EAL (r - (1 / (1 + 1)))))) by A1;
then reconsider x = x as Element of X ;
R_EAL r <= y
proof
now
per cases ( y = +infty or not y = +infty ) ;
suppose not y = +infty ; :: thesis: R_EAL r <= y
then A13: not +infty <= y by XXREAL_0:4;
R_EAL (r - (1 / (1 + 1))) < y by A11;
then reconsider y1 = y as Real by A13, XXREAL_0:48;
for m being Element of NAT holds r - (1 / (m + 1)) <= y1
proof
let m be Element of NAT ; :: thesis: r - (1 / (m + 1)) <= y1
R_EAL (r - (1 / (m + 1))) < R_EAL y1 by A11;
hence r - (1 / (m + 1)) <= y1 ; :: thesis: verum
end;
hence R_EAL r <= y by Th14; :: thesis: verum
end;
end;
end;
hence R_EAL r <= y ; :: thesis: verum
end;
then x in great_eq_dom (f,(R_EAL r)) by A11, Def15;
hence x in A /\ (great_eq_dom (f,(R_EAL r))) by A11, XBOOLE_0:def 4; :: thesis: verum
end;
then meet (rng F) c= A /\ (great_eq_dom (f,(R_EAL r))) by TARSKI:def 3;
hence A /\ (great_eq_dom (f,(R_EAL r))) = meet (rng F) by A9, XBOOLE_0:def 10; :: thesis: verum