I want to show that a map $F: \mathbf{R} \to \mathbf{R}$ has at most countable discountinuities, if $F(x) \leq F(y)$ whenever $x \leq y$.
Here's the idea. Let's use standard notation $F(x^+), F(x^-)$ for upper and lower limits of $F$ around $x$. And let $D(F) = \{x : F(x^+) \neq F(x^-)\}$, which is the set of discountinuities for a monotone function. Now suppose that $D(F)$ is uncountable. Suppose $x, y \in D(F)$ are distinct. Then $(F(x^-), F(x^+)) \cap (F(y^-), F(y^+)) = \emptyset$. This is because with $r = d(x, y)$, and assuming $x < y$, if $F(x^+) > F(y^-)$, this means that $\inf_{x \leq s < x + r/2} F(x) > \sup_{y - r/2 < t \leq y} F(t)$, which happens if and only if for some particular $x \leq s < x + r/2$ and $y - r/2 < t \leq y$, we have $F(s)> F(t)$. But this is a contradiction since as stated, $s \leq t$. Hence we have $F(x^+) \leq F(y^-)$, which means the intervals are disjoint as required.
We have shown that $D(F)$ uncountable implies the existence of uncountably many disjoint intervals $(F(x^-), F(x^+))$, where $x$ ranges over $D(F)$. But this can't happen because each open interval contains a distinct rational, which is a countable set.