- Show the set $A=\{(m,n)\in N\times N : m\leq n\}$ is countably infinite. 
*

*Show the set $A=\{(m,n)\in N\times N : m\leq n\}$ is countably infinite.


If $A$ is countable then we need to show that there is a bijection between $A$ and $\mathbb{N}$, but how can I show $A$ is countably infinite? 
Thanks...

Note that $A$ can be written as 
$$
A = \bigsqcup_{n \in \mathbb{N}}\{(m,n) : m \leq n\}.
$$
That is, $A$ is the disjoint countable union of sets $F_n = \{(m,n) : m \leq n\}$. These are finite: for a fixed $n$, the set $F_n$ has $n$ elements, namely $(1,n) , (2,n) \dots, (n,n)$. Thus $A$ is a countable union of countable sets, which says that $A$ itself is countable. 
To see that is is infinite, observe that the mapping $d : n \in \mathbb{N} \mapsto (n,n) \in A$ is injective, and so $A$ cannot have a finite amount of elements.
