defpred S1[ Nat, object ] means $2 = lower_bound (rng ((f `| rohl) | ['(($1 -' 1) / (n + 1)),($1 / (n + 1))']));
A1: for k being Nat st k in Seg (n + 1) holds
ex x being Element of F_Real st S1[k,x]
proof
let k be Nat; :: thesis: ( k in Seg (n + 1) implies ex x being Element of F_Real st S1[k,x] )
assume k in Seg (n + 1) ; :: thesis: ex x being Element of F_Real st S1[k,x]
set r = lower_bound (rng ((f `| rohl) | ['((k -' 1) / (n + 1)),(k / (n + 1))']));
reconsider r = lower_bound (rng ((f `| rohl) | ['((k -' 1) / (n + 1)),(k / (n + 1))'])) as Element of [#] F_Real by VECTSP_1:def 5, XREAL_0:def 1;
take r ; :: thesis: S1[k,r]
thus S1[k,r] ; :: thesis: verum
end;
consider f being FinSequence of F_Real such that
A2: ( dom f = Seg (n + 1) & ( for k being Nat st k in Seg (n + 1) holds
S1[k,f . k] ) ) from FINSEQ_1:sch 5(A1);
take f ; :: thesis: ( len f = n + 1 & ( for i being Nat st i in dom f holds
f . i = lower_bound (rng ((f `| rohl) | ['((i -' 1) / (n + 1)),(i / (n + 1))'])) ) )

thus len f = n + 1 by FINSEQ_1:def 3, A2; :: thesis: for i being Nat st i in dom f holds
f . i = lower_bound (rng ((f `| rohl) | ['((i -' 1) / (n + 1)),(i / (n + 1))']))

thus for i being Nat st i in dom f holds
f . i = lower_bound (rng ((f `| rohl) | ['((i -' 1) / (n + 1)),(i / (n + 1))'])) by A2; :: thesis: verum