Easy way: $ $ ideal $I\,$ contains the norms $\,w\bar w\,$ of every generator $\,w\,$ so by Bezout it also contains the gcd of the norms = $(10,2\color{#c00}6,5\color{#0a0}5)=(10,\color{#c00}6,\color{#0a0}5)=(10,1,5)\!=\!1\,$ by Euclid. So $\,1\!\in\! I\Rightarrow I\! =\! \Bbb Z[i]$.
Remark $ $ As explained here this can be viewed an instance of the method of simpler multiples (or, equivalently, the correspondence or Third Isomorphism Theorem, from a structural viewpoint). See here for an analogous example using the norm and trace.
Because the norm map is multiplicative it preserves many properties related to factorization. For example, in many favorable contexts (e.g. Galois) a number ring enjoys unique factorization iff its monoid of norms does. For further interesting examples see the papers of Bumby, Dade, Lettl, Coykendall cited in this answer.
Alternatively working $\!\bmod I\,$ (or, equivalently, in $\,\Bbb Z[i]/I)\,$ simplifies ideal arithmetic (as in Lubin's answer) to more intuitive arithmetic of numbers (ring elements), e.g. here we find by subtracting neighboring stacked congruences that
$$\begin{align} \color{#c00}{3i\equiv 1}\\ 5i\equiv 1\\ 7i\equiv 4\end{align}\Rightarrow
\begin{array}{} 2i\equiv \color{#0a0}0\\ 2i\equiv \color{#0a0}3\end{array}\Rightarrow\,
\color{#0a0}{0\equiv 3}\,\Rightarrow\, 0\equiv \color{#c00}{3i\equiv 1}\qquad$$
While it may seem ad hoc at first glance, as long as we eventually keep finding smaller (norm) elements this will eventually yield the gcd, due to the fact that $\,\Bbb Z[i]\:\!$ is (norm) Euclidean. Thus, instead of mechanically applying the Euclidean algorithm, we can often use our intuition to step outside the algorithm to optimize it (one way is as above - using "simpler multiples", where "simpler" need not always imply smaller norm).