I think that you can do it by contradiction.

Suppose that there is a minimum cost spanning tree that does not contain . Then, adding to the tree forms a cycle. But if you drop one of the other edges in the cycle, the graph stays connected and is cycle-free (i.e. it is a tree) but has a lower cost than before. This contradicts the minimality of cost. Therefore, any minimum cost spanning tree must contain the edge .