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

Theorem
Let the following hold:
 * A tree of order $k$ is of size $k-1$.

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

Proof
Let $T_{k+1}$ be any tree with $k+1$ nodes.

Take any node $v$ of $T_{k+1}$ of degree $1$.

Such a node exists from Finite Tree has Leaf Nodes.

Consider $T_k$, the subgraph of $T_{k+1}$ created by removing $v$ and the edge connecting it to the rest of the graph.

By Connected Subgraph of Tree is Tree, $T_k$ is itself a tree.

The order of $T_k$ is $k$, and it has one less edge than $T_{k+1}$ by definition.

By hypothesis, $T_k$ has $k-1$ edges.

So $T_{k+1}$ must have $k$ edges.