K-Connectivity Implies Lesser Connectivity

Theorem
If a graph $G$ is $k$-connected, then $G$ is $l$-connected for all $l \in \Z : 0 < l < k$.

Proof
Suppose that $G$ is $k$-connected. Then


 * $\left|{V \left({G}\right) }\right| > k > l$
 * $G$ is connected
 * If $W$ is a vertex cut of $G$, then $\left|{W}\right| \ge k > l$ so $\left|{W}\right| \ge l$.