| Entry |
Value |
|
Name |
foldr_reverse |
|
Conclusion |
!f b l. foldr f b (REVERSE l) = foldl (C f) b l |
|
Constructive Proof |
Yes |
|
Axiom |
(\a. a = (\b. (\c. c) = (\c. c))) (\d. (\e. d e) = d) |
|
Classical Lemmas |
N|A |
|
Constructive Lemmas |
T!x y. x = y <=> y = x!x y. x = y ==> y = x!x. x = x!t. (!x. t) <=> t!t. F ==> t <=> T!t. T ==> t <=> t!t. t ==> F <=> ~t!t. t ==> T <=> T!t. t ==> t!f y. (\x. f x) y = f y!f g. (!x. f x = g x) <=> f = g!f g. (!x. f x = g x) ==> f = g!t. (\x. t x) = t!f x y. C f x y = f y x!f. C (C f) = f!f b l. foldl f b l = foldr (C f) b (REVERSE l)F <=> (!p. p)T <=> (\p. p) = (\p. p)(~) = (\p. p ==> F)(/\) = (\p q. (\f. f p q) = (\f. f T T))(==>) = (\p q. p /\ q <=> p)(!) = (\p. p = (\x. T))C = (\f x y. f y x) |
|
Contained Package |
list-fold-thm |
|
Comment |
Standard HOL library retrieved from OpenTheory |
