theorem
  for X being finite set st
  (for Y st Y in X ex B being finite set st B = Y & card B = k &
  for Z st Z in X & Y <> Z holds Y,Z are_equipotent & Y misses Z)
    ex C being finite set st C = union X & card C = k * card X by Lm5;
