Counting integers with a smooth totient

We fix a gap in our proof of an upper bound for the number of positive integers $n\le x$ for which the Euler function $\phi (n)$ has all prime factors at most $y$. While doing this we obtain a stronger, likely best-possible result.