theorem
  G is complete implies E is connected
proof
  assume G is complete;
  then createGraph(V,E) is complete; :: because of removeParallelEdges
  hence E is connected by Th69;
end;
