Finite Ramsey theorem

For positive integers $r,k,m$, there is $n$ such that every $k$-coloring of the $r$-element subsets of $[n]$ has a monochromatic $m$-element subset. A diagonal compactness argument deduces this from Ramsey's theorem.