[guided]We must prove the local refinement condition for a basis: given two basis candidates and a point in their intersection, we need a third basis candidate around that point and contained in the intersection.
Let the two balls be $B_d(x_1,r_1)$ and $B_d(x_2,r_2)$, where $x_1,x_2 \in X$ and $r_1,r_2 > 0$. Let $y \in B_d(x_1,r_1) \cap B_d(x_2,r_2)$. Since $y$ lies in the first ball, $d(x_1,y) < r_1$, so $r_1 - d(x_1,y) > 0$. Since $y$ lies in the second ball, $d(x_2,y) < r_2$, so $r_2 - d(x_2,y) > 0$. Define
\begin{align*}
\varepsilon := \frac{1}{2}\min\{r_1 - d(x_1,y), r_2 - d(x_2,y)\}.
\end{align*}
This is positive, so $B_d(y,\varepsilon)$ is an element of $\mathcal{B}_d$.
Now take any $z \in B_d(y,\varepsilon)$. The choice of $\varepsilon$ ensures that $d(y,z) < \varepsilon \le r_1 - d(x_1,y)$. Applying the triangle inequality in the [metric space](/page/Metric%20Space) $(X,d)$ gives
\begin{align*}
d(x_1,z) \le d(x_1,y) + d(y,z) < d(x_1,y) + r_1 - d(x_1,y) = r_1.
\end{align*}
Therefore $z \in B_d(x_1,r_1)$.
The same calculation uses the other available margin, namely $\varepsilon \le r_2 - d(x_2,y)$. Again by the triangle inequality,
\begin{align*}
d(x_2,z) \le d(x_2,y) + d(y,z) < d(x_2,y) + r_2 - d(x_2,y) = r_2.
\end{align*}
Therefore $z \in B_d(x_2,r_2)$. Since every $z \in B_d(y,\varepsilon)$ lies in both original balls, we have
\begin{align*}
B_d(y,\varepsilon) \subset B_d(x_1,r_1) \cap B_d(x_2,r_2).
\end{align*}
This is exactly the intersection-refinement axiom for a basis.[/guided]