I suppose another example would be those proofs by induction in which you don't need a basis, although no nice examples come to mind instantly.  Here I mean proofs in which you show that if $P(m)$ for all $m < n$, then $P(n)$.  You don't need to show $P(n)$ holds for the smallest value of $n$, since it is vacuously true that $P(m)$ holds for all smaller values, and therefore the thing proved in the inductive step entails the smallest instance as a special case.

This works not only for integers, but for infinite ordinals.