So at the end of the day, we'll have a path from any vertex to any other vertex using only the edges in our chosen set, capital T. Now, by part one of this proof, all we need to prove is that the algorithm halts with capital X equal to capital V, then we know that capital T spans everything in V. So how could that not happen? 