
theorem
  for G1, G2 being _Graph st G1 == G2 holds G1 tolerates G2
proof
  let G1, G2 be _Graph;
  assume G1 == G2;
  then G2 is Subgraph of G1 by GLIB_000:87;
  hence thesis by Th15;
end;
