Cardinality of Set of Subsets

Theorem
Let $$S$$ be a set such that $$\left|{S}\right| = n$$.

Then if $$m \le n$$, the number of subsets $$T$$ of $$S$$ such that $$\left|{T}\right| = m$$ is $$\frac {n!} {m! \left({n - m}\right)!}$$

Proof
For each $$X \subseteq \mathbb{N}_n$$ and $$Y \subseteq S$$, let $$B \left({X, Y}\right)$$ be the set of all bijections from $$X$$ onto $$Y$$.

Let $$\mathbb{S}$$ be the set of all subsets of $$S$$ with $$m$$ elements.

By Cardinality of Power Set and Proper Subset has Fewer Elements, $$\mathbb{S}$$ is finite, so let $$s = \left|{\mathbb{S}}\right|$$.

Let $$\beta: B \left({\mathbb{N}_n, S}\right) \to \mathbb{S}$$ be the mapping defined as $$\forall f \in B \left({\mathbb{N}_n, S}\right): \beta \left({f}\right) = f \left({\mathbb{N}_m}\right)$$.

For each $$Y \in \mathbb{S}$$, the mapping:

$$\Phi_Y: \beta^{-1} \left({Y}\right) \to B \left({\mathbb{N}_m, Y}\right) \times B \left({\mathbb{N}_n - \mathbb{N}_m, S - Y}\right)$$

defined as:

$$\Phi_Y \left({f}\right) = \left({f_{\mathbb{N}_m}, f_{\mathbb{N}_n - \mathbb{N}_m}}\right)$$

is also (clearly) a bijection.

By Cardinality of Set of Bijections, $$\left|{B \left({\mathbb{N}_m, Y}\right)}\right| = m!$$ and $$\left|{B \left({\mathbb{N}_n - \mathbb{N}_m, S - Y}\right)}\right| = n!$$.

So by Cardinality of Cartesian Product, $$\left|{\beta^{-1} \left({Y}\right)}\right| = m! \left({n - m}\right)!$$.

It is clear that $$\left\{{\beta^{-1} \left({Y}\right): Y \in \mathbb{S}}\right\}$$ is a partition of $$B \left({\mathbb{N}_n, S}\right)$$.

Therefore by Number of Elements in Partition, $$\left|{B \left({\mathbb{N}_n, S}\right)}\right| = m! \left({n - m}\right)! s$$.

Consequently, as $$\left|{B \left({\mathbb{N}_n, S}\right)}\right| = n!$$ by Cardinality of Set of Bijections, it follows that $$m! \left({n - m}\right)! s = n!$$ and the result follows.

Comment
This expression crops so often in mathematics it has been given a special notation.

For all $$m, n \in \mathbb{N}$$, the number of subsets of $$m$$ elements of a set having $$n$$ elements is defined as:

$$ \forall m, n \in \mathbb{N}: \binom n m = \begin{cases} \frac {n!} {m! \left({n - m}\right)!} & : m \le n \\ 0 & : m > n \end{cases} $$

The number $$\binom n m$$ is known as a binomial coefficient.

The reason for this is apparent from the Binomial Theorem.