Cook–Levin theorem

Boolean satisfiability is NP-complete and therefore that NP-complete problems exist

From Wikipedia, licensed CC BY-SA 4.0.