theorem
  for G being non empty finite 1-sorted holds card G >= 1
proof
  let G be non empty finite 1-sorted;
  set g = the Element of G;
  {g} c= the carrier of G & card {g} = 1 by CARD_1:30,ZFMISC_1:31;
  hence thesis by NAT_1:43;
end;
