
theorem Th42: :: Hsubp0:
for R being with_finite_clique# RelStr, S being Subset of R
 holds clique# subrelstr S <= clique# R
proof
 let R be with_finite_clique# RelStr, S be Subset of R;
  set s = subrelstr S;
 consider c being finite Clique of s such that
A1: card c = clique# s by Def4;
 c is Clique of R by Th28;
 hence clique# subrelstr S <= clique# R by Def4,A1;
end;
