Asymptotic equivalence between sequence-divisor sets and irregular-prime sets

Let $\mathcal Q_H(x)$, $\mathcal Q_{H^-}(x)$, and $\mathcal Q_{H^+}(x)$ count the prime divisors up to $x$ of the $H$-, $H^-$-, and $H^+$-sequences, respectively. Let $\mathcal P_G(x)$, $\mathcal P_{H^-}(x)$, and $\mathcal P_{H^+}(x)$ count the corresponding irregular primes. Assume that the associated Wieferich sets are $o(x/\log x)$. Sequence-divisor asymptotic conjecture. Asymptotically,

$$\mathcal Q_H(x)\sim\mathcal P_G(x),\qquad \mathcal Q_{H^-}(x)\sim\mathcal P_{H^-}(x),\qquad \mathcal Q_{H^+}(x)\sim\mathcal P_{H^+}(x).$$

Here the asymptotics of the irregular-prime counting functions are supplied by the paper's preceding conjectures. The assertion reduces the divisor-counting problem to irregular-prime counting once the Wieferich sets are negligible; this negligibility itself is assumed rather than known.