We prove that the terminal loss of a multilayer perceptron (MLP) under maximal update parametrization (μP) converges in probability to a deterministic continuous function, uniformly on every compact learning rate interval I ⊂ [0, ∞). The data and depth are fixed, and training consists of a fixed number of full-batch gradient descent steps. The activation is σ ∈ C\_b\textasciicircum{}2(ℝ), and only the hidden matrices are trained. If the limiting loss has a unique global minimizer in the interior of I, every measurable o\_ℙ(1)-approximate minimizer converges to it in probability. This uniform convergence also implies that transfer regret vanishes in probability as both source and target widths tend to infinity, provided the source optimization error is o\_ℙ(1). To obtain uniformity, we combine Tensor Program limits at fixed rates with a width-independent local H{\"o}lder estimate and a finite covering argument. We illustrate the loss curves and transfer regret across widths using one synthetic regression task.