[guided]The key point is that detailed balance should be checked for the measure of accepted moves, not merely for the formal ratio. Write
\begin{align*}
x=(\theta,u),\qquad y=(\theta',u').
\end{align*}
The density of moves that start at $x$, propose $y$, and are accepted is
\begin{align*}
a(x,y)=\widetilde r(x)\kappa(x,y)\alpha(x,y).
\end{align*}
We want to prove that this density is symmetric in $x$ and $y$.
First consider the nondegenerate case
\begin{align*}
p(\theta)\widehat Z(\theta,u)q(\theta,\theta')>0.
\end{align*}
Then the acceptance probability is the minimum of $1$ and the reverse-over-forward ratio:
\begin{align*}
\alpha(x,y)
=
\min\left\{1,\frac{p(\theta')\widehat Z(\theta',u')q(\theta',\theta)}
{p(\theta)\widehat Z(\theta,u)q(\theta,\theta')}\right\}.
\end{align*}
Multiplying by the target density and the proposal density gives
\begin{align*}
a(x,y)
=
C^{-1}p(\theta)\widehat Z(\theta,u)m(\theta,u)q(\theta,\theta')m(\theta',u')
\min\left\{1,\frac{p(\theta')\widehat Z(\theta',u')q(\theta',\theta)}
{p(\theta)\widehat Z(\theta,u)q(\theta,\theta')}\right\}.
\end{align*}
Using the elementary identity $A\min\{1,B/A\}=\min\{A,B\}$ for $A>0$ and $B\ge 0$, with
\begin{align*}
A=p(\theta)\widehat Z(\theta,u)q(\theta,\theta')
\end{align*}
and
\begin{align*}
B=p(\theta')\widehat Z(\theta',u')q(\theta',\theta),
\end{align*}
we obtain
\begin{align*}
a(x,y)
=
C^{-1}m(\theta,u)m(\theta',u')\min\{p(\theta)\widehat Z(\theta,u)q(\theta,\theta'),p(\theta')\widehat Z(\theta',u')q(\theta',\theta)\}.
\end{align*}
This expression is unchanged when we swap $(\theta,u)$ with $(\theta',u')$. If the reverse product $p(\theta')\widehat Z(\theta',u')q(\theta',\theta)$ is positive, the same computation applies in the reverse direction, so this proves symmetry. If the reverse product is zero, the displayed formula gives $a(x,y)=0$; the zero-case argument below applied with $x$ and $y$ interchanged gives $a(y,x)=0$. Thus the forward-positive reverse-zero case is also covered.
Now we check that no division-by-zero case has been hidden. If
\begin{align*}
p(\theta)\widehat Z(\theta,u)q(\theta,\theta')=0,
\end{align*}
then the definition of the algorithm sets $\alpha(x,y)=0$, hence
\begin{align*}
a(x,y)=0.
\end{align*}
For symmetry, we must show that the reverse accepted density is also zero. If
\begin{align*}
p(\theta')\widehat Z(\theta',u')q(\theta',\theta)=0,
\end{align*}
then the reverse acceptance probability is also zero or the reverse proposal-target product is zero, so
\begin{align*}
a(y,x)=0.
\end{align*}
The only possible concern is the case
\begin{align*}
p(\theta')\widehat Z(\theta',u')q(\theta',\theta)>0.
\end{align*}
If $m(\theta,u)=0$, then the reverse proposal density contains the factor $m(\theta,u)$:
\begin{align*}
\kappa(y,x)=q(\theta',\theta)m(\theta,u)=0,
\end{align*}
so $a(y,x)=0$. If $m(\theta,u)>0$, then the equality
\begin{align*}
p(\theta)\widehat Z(\theta,u)q(\theta,\theta')=0
\end{align*}
forces either $p(\theta)\widehat Z(\theta,u)=0$ or $q(\theta,\theta')=0$. In the first case the reverse acceptance ratio has numerator zero, so $\alpha(y,x)=0$. In the second case, if $p(\theta)\widehat Z(\theta,u)m(\theta,u)>0$ and $p(\theta')\widehat Z(\theta',u')m(\theta',u')>0$, the symmetric support condition would force $q(\theta',\theta)=0$, contradicting the present assumption. If the second target factor is not positive because $m(\theta',u')=0$, then $\widetilde r(y)=0$, so $a(y,x)=0$. Thus every zero case also gives $a(y,x)=0$.
Therefore the accepted move density satisfies
\begin{align*}
a(x,y)=a(y,x)
\end{align*}
for all $x,y\in X$. This is the detailed balance identity for off-diagonal accepted moves.[/guided]