[step:Verify that $d$ is a metric on $X$]
Define $\tilde{d}_n(x, y) := \min(d_n(f_n(x), f_n(y)), 1)$ for each $n \in \mathbb{N}$. Each $\tilde{d}_n: X \times X \to [0, 1]$ is a pseudometric (a metric on $X$ would require $f_n$ to be injective, which is not assumed; here we only use the pseudometric properties):
- **Non-negativity and zero on the diagonal.** $\tilde{d}_n(x, x) = \min(d_n(f_n(x), f_n(x)), 1) = \min(0, 1) = 0$.
- **Symmetry.** $\tilde{d}_n(x, y) = \tilde{d}_n(y, x)$ from symmetry of $d_n$.
- **Triangle inequality.** For $x, y, z \in X$, since $d_n$ is a metric on $Y_n$,
\begin{align*}
d_n(f_n(x), f_n(z)) \le d_n(f_n(x), f_n(y)) + d_n(f_n(y), f_n(z)).
\end{align*}
Taking minima with $1$: if both $\tilde{d}_n(x, y) < 1$ and $\tilde{d}_n(y, z) < 1$, the sum is at most $\tilde{d}_n(x, y) + \tilde{d}_n(y, z) < 2$, and $\min(\cdot, 1)$ preserves the inequality. If either term equals $1$, the right-hand side is at least $1 \ge \tilde{d}_n(x, z)$. So $\tilde{d}_n(x, z) \le \tilde{d}_n(x, y) + \tilde{d}_n(y, z)$.
Now $d(x, y) = \sum_n 2^{-n} \tilde{d}_n(x, y)$. The series converges absolutely: $0 \le 2^{-n} \tilde{d}_n(x, y) \le 2^{-n}$, and $\sum 2^{-n} = 1$. So $d: X \times X \to [0, 1]$ is well-defined.
The metric axioms transfer term-by-term: $d \ge 0$, $d(x, x) = 0$, symmetry, and triangle inequality (sum of pseudometric inequalities). It remains to verify positivity for $x \ne y$. Since $\mathcal{F}$ separates points, there exists $n_0 \in \mathbb{N}$ with $f_{n_0}(x) \ne f_{n_0}(y)$. Then $d_{n_0}(f_{n_0}(x), f_{n_0}(y)) > 0$, so $\tilde{d}_{n_0}(x, y) = \min(d_{n_0}(f_{n_0}(x), f_{n_0}(y)), 1) > 0$, hence $d(x, y) \ge 2^{-n_0} \tilde{d}_{n_0}(x, y) > 0$.
So $d$ is a metric.
[/step]