Write it in matrix form and show that it has full row rank, which implies that there exists at least one solution. The coefficient matrix is as follows:
\begin{equation}
\begin{bmatrix}
1 & 1 & 2 & 2 \\
2 & -2 & 1 & -1 \\
\end{bmatrix}
\end{equation}
We can row reduce it once and find the following
\begin{equation}
\begin{bmatrix}
1 & 1 & 2 & 2 \\
0 & -4 & -3 & -5 \\
\end{bmatrix}
\end{equation}
We see that both $1$ and $-4$ are pivots, meaning that this $2\times 4$ matrix has 2 pivots (full row rank). From here, it is a theorem that full row rank would imply existence of solution(s). Proof can be found in any typical linear algebra textbook, or this question.
See this wiki link for more about ranks.