Constants in the pure lambda calculus can be defined as functions. For example, T for the "true" constant and F for the "false" constant can be defined as follows:

T = x . y . x F = x . y . y

Prove that the following function:

AND = x . y . x y F

is the logical "and" function.