I know there are analogous questions to mine, but I'm seeking a different approach. All the solutions I saw use some sort of modular arithmetic trick, but I'd like to prove this without resorting to that. This question is from an exercise that asks to prove things using proof by cases. Here is what I came up with:
Proof. Suppose, for the sake of contradiction, that there are $x, y \in \mathbb{Z}$ such that $$x^2 + 3y^2 = 8.$$ Then $x^2 = 8 - 3y^2 \geq 0$, since $x^2$ is always positive. Thus $$3y^2 \leq 8 \implies y^2 \leq \frac{8}{3}.$$ Since $y$ is an integer, it follows that $$0 \leq y^2 \leq \left \lfloor{8/3}\right \rfloor \implies 0 \leq y^2 \leq 2.$$ Thus, there are three cases to consider:
(1) $y^2 = 0 \implies x^2 = 8 \implies x = \pm\sqrt{8}$.
(2) $y^2 = 1 \implies x^2 + 3 = 8 \implies x = \pm\sqrt{5}$.
(3) $y^2 = 2 \implies x^2 + 6 = 8 \implies x = \pm\sqrt{2}$.
Since all cases contradict the assumption that $x$ is an integer, there are no integer solutions to $x^2 + 3y^2 = 8$. $\quad\blacksquare$
Probably this is unnecessarily verbose... What do you think? If there are no errors, is there a better way to do it? (without using modular arithmetic xD)

In case (2), you cannot conclude $y=1$, it may also be $y=-1$. Likewise, case (3) rather leads to $y=\pm\sqrt 2$. In the end this doesn't change much, but formally, you left out those cases.
For the sake of the arguments, I might prefer to do cases from the opposite point of view: