Step 3: Proof by Contradiction
Now assume TSP is not NP-complete.
Then we can solve any instance of HC in polynomial time (just convert to TSP, run and read off answer). So HC is in P.
But we know that HC is NP-complete (contradiction).
Thus our assumption must be wrong and TSP is NP-complete.