% \subsection{Section~\ref{sec:5}}\label{S:proofs5} \paragraph{The dual paths of Lemma~\ref{lem:5.3}.} In fine coordinates with $\Xi=[0,R]\times[0,T]\times\{0\}$, the dual paths are the closed paths of fine cubes in the planes $y=j+\frac12$ around the rectangles of cube centres $[i+\frac12,2R-i-\frac12]\times[i-R+\frac12,R-i-\frac12]$ in $(x,z)$, $0\le jf_{b_2}$. In the box $b_1\cup b_2$ (sides less than $24L_c$) both $W$ and its complement have at least $\frac12(6L_c)^3=108L_c^3$ sites, and the same inequality gives at least $108L_c^3/(48L_c)>2L_c^2>(c_1/24)L_c^2$ bonds. The same argument with $U$ and $U_j'$ exchanged gives the bound for $\Sep^{**}_j$. \emph{Counting shells.} Let $b_0$ be the shell box of $x$. The $U_j$-end of the cut bond of Lemma~\ref{lem:5.22}(i) lies within $\rho/2+2$ of $x$, hence at index distance less than $\rho/(12L_c)+2$ from $b_0$, and the far site of (ii) lies at index distance more than $3\rho/(4L_c)-1$. A c-path in $U_j$ from the former to the latter changes the index distance by at most $1$ per step, and cells lie in one block, of side less than the box sides. Hence each shell $\mathrm{Sh}_i(b_0)$, $i\in I(\rho):=\{i\in\ZZ:\rho/(36L_c)+1\le i\le\rho/(4L_c)-1\}$, contains a whole cell of $U_j$, and likewise of $U_j'$. These shells are disjoint, lie within $9\rho$ of $x$, satisfy $3i+2\le(n_{\min}-1)/2$, and number $|I(\rho)|\ge\rho/(9L_c)$ for $\rho\ge27L_c$. In this range, the shell claim applied in each shell gives $(\rho/(9L_c))(c_1/24)L_c^2=c_{\mathrm{sh}}\rho L_c$ bonds of $\Sep^*_j$, and as many of $\Sep^{**}_j$. \paragraph{Proof of Lemma~\ref{lem:5.38}(b).} We take the breadth-first spanning tree from $o$ of the graph defining anchoring, with fixed orders. Along this tree, the block set is determined by the following data: \begin{itemize} \item the sizes of the components ($2^b$ choices); \item the anchors of the children of $o$ in $Z(\Xi')$, $|Z(\Xi')|\le2a$, and of the children of each component $C$ among its blocks ($2^{2a+k_o}$ and $2^{|C|+k_C}$ choices, $k_o+\sum_Ck_C=m$); \item the positions of the root blocks relative to their anchors ($(2d_0+1)^3$ choices each); \item the components, $*$-connected sets of given sizes containing their root blocks ($(26e)^{|C|}$ choices by Lemma~\ref{lem:5.12} with $D_{\max}=26$). \end{itemize} With $\sum_C|C|=b$ the product is $2^b\cdot2^{2a+b+m}(2d_0+1)^{3m}(26e)^b$.