Looking for input on, or alternative approaches to, my proof of the following statement:
Suppose $f$ is continuous on $(a,c)$. Further, for some $b$ satisfying $a \lt b\lt c$, let $f$ be strictly increasing on $(a,b)$ and strictly decreasing on $(b,c)$. Show that $f$ is not injective on $(a,c)$.
Firstly, by assumption, we must have that for any $x \in (a,b): f(b) \gt f(x)$. Similarly, for any $y \in (b,c): f(b) \gt f(y) \quad (*)$. To see this, consider if $f(b) \leq f(x)$ for some $x \in (a,b)$. This will lead to the contradiction of $f$ not being a strictly increasing function on $(a,b)$ (you can see how this contradiction will similarly arise for $f$ on the interval $(b,c)$ if we assumed $f(b) \leq f(y)$ for some $y \in (b,c)$).
Next, choose an $x \in (a,b)$ and choose a $y \in (b,c)$. Consider the intervals $[x,b]$ and $[b,y]$. $f$ is continous on each of these intervals, which means that there must be a minimum on each of these intervals. By $(*)$, we know that $f$ is strictly increasing on $[x,b]$ and strictly decreasing on $[b,y]$. Therefore, the minimum point in $[x,b]$ must be $x$, and the minimum point in $[b,y]$ must be $y$. If $f(x)=f(y)$, we are done. So suppose $f(x) \neq f(y)$. Then either $f(x) \lt f(y)$ or $f(y) \lt f(x)$. WLOG (without loss of generality), suppose the latter.
By $(*)$, we must have $f(b) \gt f(y) \gt f(x)$. Then, by applying the Intermediate Value Theorem to $[x,b]$, we know that there must exist a $z \in (x,b)$ such that $f(z)=f(y)$. Clearly, $z \neq y$ but $f(z)=f(y)$. Therefore, $f$ is not injective on $(a,c)$.