let n be non zero Nat; :: thesis: for a, x being n -element FinSequence of REAL ex r being Real st
( 0 < r & ( for i being Nat st i in Seg n holds
x . i in ].((a . i) - r),((a . i) + r).[ ) )

let a, x be n -element FinSequence of REAL ; :: thesis: ex r being Real st
( 0 < r & ( for i being Nat st i in Seg n holds
x . i in ].((a . i) - r),((a . i) + r).[ ) )

defpred S1[ Nat, object ] means ex r being Real st
( $2 = r & 0 < r & x . $1 in ].((a . $1) - r),((a . $1) + r).[ );
A1: for i being Nat st i in Seg n holds
ex x being object st S1[i,x]
proof
let i be Nat; :: thesis: ( i in Seg n implies ex x being object st S1[i,x] )
assume i in Seg n ; :: thesis: ex x being object st S1[i,x]
ex r1 being Real st
( 0 < r1 & x . i in ].((a . i) - r1),((a . i) + r1).[ ) by Lm9;
hence ex x being object st S1[i,x] ; :: thesis: verum
end;
consider R being FinSequence such that
A2: ( dom R = Seg n & ( for k being Nat st k in Seg n holds
S1[k,R . k] ) ) from FINSEQ_1:sch 1(A1);
n is Element of NAT by ORDINAL1:def 12;
then len R = n by A2, FINSEQ_1:def 3;
then reconsider R = R as n -element FinSequence by CARD_1:def 7;
now :: thesis: for y being object st y in rng R holds
y in REAL
let y be object ; :: thesis: ( y in rng R implies y in REAL )
assume y in rng R ; :: thesis: y in REAL
then consider i being object such that
A3: ( i in dom R & y = R . i ) by FUNCT_1:def 3;
reconsider i = i as Nat by A3;
ex r being Real st
( R . i = r & 0 < r & x . i in ].((a . i) - r),((a . i) + r).[ ) by A2, A3;
hence y in REAL by A3, XREAL_0:def 1; :: thesis: verum
end;
then rng R c= REAL ;
then reconsider R = R as n -element FinSequence of REAL by FINSEQ_1:def 4;
reconsider G = rng R as finite Subset of REAL ;
A4: for i being Nat st i in Seg n holds
R . i <= upper_bound G
proof
let i be Nat; :: thesis: ( i in Seg n implies R . i <= upper_bound G )
assume i in Seg n ; :: thesis: R . i <= upper_bound G
then R . i in rng R by A2, FUNCT_1:3;
hence R . i <= upper_bound G by SEQ_4:def 1; :: thesis: verum
end;
1 <= n by NAT_1:14;
then A5: 1 in Seg n ;
then A6: ex r being Real st
( R . 1 = r & 0 < r & x . 1 in ].((a . 1) - r),((a . 1) + r).[ ) by A2;
take r = upper_bound G; :: thesis: ( 0 < r & ( for i being Nat st i in Seg n holds
x . i in ].((a . i) - r),((a . i) + r).[ ) )

thus 0 < r by A4, A5, A6; :: thesis: for i being Nat st i in Seg n holds
x . i in ].((a . i) - r),((a . i) + r).[

let i be Nat; :: thesis: ( i in Seg n implies x . i in ].((a . i) - r),((a . i) + r).[ )
assume A7: i in Seg n ; :: thesis: x . i in ].((a . i) - r),((a . i) + r).[
then A8: ].((a . i) - (R . i)),((a . i) + (R . i)).[ c= ].((a . i) - r),((a . i) + r).[ by A4, INTEGRA6:2;
ex r being Real st
( R . i = r & 0 < r & x . i in ].((a . i) - r),((a . i) + r).[ ) by A2, A7;
hence x . i in ].((a . i) - r),((a . i) + r).[ by A8; :: thesis: verum