
theorem Th58: :: CliqueSubno0:
for G, H being with_finite_clique# SimpleGraph
 st G c= H holds clique# G <= clique# H
proof
  let G, H be with_finite_clique# SimpleGraph such that
A1: G c= H;
  consider D being finite Clique of G such that
A2: order D = clique# G by Def15;
   D is Clique of H by A1,XBOOLE_1:1;
  hence clique# G <= clique# H by A2,Def15;
end;
