reserve Y for non empty set,
  G for Subset of PARTITIONS(Y),
  A,B,C,D,E,F for a_partition of Y;

theorem
  G={A,B,C,D} & A<>C & B<>C & C<>D implies CompF(C,G) = A '/\' B '/\' D
proof
  {A,B,C,D} = {C,A,B,D} by ENUMSET1:67;
  hence thesis by Th7;
end;
