
theorem Th28: :: ChrComplClico:
for R being RelStr, C being Coloring of ComplRelStr R
  holds C is Clique-partition of R
proof
 let R be RelStr, C being Coloring of ComplRelStr R;
  set CR = ComplRelStr R;
A1: the carrier of R = the carrier of CR by NECKLACE:def 8;
    now
      let x be set;
      assume x in C;
        then x is StableSet  of CR by DILWORTH:def 12;
      hence x is Clique of R by Th22;
    end;
 hence C is Clique-partition of R by A1,DILWORTH:def 11;
end;
