Give an alternative “combinatorial” proof of Corollary 2.1.2 by using the definition of \(C(n, r)\).

Everytime we are picking \(n-r\) objects from \(n\) we are also implicitly picking \(r\) objects (simply by leaving them aside) so the number of ways must be equal.