 The first simplification is that the lambda calculus treats functions "anonymously", without giving them explicit names.For example, the function 
can be rewritten in "anonymous form" as 
(read as "a tuple of and is mapped to formula_6").Similarly, 
can be rewritten in anonymous form as
where the input is simply mapped to itself.