let z1, z2 be FinSequence of F_Real; :: thesis: ( len z1 = n + 1 & ( for i being Nat st i in dom z1 holds
z1 . i = lower_bound (rng ((f `| rohl) | ['((i -' 1) / (n + 1)),(i / (n + 1))'])) ) & len z2 = n + 1 & ( for i being Nat st i in dom z2 holds
z2 . i = lower_bound (rng ((f `| rohl) | ['((i -' 1) / (n + 1)),(i / (n + 1))'])) ) implies z1 = z2 )

assume that
A3: len z1 = n + 1 and
A4: for i being Nat st i in dom z1 holds
z1 . i = lower_bound (rng ((f `| rohl) | ['((i -' 1) / (n + 1)),(i / (n + 1))'])) and
A5: len z2 = n + 1 and
A6: for i being Nat st i in dom z2 holds
z2 . i = lower_bound (rng ((f `| rohl) | ['((i -' 1) / (n + 1)),(i / (n + 1))'])) ; :: thesis: z1 = z2
A7: dom z1 = dom z2 by A3, A5, FINSEQ_3:29;
for x being Nat st x in dom z1 holds
z1 . x = z2 . x
proof
let x be Nat; :: thesis: ( x in dom z1 implies z1 . x = z2 . x )
assume A8: x in dom z1 ; :: thesis: z1 . x = z2 . x
then reconsider x9 = x as Element of NAT ;
thus z1 . x = lower_bound (rng ((f `| rohl) | ['((x9 -' 1) / (n + 1)),(x9 / (n + 1))'])) by A4, A8
.= z2 . x by A6, A7, A8 ; :: thesis: verum
end;
hence z1 = z2 by A7; :: thesis: verum