perf: share `lia` proofs across `grind` case splits

This PR makes `lia` (cutsat) prove a constraint once, in the goal where it was stored, instead of once in every branch below it. On goals with many `grind` case splits, `lia` is up to 2.8x faster in elaboration and up to 200x faster in the kernel.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_015CAFbcjTNgTXh2gg26CRyv
17 files changed