Alternating Sum and Difference of r Choose k up to n

Theorem
Let $$r \in \R, n \in \Z$$.

Then:
 * $$\sum_{k \le n} \left({-1}\right)^k \binom r k = \left({-1}\right)^n \binom {r - 1} n$$

Proof
$$ $$ $$