Intersecting shadow lemma ($|\partial \mathcal{F}|\ge |\mathcal{F}|$)

For an intersecting family of $r$-sets with $r\ge 1$, its lower shadow has at least as many members as the family. Apply elementary set shifts and then the ballot reflection injection to obtain this bound.