sum_list / max_list <-> foldr
in this PR, I:
- prove that
sum_listandmax_listcorrespond tofoldr. - this lets me easily prove a
Properinstance forPermutation. - using this, i simplify the proof that
reverseis preserved by the two ops.
this resolves most of #111 (closed), except for adding TC opaqueness. is this necessary? i'd imagine that since the correspondence is only an equality lemma, it won't get used in TC search.