In a metric space the function $d(x,A)/(d(x,A) + d(x,B))$ separates two disjoint closed sets outright, so the metric case spends no choice principle

Let $(X,d)$ be a metric space (Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric) with its metric topology (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement), metrizable (Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not) and hence normal (In a metric space any two separated sets have disjoint open neighbourhoods, so every metrizable space is completely normal), and let $A, B \subseteq X$ be disjoint, nonempty and closed. Define $h : X \to [0,1]$ by

$h(x) \;:=\; \frac{d(x,A)}{d(x,A)+d(x,B)}.$

Then $h$ is a witness for Urysohn's lemma, under the axiom of dependent choice: in a normal space two disjoint closed sets are separated by a continuous function into $[0,1]$, and conversely such a space is normal applied to $A$ and $B$, and it is written down by a single formula: no choice principle, dependent or otherwise, is spent in producing it, in contrast with the general construction inside that theorem.

• Nothing is selected. Every value $h(x)$ is computed from $d(x,A)$ and $d(x,B)$, both determined by $x$, $A$, $B$ and $d$ alone; no step above fixes a witness from a nonempty set of alternatives. This is the same observation In a metric space any two separated sets have disjoint open neighbourhoods, so every metrizable space is completely normal and In a metric space every closed set is a zero set and a $G_\delta$, and the distance function separates a point from a closed set, so every metrizable space is Tychonoff and perfectly normal make about their own constructions, and it is why the metric case of every separation theorem on this page needs no choice hypothesis at all.

• The nonemptiness of $A$ and $B$ is not decoration. If $A=\varnothing$ then $d(x,A)$ is undefined for every $x$ ($|d(x,A) - d(y,A)| \le d(x,y)$, so the distance to a fixed nonempty set is $1$-Lipschitz presupposes a nonempty set), and the constant function $1$ serves instead; the formula above is written for the case that matters, where both sets carry a point to measure distance from.