Finite Connected Graph is Tree iff Size is One Less than Order/Necessary Condition/Induction Step

Theorem
Let the following hold:
 * For all $j \le k$, a tree of order $j$ is of size $j - 1$.

Then this holds:
 * A tree of order $k + 1$ is of size $k$.