refactor: rename SN.isNormalizable to SN.normalizable - #736
Conversation
|
Hi @chenson2018 Our main goal is to verify the smallest basis of untyped lambda calculus. |
b1212c5 to
e59c556
Compare
|
|
|
I have reproved |
Can you update the title and description to reflect this? |
|
seems reasonable to me -- possibly the name should also be changed to |
SN.isNormalizable to SN.normalizable
`SN.to_WN (hx : SN r x) : Normalizable r x` Proves that strong normalization implies weak normalization by induction on the SN structure, constructing the normal form via the single reduction step when a successor exists.
|
The rename also needs to be applied to other usages of this theorem, otherwise LGTM |
Reprove `SN.isNormalizable to move SN-related theorems adjacent
Old proof use
Terminating.subtype_snNew proof just
by_cases (∃ y, r x y)