
theorem
  for G2 being _Graph, v1,e,v2 being object
  for G1 being addAdjVertex of G2,v1,e,v2
  st G1 is Path-like holds G2 is Path-like
proof
  let G2 be _Graph, v1,e,v2 be object;
  let G1 be addAdjVertex of G2,v1,e,v2;
  assume A1: G1 is Path-like;
  then A2: G2 is connected;
  G2 is Subgraph of G1 by GLIB_006:57;
  hence thesis by A1, A2;
end;
