f20cae3729
This PR sets the `irreducible` attribute before generating the equations for recursive definitions. This prevents these equations to be marked as `defeq`, which could lead to `simp` generation proofs that do not type check at default transparency. This issue is surfacing more easily since well-founded recursion on `Nat` is implemented with a dedicated fix point operator (#7965). Before that, `WellFounded.fix` was used, which is inherently not reducing, so we did get the desired result even without the explicit reducibility setting. Fixes #12398. |
||
|---|---|---|
| .. | ||
| Basic.lean | ||
| Basic2.lean | ||
| ConflictingImported.lean | ||
| Imported.lean | ||
| ImportedAll.lean | ||
| ImportedAllImportedAll.lean | ||
| ImportedAllPrivateImported.lean | ||
| ImportedImportedAll.lean | ||
| ImportedPrivateImported.lean | ||
| MetaImported.lean | ||
| NonModule.lean | ||
| PrivateImported.lean | ||