Connected Graph is Tree iff Removal of One Edge makes it Disconnected/Sufficient Condition/Statement

Theorem
Let $G = \struct {V, E}$ be a tree.

Then for all edges $e$ of $G$, the edge deletion $G \setminus \set e$ is disconnected.