Use the following theorem to show that the set of irrational numbers is equinumerous to the set of real numbers

The theorem states. Let A be a set and Let c be a non empty countable set disjoint from A. If A has a denumerable subset then A union C is equinumerous to A and conversely.

I was thinking of letting A be the rational numbers, and letting C be the irrational numbers that way it's disjoint, and then the subset of A would be integers, but then so the union of integers and irrational numbers would be equinumerous to rational numbers, but that doesn't help with the equinumerous of irrational and real numbers. Not sure what to do.

Let $A$ be the irrational number and $C$ be the rational number, then $A$ and $C$ are disjoint.
Check that $A$ has a denumerable subset and you can conclude that $A \cup C = \mathbb{R}$ is equinumerous to $A$, the set of irrational numbers.
What remains for you to do is to check that $A$ has a denumerable subset, can you complete that?
• hmmm, the set of irrational numbers less than $\sqrt2$ is not denumerable. Hint: $\{ 1, 2, \ldots, \}$ is denumerable, try to link them with $\sqrt2$ to make it irrational. – Siong Thye Goh Apr 23 '18 at 5:12
• Just multiply $\mathbb{N}$ with $\sqrt2$ elementwise. you can also do addition, subtraction, division. – Siong Thye Goh Apr 23 '18 at 5:16