1. Every path component of $X$ is contained in a connected component of $X$.
2. If $X$ is path-connected, then $X$ is connected.
3. Every connected component $C$ of $X$ is partitioned by the path components it contains: $C = \bigsqcup_{i \in I} P_i$ where each $P_i$ is a path component.