reserve G for _Graph;
reserve G2 for _Graph, G1 for Supergraph of G2;

theorem
  for G2 being _finite _Graph, G1 being _finite Supergraph of G2 holds
    G2.order() <= G1.order() & G2.size() <= G1.size()
proof
  let G2 be _finite _Graph, G1 be _finite Supergraph of G2;
  G2 is Subgraph of G1 by Th61;
  hence thesis by GLIB_000:75;
end;
