Two-Person Zero-Sum Game with Finite Strategies has Solution

Theorem
Let $G$ be a two-person zero-sum game.

Let each player of $G$ have a finite set of strategies available.

Then $G$ has at least one solution.