A question on accurate attribution/description:
Lemma.- Let $Q$ be a collection of subsets of a finite set $V$, and let $S_0\subset Q$. Then $$\left|\mathop{\sum_{S_0\subset S\subset Q}}_{\bigcup S = V} (-1)^{|S|}\right|\leq 2^{|V|},$$ where we write $|X|$ for the number of elements of a finite set $X$.
The proof isn't hard (basically three lines - use inclusion-exclusion, then change the order of summation, then use inclusion-exclusion again). Taking a look at the proof of Rota's cross-cut theorem, it seems to me that the idea of the proof is the same in both cases.
Question: is it accurate to call this Lemma a special case of Rota's cross-cut theorem? (Question 2: is it really just a rephrasing of Rota's cross-cut theorem, i.e., equivalent to it?)