
theorem Th64:
  for G1 being _Graph, G2 being removeLoops of G1
  holds G1.numComponents() = G2.numComponents()
proof
  let G1 be _Graph, G2 be removeLoops of G1;
  for v1 being Vertex of G1, v2 being Vertex of G2 st v1 = v2
    holds G1.reachableFrom(v1) = G2.reachableFrom(v2) by Th62;
  hence thesis by Th38;
end;
