Connectedness with n minus one edges, acyclicity with n minus one edges, and unique paths are equivalent. This is a compact note, but the quantifiers and hypotheses stay on the page.
Statement
A finite graph \(T=(V,E)\) is a tree when it is connected and acyclic. The unique simple path \(P_{uv}\) between two vertices makes distance and recursive decomposition especially rigid.
A reliable calculation names domain and codomain. The notation \(\mathsf{data}\mapsto\mathsf{claim}\) is harmless only after both \(\operatorname{dom}\) and \(\operatorname{cod}\) have been fixed.
Worked algebra
Here is a concrete symbolic test. Reading it from left to right reveals which transformation is reversible and which is only an implication.
Conceptual compression
A good test for understanding is to change the presentation while keeping the invariant fixed. The aligned form makes that comparison unusually easy.
Caveat
A rooted tree adds a parent relation that an unrooted tree does not possess. Statements about ancestors depend on the chosen root.
The important habit is to remember what was fixed before the calculation began and what was proved only afterward. The final display preserves that order.