What are the most overpowered theorems in mathematics? 
What are the most overpowered theorems in mathematics?

By "overpowered," I mean theorems that allow disproportionately strong conclusions to be drawn from minimal / relatively simple assumptions. I'm looking for the biggest guns a research mathematician can wield.
This is different from "proof nukes" (that is, applying advanced results to solve much simpler problems).  It is also not the same as requesting very important theorems, since while those are very beautiful and high level and motivate the creation of entire new disciplines of mathematics, they aren't always commonly used to prove other things (e.g. FLT), and if they are they tend to have more elaborate conditions that are more proportional to the conclusions (e.g. classification of finite simple groups).
Answers should contain the name and statement of the theorem (if it is named), the discipline(s) it comes from, and a brief discussion of why the theorem is so good.  I'll start with an example.

The Feit-Thompson Theorem. All finite groups of odd order are solvable.

Solvability is an incredibly strong condition in that it immediately eliminates all the bizarre, chaotic things that can happen in finite nonabelian simple groups.  Solvable groups have terminating central and derived series, a composition series made of cyclic groups of prime order, a full set of Hall subgroups, and so on. The fact that we can read off all that structure simply by looking at the parity of a group's order is amazing.


there are no theorems whose conclusions contain more that their fully-spelled-out premises.
all purported examples of such just use, e.g., definitions that allow a short syntactic statement of the theorem while shoving all the actual work of it under the rug.
well, unless math is inconsistent at any rate - in which case we have bigger problems.
