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 Th47:
  G1 == G2 & G1 is Tree-like implies G2 is Tree-like
by Th7,Th43;
