
theorem :: Maxclicover:
for R being finite RelStr holds cliquecover# R <= card the carrier of R
proof
 let R be finite RelStr;
  consider C being finite Clique-partition of R such that
A1: card C = cliquecover# R by Def5;
  Segm card C c= Segm card the carrier of R by Th7;
 hence cliquecover# R <= card the carrier of R by A1,NAT_1:39;
end;
