Well, what we're going to do is we're going to talk about each edge in turn, the Prim's algorithm adds, and argue that whenever a new edge gets added, there's no way that edge creates any cycles in the set capital T. And, to see why, take a snapshot of the algorithm of some given iteration, to the sum current set capital T, and there's some set verticies capital 