
theorem Th11:
  for X being countable set, f being Enumeration of X holds rng f c= NAT
proof
  let X be countable set, f be Enumeration of X;
  card X c= NAT by CARD_3:def 14;
  hence thesis;
end;
