Constructive Lemmas |
T!x. x = x!b f h t. case_list b f (CONS h t) = f h t!b f. case_list b f [] = b!p1 p2 q1 q2. (p1 ==> p2) /\ (q1 ==> q2) ==> p1 /\ q1 ==> p2 /\ q2!p1 p2 q1 q2. (p1 ==> p2) /\ (q1 ==> q2) ==> p1 \/ q1 ==> p2 \/ q2!p q. (!x. p x ==> q x) ==> (?x. p x) ==> (?x. q x)!p. p [] /\ (!h t. p t ==> p (CONS h t)) ==> (!l. p l)T <=> (\p. p) = (\p. p)(/\) = (\p q. (\f. f p q) = (\f. f T T))(==>) = (\p q. p /\ q <=> p)(\/) = (\p q. !r. (p ==> r) ==> (q ==> r) ==> r)(!) = (\p. p = (\x. T))(?) = (\p. !q. (!x. p x ==> q) ==> q) |