Is the following a valid combinatorial proof of the Stirling identity?

Prove S(n,n-1) = .

First look at the partition of n into n blocks. We then have blocks . Now if we partition n into n-1 blocks, some will have to share a block. This is the same as choosing 2 from n.