 reserve m,n for Nat;
 reserve i,j for Integer;
 reserve S for non empty multMagma;
 reserve r,r1,r2,s,s1,s2,t for Element of S;
 reserve G for Group-like non empty multMagma;
 reserve e,h for Element of G;
 reserve G for Group;
 reserve f,g,h for Element of G;
 reserve u for UnOp of G;

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;
