 Solution

For each positive integer $m$, apply part (i) to the grid $D_m=\{j/m:0\le j\le m\}$. Intersect the resulting probability-one events over all $m$, a countable intersection. Work on this common event.

For $x\in [j/m,(j+1)/m]$, monotonicity of the empirical distribution function gives $F_n(j/m)\le F_n(x)\le F_n((j+1)/m)$. ConsequentlyandThe endpoint $x=1$ is itself on the grid. ThereforeFor each fixed $m$, take the upper limit as $n\to \infty$; part (i) makes the maximum vanish. Then let $m\to \infty$. This provesThis is the uniform-sample case of the Glivenko-Cantelli theorem, proved by a finite-grid approximation rather than assumed.