Why does if A is a spanning tree which doesn't have $e_1$ then $A\bigcup\{e_1\}$ has a unique cycle?
In a tree, there is exactly one path between any pair of vertices. When you add edge e1 you close that unique path to form a unique cycle.