Connected Graph is Tree iff Removal of One Edge makes it Disconnected

Theorem
Let $G = \struct {V, E}$ be a connected simple graph.

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