)]}'
{
  "commit": "4d2bb938a7c8686ae4c17c361316b079cea3c5f4",
  "tree": "99e2c4a52982afac7396551235941c2710cafad8",
  "parents": [
    "ca9b804163b528188fd7e386fc9646d2df47c009"
  ],
  "author": {
    "name": "Leonardo de Moura",
    "email": "leomoura@amazon.com",
    "time": "Wed Jul 16 09:55:38 2025 -0700"
  },
  "committer": {
    "name": "Leonardo de Moura",
    "email": "leomoura@amazon.com",
    "time": "Wed Jul 16 09:58:12 2025 -0700"
  },
  "message": "perf: avoid \"dependent implications\" as local E-matching theorems in `grind`\n\nThis PR implements a simple optimization: dependent implications are\nno longer treated as E-matching theorems in `grind`. In\n`grind_bitvec2.lean`, this change saves around 3 seconds, as many\ndependent implications are generated. Example:\n```lean\n ∀ (h : i + 1 ≤ w), x.abs.getLsbD i \u003d x.abs[i]\n ```\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "c48bf112c3d0dc03c474502269d212ae7665d6e9",
      "old_mode": 33188,
      "old_path": "src/Lean/Meta/Tactic/Grind/ForallProp.lean",
      "new_id": "9bae65c4397e08e7a38033e0bc8524fa4b7f783b",
      "new_mode": 33188,
      "new_path": "src/Lean/Meta/Tactic/Grind/ForallProp.lean"
    }
  ]
}
