[guided]This step is the heart of the argument: we must show that the $n$ homomorphisms $\varphi_1, \ldots, \varphi_n$ partition into $d$ groups of $r$, one group for each root of $P_\alpha$.
The [Roots-Homomorphisms Correspondence](/theorems/1256) states: for $\alpha$ algebraic over $K$ with minimal polynomial $P_\alpha$, and any extension $E/K$, the map $\sigma \mapsto \sigma(\alpha)$ is a bijection $\operatorname{Hom}_K(K(\alpha), E) \leftrightarrow \operatorname{Root}_{P_\alpha}(E)$. We apply this with $E = \bar{K}$. The hypothesis requires that $\alpha$ is algebraic over $K$, which holds since $L/K$ is finite (hence algebraic). The conclusion gives $|\operatorname{Hom}_K(K(\alpha), \bar{K})| = |\operatorname{Root}_{P_\alpha}(\bar{K})|$. Since $\bar{K}$ is algebraically closed, $P_\alpha$ splits completely in $\bar{K}$, and since $L/K$ is separable, the element $\alpha$ is separable over $K$, meaning $P_\alpha$ has no repeated roots. Therefore $|\operatorname{Root}_{P_\alpha}(\bar{K})| = \deg P_\alpha = d$.
For the fibre count, fix $\sigma \in \operatorname{Hom}_K(K(\alpha), \bar{K})$. An extension of $\sigma$ to $L$ is a $K$-homomorphism $\varphi : L \to \bar{K}$ with $\varphi|_{K(\alpha)} = \sigma$. We can view $L$ as an extension of $K(\alpha)$, and $\sigma$ as giving $\bar{K}$ the structure of a $K(\alpha)$-extension (via $\sigma$). The [Counting Homomorphisms](/theorems/1264) theorem states that for a finite extension $L/K(\alpha)$, we have $|\operatorname{Hom}_{K(\alpha)}(L, \bar{K})| \le [L : K(\alpha)]$ with equality if and only if $L/K(\alpha)$ is separable.
We verify separability of $L/K(\alpha)$. Since $L/K$ is separable, for any $\beta \in L$, the minimal polynomial $\operatorname{min}_K(\beta) \in K[t]$ has no repeated roots. The minimal polynomial $\operatorname{min}_{K(\alpha)}(\beta)$ divides $\operatorname{min}_K(\beta)$ in $K(\alpha)[t]$ (since $K \subset K(\alpha)$), so $\operatorname{min}_{K(\alpha)}(\beta)$ also has no repeated roots. Since $\beta \in L$ was arbitrary, $L/K(\alpha)$ is separable.
Therefore each fibre has size $|\operatorname{res}^{-1}(\sigma)| = r$, and the $n$ homomorphisms partition into $d$ fibres of $r$ elements each. This is the combinatorial fact that drives the remaining computation.[/guided]