fix: eta-reduce lambda arguments before simplifying them in the `Sym.simp` `grind` normalizer This PR makes the `Sym.simp`-based `grind` normalizer (`backward.grind.normalizer := false`) eta-reduce the lambda arguments of an application before their bodies are simplified, so `id (fun x => Nat.succ x) = id Nat.succ` closes: the lambda becomes `Nat.succ` instead of `fun x => x + 1`, which nothing could relate to the unapplied `Nat.succ`. The legacy normalizer closed such goals through `eq_self` up to definitional equality, which `Sym.simp` does not use. The step is the pre-simproc `NormSym.etaReduce`, run after beta reduction. It leaves the bodies of binder notations (`Exists`, `Subtype`) alone, so `∃ y, q x y` keeps its binder, and `grind` internalizes eta-reduced terms anyway. Co-Authored-By: Claude Fable 5.1 <noreply@anthropic.com>
This is the repository for Lean 4.
See Install Lean.
Please read our Contribution Guidelines first.
See Building Lean.