Finite Connected Graph is Tree iff Size is One Less than Order

Theorem
Let $T$ be a connected simple graph of order $n$.

Then $T$ is a tree iff the size of $T$ is $n-1$.

Proof
By definition, the order of a tree is how many nodes it has, and its size is how many edges it has.