I am learning lambda calculus and I was given the following assignment:
Working with these definitions of TRUE and FALSE:
λx y . x ≡ T
λx y . y ≡ F
I am asked to form the AND operator, that even though functions similarly, is not equivalent to the following definition of it:
∧ ≡ λx y .x y F
But everywhere I've checked this seems to be the only way to go at it. Can anyone provide any guidance as to how I should start thinking about it?