Let $\emptyset\ne A\subset\mathbb{R}^n$ be open and let $f \in C^1 (A, \mathbb{R})$ be a function. Let $\emptyset\ne K\subset A$ be compact and convex. I want to prove that $f$ is Lipschitz on $K$; that is, prove there exists a constant $c > 0$ such that $| f ( x ) - f( y ) | \leq c \, \| x - y \|, \forall x , y \in K$.
My approach:
Let $x,y\in K$ be two arbitrary points. Then, since $K$ is convex, the line segment between $x$ and $y$, i.e. $Co(x,y)$, is in $K$. Thus, by MVT, there exists a vector $b\in Co(x,y)$ such that
$$\text{(*) } |f(x)-f(y)|=|\langle x-y, (\nabla f)(b)\rangle|\le \|x-y\|\|(\nabla f)(b)\|$$
Now, since $K$ is compact, $f$ takes a maximum and a minimum values on $K$, so that $\exists b'\in K$ such that $\|(\nabla f)(b') \|\ge \|(\nabla f)(b) \|$, for all $b\in K$. Let $c\in \mathbb{R}$, $c:=(\nabla f)(b')$, then
$$|f(x)-f(y)|\le\|x-y\|\|(\nabla f)(b)\|\le\|x-y\|\|(\nabla f)(b')\|=c\|x-y\|$$
This implies that $f$ is Lipschitz on $K$ for all $x,y\in K$.
Please let me know if you think my proof is correct or not very much? I'm somewhat concerned about the part with the gradient - how exactly is the maximality of the norm of the gradient related to the EVT, that is to $f$ taking maximum and minimum values? As far as I can tell, the maximum norm of the gradient exists because that is the direction to the maximum (or minimum) point of $f$.