   Chapter 7.4, Problem 27ES ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193

#### Solutions

Chapter
Section ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193
Textbook Problem
108 views

# Prove that if A is any countably infinite set, B is any set, and g : A → B is onto, then B is countable.

To determine

To prove:

If A is any countably infinite set, B is any set and g:AB is onto, then B is countable.

Explanation

Given information:

A is any countably infinite set, B is any set and g:AB is onto.

Proof:

Given:

A is a countable infinite set.

B is a set.

g:AB is onto.

Let us define the function f as:

f:BA,f(x)=y for some element y such that x=g(y)

f one-to-one:

Let aB and bB such that a andb have the same image:

f(a)=f(b)

However, we know that the image of a is an element y such that a=g(y).

Similarly, we know that the image of b is an element z such that b=g(z).

f(a)=ya=g(y)

f(b)=zb=g(z)

f(a)=f(b) then implies that the two elements y and z need to be the same

y=

### Still sussing out bartleby?

Check out a sample textbook solution.

See a sample solution

#### The Solution to Your Study Problems

Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!

Get Started 