Idea of Proof
If a problem is in NP, there is a nondeterministic Turing machine that recognizes yes-instances.
A Turing machine and all its operations on a given input can be described by a Boolean expression such that:
Expression is satisfiable if and only if the Turing machine will terminate at an accepting state for given input.
=> any NP algorithm can be described by an instance of SAT