NP-Completeness

To prove a problem $B$ is NP-complete, we need to prove

1. $B\in NP$
2. There is an NP-complete problem $A$ such that $A{\le }_{p}B$