Give A Careful Proof Of The Proposition If A Is Denumerable And B A Then B Is De

Give a careful proof of the proposition: If A is denumerable and B ~ A, then B is denumerable.(You must exhibit an explicit 1-1 correspondence N -> B.)

Given that A ∼ B that is A is isomorphic to B.Hence there is an isomorphismg:B→A.And given that A is denumerable. Hence there is a bijective function f suchthatf :: A → Nis bijective…

0 replies

Leave a Reply

Want to join the discussion?
Feel free to contribute!

Leave a Reply