064ecd3e3d
We also define key theorems that will be used to generate the automatically generated a well-founded subterm relation for inductive datatypes. We also prove decidability and wf theorems asap.
5 lines
182 B
Text
5 lines
182 B
Text
whnf.lean:2:0: warning: imported file uses 'sorry'
|
||
succ (nat.rec 2 (λ (b₁ r : ℕ), succ r) zero)
|
||
succ (succ (succ zero))
|
||
succ (nat.rec a (λ (b₁ r : ℕ), succ r) zero)
|
||
succ a
|