
theorem
  for G1, G2 being _Graph st G1 == G2 holds G2 is G1-Disomorphic
proof
  let G1, G2 be _Graph;
  assume G1 == G2;
  then consider F being PGraphMapping of G1, G2 such that
    A1: F = id G1 & F is Disomorphism by Th81;
  thus thesis by A1, GLIB_010:def 24;
end;
