Hadwiger's conjecture for the immersion relation posits that every graph $G$ contains an immersion of the complete graph $K_{χ(G)}$. Vergara showed that this is equivalent to saying that every $n$-vertex graph $G$ with $α(G)=2$ contains an immersion of the complete graph on $\lceil\frac{n}{2}\rceil$ vertices. Recently, Botler et al. showed that every $n$-vertex graph $G$ with $α(G)=2$ contains every complete bipartite graph on $\lceil\frac{n}{2}\rceil$ vertices as an immersion. In this paper, we give a much simpler proof of this result.