Original: An important consequence of the theorem is that if there exists a deterministic polynomial time algorithm for solving Boolean satisfiability, then there exists a deterministic polynomial time algorithm for solving all problems in NP.
Simplified: Any problem that is in NP can be changed so that to the Boolean satisfiability theorem.