feat: simplify propositional binder domains in `Sym.simp` (#15623) This PR makes the `Sym.simp`-based `grind` normalizer rewrite dependent propositional binder domains, so `∀ h : i < a.size, q h` becomes `∀ h : i + 1 ≤ a.size, ...` as with the legacy normalizer. `Sym.Simp.simpForall'` treated every dependent binder as opaque. It now simplifies `Prop` domains and rewrites them with `forall_prop_congr_dom` or `forall_prop_domain_congr`, replacing the bound variable by the cast `h.substr a`. The new pre-simproc `simpExistsPropDomain` does the same for `∃` using the new lemma `exists_prop_congr_dom`. 🤖 Generated with [Claude Code](https://claude.com/claude-code) 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.