This PR implements support for auto-generated congruence theorems in `Sym.simp`, enabling simplification of functions with complex argument dependencies such as proof arguments and `Decidable` instances. Previously, `Sym.simp` used basic congruence lemmas (`congrArg`, `congrFun`, `congrFun'`, `congr`) to construct proofs when simplifying function arguments. This approach is efficient for simple cases but cannot handle functions with dependent proof arguments or `Decidable` instances that depend on earlier arguments. The new `congrThm` function applies pre-generated congruence theorems (similar to the main simplifier) to handle these complex cases. |
||
|---|---|---|
| .. | ||
| bench | ||
| bench-radar | ||
| compiler | ||
| elabissues | ||
| ir | ||
| lake | ||
| lean | ||
| pkg | ||
| playground | ||
| plugin | ||
| simpperf | ||
| .gitignore | ||
| common.sh | ||
| lakefile.toml | ||
| lean-toolchain | ||