Prove that if a graph $G$ has a Hamilton path then for every $S \subseteq V(G)$ the number of components of $G - S$ is at most $|S| + 1$.

I have tested this numerically with some examples and can picture why this works but I am unsure how I would go about proving this mathematically.
Any help is appreciated.