fix: normalize `-0 : Int` to `0` (#15363)

This PR fixes a `grind` failure on goals containing `-0 : Int`, such as
`f (-((0 : Nat) : Int)) = f 0`, where `grind` produced a proof rejected
by the kernel. `-0` is now normalized to `0`.

The simproc `Int.reduceNeg` keeps `-n` for a literal `n` as the normal
form of negative integer literals, and so left `-0` alone. `grind` marks
literals as interpreted terms and closes the goal with `decide (a = b) =
false` whenever two different interpreted terms of the same type are
merged; for `-0` and `0` that proof does not type check. `Int.reduceNeg`
now maps `-0` to `0`, so `simp` and `grind`'s normalizer produce the
canonical form.

🤖 Generated with [Claude Code](https://claude.com/claude-code)

---------

Co-authored-by: Claude Fable 5.1 <noreply@anthropic.com>
3 files changed