The standard method of proving (weak) consistency is to use Chebychev's inequality and apply the triangle inequality to deal with the bias in the estimator. From the triangle inequality, you have:
$$|\hat{\theta}_n - \theta|
= |(\hat{\theta}_n - \mathbb{E}(\hat{\theta}_n)) - (\theta - \mathbb{E}(\hat{\theta}_n))|
\leqslant |\hat{\theta} - \mathbb{E}(\hat{\theta}_n)| + |\theta - \mathbb{E}(\hat{\theta}_n)|.$$
In your problem you have an unbiased estimator, so the last term is zero. We therefore obtain:
$$\begin{equation} \begin{aligned}
\mathbb{P}(|\hat{\theta}_n - \theta| \geqslant \epsilon)
&\leqslant \mathbb{P}(|\hat{\theta}_n - \mathbb{E}(\hat{\theta}_n)| + |\theta - \mathbb{E}(\hat{\theta}_n)| \geqslant \epsilon) \\[6pt]
&= \mathbb{P}(|\hat{\theta}_n - \mathbb{E}(\hat{\theta}_n)| \geqslant \epsilon) \\[6pt]
&\leqslant \frac{\mathbb{V}(\hat{\theta}_n)}{\epsilon^2}. \\[6pt]
\end{aligned} \end{equation}$$
Taking $n \rightarrow \infty$ with $\mathbb{V}(\hat{\theta}_n) \rightarrow 0$ gives the desired result. Note here that the triangle inequality has allowed us to isolate the term required for the Chebychev inequality, and in the present case the other term is zero since the estimator is unbiased. In the more general case you can still proceed with this method, and convergence occurs so long as the estimator is asymptotically unbiased (so that the other term also goes to zero).