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

Proof
Let $G$ be a tree.

Then by definition $G$ has no circuits.

From Condition for Edge to be Bridge, every edge of $G$ is a bridge.

Thus by definition of bridge, removing any edge of $G$ will disconnect $G$.