Lambda-calculus, Combinators and the Comprehension Scheme

The presentations of type theory based on a comprehension scheme, a skolemized comprehension scheme and λ-calculus are equivalent, both in the sense that each one is a conservative extension of the previous and that each one can be coded in the previous preserving provability. A similar result holds for set theory.