Zermelo's theorem

A theorem about finite two-person games of perfect information in which the players move alternately and chance does not affect the decision-making process. It states that if the game cannot end in a draw, then one of the two players must have a winning strategy, i.e. force a win.

The well-ordering theorem.