I'm studying a proof in 'An Introduction to Metric Spaces and Fixed Point Theory' (M. Khamsi, W. Kirk) that shows the equivalence of injectiveness and hyperconvexity for metric spaces. I stumbled over the following part of the proof.
Let $(X, d)$ be an injective metric space and suppose that $\{B^*(x_i, r_i)\mid i\in I\}$ is a set of closed balls each two of which intersect. Define $Y=\{x_i\mid i\in I\}$ and $Z=Y\cup \{z\}$ with $z\notin Y$. Define the distance on $Z$ by $$d'(x_i, x_j) = d(x_i, x_j) \quad\text{and}\quad d'(x_i, z) = \inf{\{r\mid\exists j\in I\colon B^*(x_j, r_j) \subseteq B^*(x_i, r)\}}.$$ I now have to show that $d'$ has the triangle inequality. I've already shown that $$\forall k, l\in I\colon d'(x_k, x_l)\leq d'(x_k, z)+d'(x_l, z),$$ but I'm stuck with the proof for the second non-trivial case: $$\forall k, l\in I\colon d'(x_k, z)\leq d'(x_k, x_l)+d'(x_l, z).$$
I tried to distinguish two cases. If $d'(x_k, x_l)>r_k$, then it follows immediately that $$d'(x_k, z)\leq r_k < d'(x_k, x_l)<d'(x_k, x_l)+d'(x_l, z).$$ What is the proof for the other case $d'(x_k, x_l)\leq r_k$? Is it even necessary to make this distinguishment?