reserve G,G1,G2 for _Graph;
reserve e,x,y for set;
reserve v,v1,v2 for Vertex of G;
reserve W for Walk of G;

theorem
  (ex v being Vertex of G st G.reachableFrom(v) = the_Vertices_of G)
  implies G is connected by Lm7;
