
theorem Th59:
for X being finite set holds clique# CompleteSGraph X = card X
proof
  let X be finite set;
  set G = CompleteSGraph X;
A1: order G = card X by Lm1;
A2: G c= G;
  for T being finite Clique of G holds order T <= order G
     by NAT_1:43,ZFMISC_1:77;
  hence clique# CompleteSGraph X = card X by A1,A2,Def15;
end;
