Prove cardinality of every finite nonempty set A is less then cardinality of natural number N(adsbygoogle = window.adsbygoogle || []).push({});

|A|<|N|

set A is nonempty finite set

natural number N is denumerable (infinite countable set)

|A|<|N| if there exist a injective (one-to-one) function f: A->N, but NO bijective function, which means NO surjective (onto) function

How to prove it in detail???

Help please!!!

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Cardinality Problem: Prove |A| < |N|

Loading...

Similar Threads for Cardinality Problem Prove | Date |
---|---|

I The Halting Problem | Mar 21, 2018 |

A How is Inaccessible Cardinal Written? | Feb 27, 2018 |

I Divisibility of bounded interval of reals | Feb 1, 2018 |

I Cardinality of the Power Series of an Infinite Set | Jul 9, 2017 |

B Cardinality and Natural Numbers | Apr 14, 2017 |

**Physics Forums - The Fusion of Science and Community**