
theorem Th49:
  for G2 being _Graph, G1 being Supergraph of G2 holds G2.loops() c= G1.loops()
proof
  let G2 be _Graph, G1 be Supergraph of G2;
  G2 is Subgraph of G1 by GLIB_006:57;
  hence thesis by Th48;
end;
