If any NP-Complete problem is poly-time solvable, then P = NP.

If any problem in NP is provably not poly-time solvable, then all NP-Complete problems are not poly-time solvable.

If we can prove one problem is NP-Complete, then we can prove others more easily by showing an NP-Complete problem reduces to them.