If we have $m$ cats and $n$ dogs, in how many ways can we choose $k$ of the animals? By iterating through the possible combinations of dogs and cats, we can derive a combinatorial identity, which is called Vandermonde’s identity. We derive this identity here using the described combinatorial or committee-forming proof.