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. |
||
---|---|---|
.. | ||
basic.lean | ||
decl.lean | ||
default.lean | ||
div.lean | ||
nat.md | ||
order.lean | ||
sub.lean |