
theorem Th126:
  for G1, G2 being _Graph, G being GraphUnion of G1, G2, W being Walk of G
  st G1 tolerates G2 & the_Vertices_of G1 misses the_Vertices_of G2
  holds W is Walk of G1 or W is Walk of G2 by Lm4;
