Consider a graph $G$. Let $A, B$ are two trees in a graph and $T_a, T_b$ represents their corresponding edge sets. Also an edge $e \in E$ is an extension of tree $A$. If $T_b \cup \{e\}$ forms a cycle then exactly one of the following holds:
- There exists an edge $e_b \in T_b$ which is also an extension of tree A
- For all $e_b \in T_b$, $T_a \cup \{e_b\}$ forms a cycle.
An edge $e \notin T_a$ is an extension of tree $A$ if $T_a \cup \{ e \}$ also forms a tree.
Actually, I am trying to prove that collection of edge sets which induce trees is a connected sub matroid of a graphic matroid. I have proved remaining 3 properties of a connected sub matroid but struck at this one.