 Theorem. (Combinatorial completeness) If  \(f(x_1,\ldots,x_n)= M\) (where \(M\) is a term containing no other variables than those explicitly listed), then there is a combinator \(\textsf{X}\) such that \(\textsf{X} x_1\ldots x_n\) reduces to \(M\).  