reserve
  X,x,y,z for set,
  k,n,m for Nat ,
  f for Function,
  p,q,r for FinSequence of NAT;

theorem Th3:
  for p,q being finite set st p,q are_c=-comparable & card p = card q holds
  p = q
by CARD_2:102;
