The type-correctness of binary_rec_eq (the statement, not the proof) depends on unfolding the embedded well-founded definition of mod. This definition avoids it by using two simpler functions bodd and div2 that reduce well in the kernel. |
||
|---|---|---|
| .. | ||
| data | ||
| init | ||
| smt | ||
| system | ||
| tools/debugger | ||
| leanpkg.path | ||
| library.md | ||
| standard.lean | ||