let n be non zero Nat; for A being Subset of (CarProduct ((Seg n) --> RNS_Real)) st A is open & ( 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 ) ) } ) ) holds
ex F being Function of A,REAL st
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 )
let A be Subset of (CarProduct ((Seg n) --> RNS_Real)); ( A is open & ( 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 ) ) } ) ) implies ex F being Function of A,REAL st
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 ) )
assume A1:
( A is open & ( 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 ) ) } ) ) )
; ex F being Function of A,REAL st
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 )
defpred S1[ object , object ] means ex a being n -element FinSequence of REAL ex Rx being real-membered set st
( $1 = PtCarProduct a & 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 ) ) } & $2 = (upper_bound Rx) / 2 );
A2:
for x being object st x in A holds
ex y being object st
( y in REAL & S1[x,y] )
consider F being Function of A,REAL such that
A6:
for x being object st x in A holds
S1[x,F . x]
from FUNCT_2:sch 1(A2);
take
F
; 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 )
thus
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 )
verum