Right now, we have shown the if and now, we have to show the only if, but this is actually quite easy because if we know that there is a path between A and B of this length here then we already know that each vertex is visited exactly once because this is the bear minimum of a tour between A and B given this many vertices. 