Binomial Coefficient is Integer

Theorem
Let $\dbinom n k$ be a binomial coefficient.

Then $\dbinom n k$ is an integer.

Proof 1
If it is not the case that $0 \le k \le n$, then the result holds trivially.

So let $0 \le k \le n$.

By the definition of binomial coefficients:

The numerator is a product of $k$ successive numbers.

From Factorial Divides Product of Successive Numbers, $k!$ divides it.

Proof 2
The result follows by Pascal's Rule and Integer Addition is Closed.