let n be non zero Nat; :: thesis: 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)); :: thesis: ( 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 ) )
}
) ) ) ; :: thesis: 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] )
proof
let x be object ; :: thesis: ( x in A implies ex y being object st
( y in REAL & S1[x,y] ) )

assume A3: x in A ; :: thesis: ex y being object st
( y in REAL & S1[x,y] )

then x in the carrier of (CarProduct ((Seg n) --> RNS_Real)) ;
then x in CarProduct ((Seg n) --> REAL) by Th42;
then consider a being n -element FinSequence of REAL such that
A4: x = PtCarProduct a by Th45;
consider Rx being real-membered set such that
A5: ( 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 ) )
}
) by A1, A3, A4;
take y = (upper_bound Rx) / 2; :: thesis: ( y in REAL & S1[x,y] )
thus y in REAL by XREAL_0:def 1; :: thesis: S1[x,y]
thus S1[x,y] by A4, A5; :: thesis: verum
end;
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 ; :: thesis: 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 ) :: thesis: verum
proof
let x be n -element FinSequence of REAL ; :: thesis: ( PtCarProduct x in A implies 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 = ].((x . i) - r),((x . i) + r).[ ) & CarProduct D c= A ) )
}
& F . (PtCarProduct x) = (upper_bound Rx) / 2 ) )

assume PtCarProduct x in A ; :: thesis: 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 = ].((x . i) - r),((x . i) + r).[ ) & CarProduct D c= A ) )
}
& F . (PtCarProduct x) = (upper_bound Rx) / 2 )

then consider a being n -element FinSequence of REAL , Rx being real-membered set such that
A7: ( PtCarProduct x = 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 ) )
}
& F . (PtCarProduct x) = (upper_bound Rx) / 2 ) by A6;
x = a by A7, Th5;
hence 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 = ].((x . i) - r),((x . i) + r).[ ) & CarProduct D c= A ) )
}
& F . (PtCarProduct x) = (upper_bound Rx) / 2 ) by A7; :: thesis: verum
end;