About predicative of the lambda-calculus

Based on the theorem of Nagorniy about doubling of words in the alphabet shown that lambda-calculus was predicative, unformalizable in lambda-calculus impredicative structures. This result coincides with similar findings obtained in the theory of sets with selfconsidering.