[guided]Let
\begin{align*}
C := \overline{B}(x_0,r) = \{z \in X : d(z,x_0) \le r\}.
\end{align*}
To prove that $C$ is [closed](/page/Closed%20Set), it is enough to prove that its complement $X \setminus C$ is [open](/page/Open%20Set). This means that for every point $x \in X \setminus C$, we must find a radius $\varepsilon > 0$ such that the open ball
\begin{align*}
B(x,\varepsilon) := \{z \in X : d(z,x) < \varepsilon\}
\end{align*}
is contained in $X \setminus C$.
Fix $x \in X \setminus C$. Since $x$ is not in the closed ball centred at $x_0$ with radius $r$, the defining inequality for membership in $C$ fails, so
\begin{align*}
d(x,x_0) > r.
\end{align*}
The positive number $d(x,x_0)-r$ is the margin by which $x$ lies outside the closed ball. We choose half of this margin:
\begin{align*}
\varepsilon := \frac{d(x,x_0)-r}{2}.
\end{align*}
Then $\varepsilon > 0$ because $d(x,x_0) > r$.
Now take any $y \in B(x,\varepsilon)$. By definition of $B(x,\varepsilon)$, this gives $d(x,y) < \varepsilon$. The triangle inequality from the definition of a [metric space](/page/Metric%20Space), applied to the three points $x$, $y$, and $x_0$, gives
\begin{align*}
d(x,x_0) \le d(x,y) + d(y,x_0).
\end{align*}
Rearranging this inequality gives
\begin{align*}
d(y,x_0) \ge d(x,x_0) - d(x,y).
\end{align*}
Since $d(x,y) < \varepsilon$, we get
\begin{align*}
d(y,x_0) > d(x,x_0) - \varepsilon.
\end{align*}
Substituting the definition of $\varepsilon$ yields
\begin{align*}
d(x,x_0) - \varepsilon = d(x,x_0) - \frac{d(x,x_0)-r}{2}.
\end{align*}
Thus
\begin{align*}
d(x,x_0) - \varepsilon = \frac{d(x,x_0)+r}{2}.
\end{align*}
Because $d(x,x_0) > r$, the average of $d(x,x_0)$ and $r$ is still strictly larger than $r$:
\begin{align*}
\frac{d(x,x_0)+r}{2} > r.
\end{align*}
Therefore $d(y,x_0) > r$, so $y$ is not in $C$. Since the point $y \in B(x,\varepsilon)$ was arbitrary, we have proved
\begin{align*}
B(x,\varepsilon) \subset X \setminus C.
\end{align*}[/guided]