Lambda Calculus

Using the definitions of boolean constants and operators presented in class, show that the following evaluates to true. Show all your steps for a perfect mark. Always evaluate the "outer" applications first (i.e., use lazy evaluation), but continue to evaluate further until you obtain true.

or true (not true)

true = false = not = or = and = \x.ly.(x) x.ly.(y) Iv.dw.lx.(v x w) lv.dw.(v v w) \v.dw.(v wv) true = false = not = or = and = \x.ly.(x) x.ly.(y) Iv.dw.lx.(v x w) lv.dw.(v v w) \v.dw.(v wv)