let n be non zero Nat; :: thesis: for A being Subset of (CarProduct ((Seg n) --> RNS_Real)) st A is open holds
A in Prod_Field (L-Field n)

let A be Subset of (CarProduct ((Seg n) --> RNS_Real)); :: thesis: ( A is open implies A in Prod_Field (L-Field n) )
set S = (Seg n) --> RNS_Real;
set X = (Seg n) --> REAL;
assume A1: A is open ; :: thesis: A in Prod_Field (L-Field n)
A2: the carrier of (CarProduct ((Seg n) --> RNS_Real)) = CarProduct ((Seg n) --> REAL) by Th42;
per cases ( A = {} or A <> {} ) ;
suppose A = {} ; :: thesis: A in Prod_Field (L-Field n)
end;
suppose A3: A <> {} ; :: thesis: A in Prod_Field (L-Field n)
per cases ( ex a being n -element FinSequence of REAL st
( PtCarProduct a in A & ( for Rx being real-membered set holds
( Rx is empty or not Rx is bounded_above or not Rx = { r where r is Real : ( 0 < r & ex D being non-empty n -element FinSequence st
( ( for i being Nat st i in Seg n holds
D . i = ].((a . i) - r),((a . i) + r).[ ) & CarProduct D c= A ) )
}
) ) ) or for a being n -element FinSequence of REAL st PtCarProduct a in A holds
ex Rx being real-membered set st
( not Rx is empty & Rx is bounded_above & Rx = { r where r is Real : ( 0 < r & ex D being non-empty n -element FinSequence st
( ( for i being Nat st i in Seg n holds
D . i = ].((a . i) - r),((a . i) + r).[ ) & CarProduct D c= A ) )
}
) )
;
suppose ex a being n -element FinSequence of REAL st
( PtCarProduct a in A & ( for Rx being real-membered set holds
( Rx is empty or not Rx is bounded_above or not Rx = { r where r is Real : ( 0 < r & ex D being non-empty n -element FinSequence st
( ( for i being Nat st i in Seg n holds
D . i = ].((a . i) - r),((a . i) + r).[ ) & CarProduct D c= A ) )
}
) ) ) ; :: thesis: A in Prod_Field (L-Field n)
then consider a being n -element FinSequence of REAL such that
A4: ( PtCarProduct a in A & ( for Rx being real-membered set holds
( Rx is empty or not Rx is bounded_above or not Rx = { r where r is Real : ( 0 < r & ex D being non-empty n -element FinSequence st
( ( for i being Nat st i in Seg n holds
D . i = ].((a . i) - r),((a . i) + r).[ ) & CarProduct D c= A ) )
}
) ) ) ;
set Rx = { r where r is Real : ( 0 < r & ex D being non-empty n -element FinSequence st
( ( for i being Nat st i in Seg n holds
D . i = ].((a . i) - r),((a . i) + r).[ ) & CarProduct D c= A ) )
}
;
now :: thesis: for z being object st z in { r where r is Real : ( 0 < r & ex D being non-empty n -element FinSequence st
( ( for i being Nat st i in Seg n holds
D . i = ].((a . i) - r),((a . i) + r).[ ) & CarProduct D c= A ) )
}
holds
z is real
let z be object ; :: thesis: ( z in { r where r is Real : ( 0 < r & ex D being non-empty n -element FinSequence st
( ( for i being Nat st i in Seg n holds
D . i = ].((a . i) - r),((a . i) + r).[ ) & CarProduct D c= A ) )
}
implies z is real )

assume z in { r where r is Real : ( 0 < r & ex D being non-empty n -element FinSequence st
( ( for i being Nat st i in Seg n holds
D . i = ].((a . i) - r),((a . i) + r).[ ) & CarProduct D c= A ) )
}
; :: thesis: z is real
then ex r being Real st
( z = r & 0 < r & ex D being non-empty n -element FinSequence st
( ( for i being Nat st i in Seg n holds
D . i = ].((a . i) - r),((a . i) + r).[ ) & CarProduct D c= A ) ) ;
hence z is real ; :: thesis: verum
end;
then reconsider Rx = { r where r is Real : ( 0 < r & ex D being non-empty n -element FinSequence st
( ( for i being Nat st i in Seg n holds
D . i = ].((a . i) - r),((a . i) + r).[ ) & CarProduct D c= A ) )
}
as real-membered set by MEMBERED:def 3;
reconsider x = PtCarProduct a as Point of (CarProduct ((Seg n) --> RNS_Real)) by A4;
consider r0 being Real such that
A5: ( r0 > 0 & Ball (x,r0) c= A ) by A1, A4, NDIFF_8:20;
consider s being Real, aa being n -element FinSequence of REAL , D being non-empty n -element FinSequence such that
A6: ( 0 < s & s < r0 & x = PtCarProduct aa & ( for i being Nat st i in Seg n holds
D . i = ].((aa . i) - s),((aa . i) + s).[ ) & CarProduct D c= Ball (x,r0) ) by A5, Th65;
A7: aa = a by Th5, A6;
CarProduct D c= A by A6, A5;
then s in Rx by A6, A7;
then A8: not Rx is bounded_above by A4;
now :: thesis: for z being object st z in CarProduct ((Seg n) --> REAL) holds
z in A
let z be object ; :: thesis: ( z in CarProduct ((Seg n) --> REAL) implies z in A )
assume z in CarProduct ((Seg n) --> REAL) ; :: thesis: z in A
then consider x being n -element FinSequence of REAL such that
A9: z = PtCarProduct x by Th45;
consider r being Real such that
A10: ( 0 < r & ( for i being Nat st i in Seg n holds
x . i in ].((a . i) - r),((a . i) + r).[ ) ) by Lm10;
r is not UpperBound of Rx by A8, XXREAL_2:def 10;
then consider s being ExtReal such that
A11: ( s in Rx & r < s ) by XXREAL_2:def 1;
reconsider s = s as Real by A11;
consider s0 being Real such that
A12: ( s = s0 & 0 < s0 & ex D being non-empty n -element FinSequence st
( ( for i being Nat st i in Seg n holds
D . i = ].((a . i) - s0),((a . i) + s0).[ ) & CarProduct D c= A ) ) by A11;
consider D being non-empty n -element FinSequence such that
A13: ( ( for i being Nat st i in Seg n holds
D . i = ].((a . i) - s0),((a . i) + s0).[ ) & CarProduct D c= A ) by A12;
now :: thesis: for i being Nat st i in Seg n holds
x . i in D . i
let i be Nat; :: thesis: ( i in Seg n implies x . i in D . i )
assume A14: i in Seg n ; :: thesis: x . i in D . i
].((a . i) - r),((a . i) + r).[ c= ].((a . i) - s),((a . i) + s).[ by A11, INTEGRA6:2;
then x . i in ].((a . i) - s),((a . i) + s).[ by A10, A14;
hence x . i in D . i by A14, A13, A12; :: thesis: verum
end;
hence z in A by A13, A9, Th33; :: thesis: verum
end;
then CarProduct ((Seg n) --> REAL) c= A ;
then A = CarProduct ((Seg n) --> REAL) by A2;
hence A in Prod_Field (L-Field n) by Th40; :: thesis: verum
end;
suppose for a being n -element FinSequence of REAL st PtCarProduct a in A holds
ex Rx being real-membered set st
( not Rx is empty & Rx is bounded_above & Rx = { r where r is Real : ( 0 < r & ex D being non-empty n -element FinSequence st
( ( for i being Nat st i in Seg n holds
D . i = ].((a . i) - r),((a . i) + r).[ ) & CarProduct D c= A ) )
}
) ; :: thesis: A in Prod_Field (L-Field n)
then consider F being Function of A,REAL such that
A15: for a being n -element FinSequence of REAL st PtCarProduct a in A holds
ex Rx being real-membered set st
( not Rx is empty & Rx is bounded_above & Rx = { r where r is Real : ( 0 < r & ex D being non-empty n -element FinSequence st
( ( for i being Nat st i in Seg n holds
D . i = ].((a . i) - r),((a . i) + r).[ ) & CarProduct D c= A ) )
}
& F . (PtCarProduct a) = (upper_bound Rx) / 2 ) by A1, Th66;
A /\ (CarProduct ((Seg n) --> RAT)) <> {}
proof
consider z being object such that
A16: z in A by A3, XBOOLE_0:def 1;
reconsider u = z as Point of (CarProduct ((Seg n) --> RNS_Real)) by A16;
consider e0 being Real such that
A17: ( e0 > 0 & Ball (u,e0) c= A ) by A16, A1, NDIFF_8:20;
set e = e0 / 4;
( 0 < e0 / 4 & e0 / 4 < e0 ) by A17, XREAL_1:223, XREAL_1:224;
then A18: Ball (u,(e0 / 4)) c= Ball (u,e0) by NDIFF_8:15;
then A19: ( 0 < e0 / 4 & Ball (u,(e0 / 4)) c= A ) by A17, XREAL_1:224;
u in the carrier of (CarProduct ((Seg n) --> RNS_Real)) ;
then u in CarProduct ((Seg n) --> REAL) by Th42;
then consider xx being n -element FinSequence of REAL such that
A20: u = PtCarProduct xx by Th45;
reconsider ee = ((e0 / 4) / 2) / n as Real ;
A21: ( 0 < (e0 / 4) / 2 & (e0 / 4) / 2 < e0 / 4 ) by A19, XREAL_1:215, XREAL_1:216;
then consider qxx being n -element FinSequence of RAT such that
A22: for i being Nat st i in Seg n holds
qxx . i in ].((xx . i) - ee),((xx . i) + ee).[ by Lm8, XREAL_1:139;
A23: PtCarProduct qxx in CarProduct ((Seg n) --> RAT) by Th46;
then PtCarProduct qxx in CarProduct ((Seg n) --> REAL) by Th49, TARSKI:def 3;
then reconsider v = PtCarProduct qxx as Point of (CarProduct ((Seg n) --> RNS_Real)) by Th42;
rng qxx c= REAL ;
then A24: qxx is n -element FinSequence of REAL by FINSEQ_1:def 4;
now :: thesis: for i being Nat st i in Seg n holds
|.((qxx . i) - (xx . i)).| <= ee
let i be Nat; :: thesis: ( i in Seg n implies |.((qxx . i) - (xx . i)).| <= ee )
assume i in Seg n ; :: thesis: |.((qxx . i) - (xx . i)).| <= ee
then qxx . i in ].((xx . i) - ee),((xx . i) + ee).[ by A22;
hence |.((qxx . i) - (xx . i)).| <= ee by RCOMP_1:1; :: thesis: verum
end;
then ||.(v - u).|| <= (e0 / 4) / 2 by A24, A17, A20, Lm11;
then ||.(u - v).|| <= (e0 / 4) / 2 by NORMSP_1:7;
then ||.(u - v).|| < e0 / 4 by XXREAL_0:2, A21;
then v in Ball (u,(e0 / 4)) ;
then PtCarProduct qxx in A by A18, A17;
hence A /\ (CarProduct ((Seg n) --> RAT)) <> {} by A23, XBOOLE_0:def 4; :: thesis: verum
end;
then consider p being sequence of (CarProduct ((Seg n) --> REAL)) such that
A25: rng p = A /\ (CarProduct ((Seg n) --> RAT)) by A2, Th60;
A26: for a being n -element FinSequence of REAL st PtCarProduct a in A holds
ex r being Real st
( 0 < r & r = F . (PtCarProduct a) & ex Da being non-empty n -element FinSequence st
( ( for i being Nat st i in Seg n holds
Da . i = ].((a . i) - r),((a . i) + r).[ ) & CarProduct Da c= A ) )
proof
let a be n -element FinSequence of REAL ; :: thesis: ( PtCarProduct a in A implies ex r being Real st
( 0 < r & r = F . (PtCarProduct a) & ex Da being non-empty n -element FinSequence st
( ( for i being Nat st i in Seg n holds
Da . i = ].((a . i) - r),((a . i) + r).[ ) & CarProduct Da c= A ) ) )

assume PtCarProduct a in A ; :: thesis: ex r being Real st
( 0 < r & r = F . (PtCarProduct a) & ex Da being non-empty n -element FinSequence st
( ( for i being Nat st i in Seg n holds
Da . i = ].((a . i) - r),((a . i) + r).[ ) & CarProduct Da c= A ) )

then consider Rx being real-membered set such that
A27: ( not Rx is empty & Rx is bounded_above & Rx = { r where r is Real : ( 0 < r & ex D being non-empty n -element FinSequence st
( ( for i being Nat st i in Seg n holds
D . i = ].((a . i) - r),((a . i) + r).[ ) & CarProduct D c= A ) )
}
& F . (PtCarProduct a) = (upper_bound Rx) / 2 ) by A15;
reconsider r0 = F . (PtCarProduct a) as Real ;
take r0 ; :: thesis: ( 0 < r0 & r0 = F . (PtCarProduct a) & ex Da being non-empty n -element FinSequence st
( ( for i being Nat st i in Seg n holds
Da . i = ].((a . i) - r0),((a . i) + r0).[ ) & CarProduct Da c= A ) )

consider r1 being object such that
A28: r1 in Rx by A27;
reconsider r1 = r1 as Real by A28;
A29: ex r being Real st
( r1 = r & 0 < r & ex D being non-empty n -element FinSequence st
( ( for i being Nat st i in Seg n holds
D . i = ].((a . i) - r),((a . i) + r).[ ) & CarProduct D c= A ) ) by A27, A28;
A30: r1 <= upper_bound Rx by SEQ_4:def 1, A27, A28;
then ( 0 < r0 & r0 < upper_bound Rx ) by A27, A29, XREAL_1:215, XREAL_1:216;
then consider s being Real such that
A31: ( s in Rx & (upper_bound Rx) - r0 < s ) by A27, SEQ_4:def 1;
consider r being Real such that
A32: ( s = r & 0 < r & ex D being non-empty n -element FinSequence st
( ( for i being Nat st i in Seg n holds
D . i = ].((a . i) - r),((a . i) + r).[ ) & CarProduct D c= A ) ) by A31, A27;
consider D being non-empty n -element FinSequence such that
A33: ( ( for i being Nat st i in Seg n holds
D . i = ].((a . i) - r),((a . i) + r).[ ) & CarProduct D c= A ) by A32;
consider Da being non-empty n -element FinSequence such that
A34: for i being Nat st i in Seg n holds
Da . i = ].((a . i) - r0),((a . i) + r0).[ by Lm7, A30, A27, A29, XREAL_1:215;
for i being Nat st i in Seg n holds
Da . i c= D . i
proof
let i be Nat; :: thesis: ( i in Seg n implies Da . i c= D . i )
assume A35: i in Seg n ; :: thesis: Da . i c= D . i
then A36: Da . i = ].((a . i) - r0),((a . i) + r0).[ by A34;
D . i = ].((a . i) - r),((a . i) + r).[ by A33, A35;
hence Da . i c= D . i by A31, A27, A36, A32, INTEGRA6:2; :: thesis: verum
end;
then CarProduct Da c= CarProduct D by Th48;
then CarProduct Da c= A by A33;
hence ( 0 < r0 & r0 = F . (PtCarProduct a) & ex Da being non-empty n -element FinSequence st
( ( for i being Nat st i in Seg n holds
Da . i = ].((a . i) - r0),((a . i) + r0).[ ) & CarProduct Da c= A ) ) by A30, A34, A27, A29, XREAL_1:215; :: thesis: verum
end;
defpred S1[ object , object ] means ex a being n -element FinSequence of REAL ex r being Real ex D being non-empty n -element FinSequence st
( p . $1 = PtCarProduct a & a is n -element FinSequence of RAT & 0 < r & r = F . (PtCarProduct a) & $2 = CarProduct D & ( for i being Nat st i in Seg n holds
D . i = ].((a . i) - r),((a . i) + r).[ ) & CarProduct D c= A );
A37: for i being object st i in NAT holds
ex y being object st
( y in bool (CarProduct ((Seg n) --> REAL)) & S1[i,y] )
proof
let i be object ; :: thesis: ( i in NAT implies ex y being object st
( y in bool (CarProduct ((Seg n) --> REAL)) & S1[i,y] ) )

assume i in NAT ; :: thesis: ex y being object st
( y in bool (CarProduct ((Seg n) --> REAL)) & S1[i,y] )

then i in dom p by FUNCT_2:def 1;
then p . i in rng p by FUNCT_1:3;
then A38: ( p . i in A & p . i in CarProduct ((Seg n) --> RAT) ) by A25, XBOOLE_0:def 4;
then consider a being n -element FinSequence of RAT such that
A39: p . i = PtCarProduct a by Th46;
rng a c= REAL ;
then reconsider a = a as n -element FinSequence of REAL by FINSEQ_1:def 4;
consider r being Real such that
A40: ( 0 < r & r = F . (PtCarProduct a) & ex Da being non-empty n -element FinSequence st
( ( for i being Nat st i in Seg n holds
Da . i = ].((a . i) - r),((a . i) + r).[ ) & CarProduct Da c= A ) ) by A26, A38, A39;
consider Da being non-empty n -element FinSequence such that
A41: ( ( for i being Nat st i in Seg n holds
Da . i = ].((a . i) - r),((a . i) + r).[ ) & CarProduct Da c= A ) by A40;
set E = CarProduct Da;
take y = CarProduct Da; :: thesis: ( y in bool (CarProduct ((Seg n) --> REAL)) & S1[i,y] )
for i being Nat st i in Seg n holds
Da . i c= ((Seg n) --> REAL) . i
proof
let i be Nat; :: thesis: ( i in Seg n implies Da . i c= ((Seg n) --> REAL) . i )
assume A42: i in Seg n ; :: thesis: Da . i c= ((Seg n) --> REAL) . i
then A43: Da . i = ].((a . i) - r),((a . i) + r).[ by A41;
((Seg n) --> REAL) . i = REAL by A42, FUNCOP_1:7;
hence Da . i c= ((Seg n) --> REAL) . i by A43; :: thesis: verum
end;
then CarProduct Da c= CarProduct ((Seg n) --> REAL) by Th48;
hence y in bool (CarProduct ((Seg n) --> REAL)) ; :: thesis: S1[i,y]
thus S1[i,y] by A39, A40, A41; :: thesis: verum
end;
consider B being Function of NAT,(bool (CarProduct ((Seg n) --> REAL))) such that
A44: for i being object st i in NAT holds
S1[i,B . i] from FUNCT_2:sch 1(A37);
reconsider B = B as SetSequence of (CarProduct ((Seg n) --> REAL)) ;
now :: thesis: for z being object st z in rng B holds
z in Prod_Field (L-Field n)
let z be object ; :: thesis: ( z in rng B implies z in Prod_Field (L-Field n) )
assume z in rng B ; :: thesis: z in Prod_Field (L-Field n)
then consider i being object such that
A45: ( i in dom B & z = B . i ) by FUNCT_1:def 3;
reconsider i = i as Nat by A45;
consider a being n -element FinSequence of REAL , r being Real, D being non-empty n -element FinSequence such that
A46: ( p . i = PtCarProduct a & a is n -element FinSequence of RAT & 0 < r & r = F . (PtCarProduct a) & B . i = CarProduct D & ( for j being Nat st j in Seg n holds
D . j = ].((a . j) - r),((a . j) + r).[ ) & CarProduct D c= A ) by A44, ORDINAL1:def 12;
for j being Nat st j in Seg n holds
D . j is Element of L-Field
proof
let j be Nat; :: thesis: ( j in Seg n implies D . j is Element of L-Field )
assume j in Seg n ; :: thesis: D . j is Element of L-Field
then D . j = ].((a . j) - r),((a . j) + r).[ by A46;
hence D . j is Element of L-Field by MEASUR10:5, MEASUR12:75; :: thesis: verum
end;
then CarProduct D is Element of Prod_Field (L-Field n) by Th39;
hence z in Prod_Field (L-Field n) by A45, A46; :: thesis: verum
end;
then rng B c= Prod_Field (L-Field n) ;
then reconsider B = B as SetSequence of Prod_Field (L-Field n) by RELAT_1:def 19;
now :: thesis: for z being object st z in union (rng B) holds
z in A
let z be object ; :: thesis: ( z in union (rng B) implies z in A )
assume z in union (rng B) ; :: thesis: z in A
then consider Y being set such that
A47: ( z in Y & Y in rng B ) by TARSKI:def 4;
consider i being object such that
A48: ( i in dom B & Y = B . i ) by A47, FUNCT_1:def 3;
reconsider i = i as Nat by A48;
ex a being n -element FinSequence of REAL ex r being Real ex D being non-empty n -element FinSequence st
( p . i = PtCarProduct a & a is n -element FinSequence of RAT & 0 < r & r = F . (PtCarProduct a) & B . i = CarProduct D & ( for j being Nat st j in Seg n holds
D . j = ].((a . j) - r),((a . j) + r).[ ) & CarProduct D c= A ) by A44, ORDINAL1:def 12;
hence z in A by A47, A48; :: thesis: verum
end;
then A49: union (rng B) c= A ;
now :: thesis: for z being object st z in A holds
z in union (rng B)
let z be object ; :: thesis: ( z in A implies z in union (rng B) )
assume A50: z in A ; :: thesis: z in union (rng B)
then reconsider u = z as Point of (CarProduct ((Seg n) --> RNS_Real)) ;
consider e0 being Real such that
A51: ( e0 > 0 & Ball (u,e0) c= A ) by A50, A1, NDIFF_8:20;
reconsider e = e0 / 4 as Real ;
A52: ( 0 < e & e < e0 ) by A51, XREAL_1:223, XREAL_1:224;
then A53: Ball (u,e) c= Ball (u,e0) by NDIFF_8:15;
u in the carrier of (CarProduct ((Seg n) --> RNS_Real)) ;
then u in CarProduct ((Seg n) --> REAL) by Th42;
then consider xx being n -element FinSequence of REAL such that
A54: u = PtCarProduct xx by Th45;
reconsider d0 = (e / 2) / n as Real ;
reconsider dd = d0 / 2 as Real ;
A55: ( 0 < e / 2 & e / 2 < e ) by A52, XREAL_1:215, XREAL_1:216;
then A56: ( 0 < d0 & d0 <= (e / 2) / 1 ) by XREAL_1:139, XREAL_1:118, NAT_1:14;
A57: ( 0 < (e / 2) / 2 & (e / 2) / 2 < e / 2 ) by A55, XREAL_1:215, XREAL_1:216;
A58: d0 / 2 = ((e / 2) / 2) / n by XCMPLX_1:48;
A59: ( 0 < d0 / 2 & d0 / 2 < d0 ) by A56, XREAL_1:215, XREAL_1:216;
consider qxx being n -element FinSequence of RAT such that
A60: for i being Nat st i in Seg n holds
qxx . i in ].((xx . i) - dd),((xx . i) + dd).[ by A56, Lm8, XREAL_1:215;
A61: for i being Nat st i in Seg n holds
|.((qxx . i) - (xx . i)).| <= d0 / 2
proof
let i be Nat; :: thesis: ( i in Seg n implies |.((qxx . i) - (xx . i)).| <= d0 / 2 )
assume i in Seg n ; :: thesis: |.((qxx . i) - (xx . i)).| <= d0 / 2
then qxx . i in ].((xx . i) - dd),((xx . i) + dd).[ by A60;
hence |.((qxx . i) - (xx . i)).| <= d0 / 2 by RCOMP_1:1; :: thesis: verum
end;
PtCarProduct qxx in CarProduct ((Seg n) --> RAT) by Th46;
then A62: PtCarProduct qxx in CarProduct ((Seg n) --> REAL) by Th49, TARSKI:def 3;
A63: PtCarProduct qxx in A
proof
reconsider v = PtCarProduct qxx as Point of (CarProduct ((Seg n) --> RNS_Real)) by A62, Th42;
rng qxx c= REAL ;
then qxx is n -element FinSequence of REAL by FINSEQ_1:def 4;
then ||.(v - u).|| <= (e / 2) / 2 by A58, A54, A61, A51, Lm11;
then ||.(u - v).|| <= (e / 2) / 2 by NORMSP_1:7;
then ||.(u - v).|| <= e / 2 by XXREAL_0:2, A57;
then ||.(u - v).|| < e by XXREAL_0:2, A55;
then v in Ball (u,e) ;
hence PtCarProduct qxx in A by A53, A51; :: thesis: verum
end;
PtCarProduct qxx in CarProduct ((Seg n) --> RAT) by Th46;
then PtCarProduct qxx in rng p by A25, A63, XBOOLE_0:def 4;
then consider k being object such that
A64: ( k in dom p & p . k = PtCarProduct qxx ) by FUNCT_1:def 3;
reconsider k = k as Nat by A64;
rng qxx c= REAL ;
then qxx is n -element FinSequence of REAL by FINSEQ_1:def 4;
then consider Rx being real-membered set such that
A65: ( not Rx is empty & Rx is bounded_above & Rx = { r where r is Real : ( 0 < r & ex D being non-empty n -element FinSequence st
( ( for i being Nat st i in Seg n holds
D . i = ].((qxx . i) - r),((qxx . i) + r).[ ) & CarProduct D c= A ) )
}
& F . (PtCarProduct qxx) = (upper_bound Rx) / 2 ) by A63, A15;
consider ak being n -element FinSequence of REAL , rk being Real, Dk being non-empty n -element FinSequence such that
A66: ( p . k = PtCarProduct ak & ak is n -element FinSequence of RAT & 0 < rk & rk = F . (PtCarProduct ak) & B . k = CarProduct Dk & ( for j being Nat st j in Seg n holds
Dk . j = ].((ak . j) - rk),((ak . j) + rk).[ ) & CarProduct Dk c= A ) by A44, ORDINAL1:def 12;
A67: ak = qxx by A64, A66, Th5;
consider D1 being non-empty n -element FinSequence such that
A68: for i being Nat st i in Seg n holds
D1 . i = ].((ak . i) - d0),((ak . i) + d0).[ by A55, Lm7, XREAL_1:139;
reconsider m = n - 1 as Nat by NAT_1:14, NAT_1:21;
now :: thesis: for z being object st z in CarProduct D1 holds
z in A
let z be object ; :: thesis: ( z in CarProduct D1 implies z in A )
assume A69: z in CarProduct D1 ; :: thesis: z in A
for i being Nat st i in Seg n holds
D1 . i c= ((Seg n) --> REAL) . i
proof
let i be Nat; :: thesis: ( i in Seg n implies D1 . i c= ((Seg n) --> REAL) . i )
assume A70: i in Seg n ; :: thesis: D1 . i c= ((Seg n) --> REAL) . i
then A71: D1 . i = ].((ak . i) - d0),((ak . i) + d0).[ by A68;
((Seg n) --> REAL) . i = REAL by A70, FUNCOP_1:7;
hence D1 . i c= ((Seg n) --> REAL) . i by A71; :: thesis: verum
end;
then A72: CarProduct D1 c= CarProduct ((Seg n) --> REAL) by Th48;
then consider pz being n -element FinSequence of REAL such that
A73: z = PtCarProduct pz by A69, Th45;
A74: for i being Nat st i in Seg n holds
pz . i in ].((ak . i) - d0),((ak . i) + d0).[
proof
let i be Nat; :: thesis: ( i in Seg n implies pz . i in ].((ak . i) - d0),((ak . i) + d0).[ )
assume A75: i in Seg n ; :: thesis: pz . i in ].((ak . i) - d0),((ak . i) + d0).[
then pz . i in D1 . i by A73, A69, Th33;
hence pz . i in ].((ak . i) - d0),((ak . i) + d0).[ by A75, A68; :: thesis: verum
end;
reconsider v = z as Point of (CarProduct ((Seg n) --> RNS_Real)) by A69, A72, Th42;
now :: thesis: for i being Nat st i in Seg n holds
|.((xx . i) - (pz . i)).| <= e / n
let i be Nat; :: thesis: ( i in Seg n implies |.((xx . i) - (pz . i)).| <= e / n )
assume A76: i in Seg n ; :: thesis: |.((xx . i) - (pz . i)).| <= e / n
then pz . i in ].((ak . i) - d0),((ak . i) + d0).[ by A74;
then |.((pz . i) - (ak . i)).| < d0 by RCOMP_1:1;
then A77: |.((ak . i) - (pz . i)).| < d0 by COMPLEX1:60;
A78: |.((xx . i) - (pz . i)).| <= |.((xx . i) - (ak . i)).| + |.((ak . i) - (pz . i)).| by COMPLEX1:63;
|.((ak . i) - (xx . i)).| <= d0 / 2 by A76, A61, A67;
then |.((ak . i) - (xx . i)).| <= d0 by A59, XXREAL_0:2;
then |.((xx . i) - (ak . i)).| <= d0 by COMPLEX1:60;
then A79: |.((xx . i) - (ak . i)).| + |.((ak . i) - (pz . i)).| <= d0 + d0 by A77, XREAL_1:7;
d0 + d0 = ((e / 2) + (e / 2)) / n by XCMPLX_1:62;
hence |.((xx . i) - (pz . i)).| <= e / n by A78, A79, XXREAL_0:2; :: thesis: verum
end;
then ||.(u - v).|| <= e by A54, A51, A73, Lm11;
then ||.(u - v).|| < e0 by A52, XXREAL_0:2;
then v in Ball (u,e0) ;
hence z in A by A51; :: thesis: verum
end;
then CarProduct D1 c= A ;
then d0 in Rx by A65, A67, A56, A68;
then A80: d0 <= upper_bound Rx by A65, SEQ_4:def 1;
now :: thesis: for i being Nat st i in Seg n holds
xx . i in Dk . i
let i be Nat; :: thesis: ( i in Seg n implies xx . i in Dk . i )
assume A81: i in Seg n ; :: thesis: xx . i in Dk . i
then ak . i in ].((xx . i) - (d0 / 2)),((xx . i) + (d0 / 2)).[ by A67, A60;
then |.((ak . i) - (xx . i)).| < d0 / 2 by RCOMP_1:1;
then A82: |.((xx . i) - (ak . i)).| < d0 / 2 by COMPLEX1:60;
].((ak . i) - (d0 / 2)),((ak . i) + (d0 / 2)).[ c= ].((ak . i) - rk),((ak . i) + rk).[ by A80, A65, A66, A64, XREAL_1:72, INTEGRA6:2;
then xx . i in ].((ak . i) - rk),((ak . i) + rk).[ by A82, RCOMP_1:1;
hence xx . i in Dk . i by A66, A81; :: thesis: verum
end;
then A83: u in B . k by A66, A54, Th61;
k in NAT by ORDINAL1:def 12;
then k in dom B by FUNCT_2:def 1;
then B . k in rng B by FUNCT_1:3;
hence z in union (rng B) by A83, TARSKI:def 4; :: thesis: verum
end;
then A c= union (rng B) ;
then Union B = A by A49, CARD_3:def 4;
hence A in Prod_Field (L-Field n) by PROB_1:17; :: thesis: verum
end;
end;
end;
end;