lean4-htt

Author SHA1 Message Date

Author	SHA1	Message	Date
Leonardo de Moura	849a252b20	fix: case split on data in `grind` (#6781 ) This PR fixes the support for case splitting on data in the `grind` tactic. The following example works now: ```lean inductive C where \| a \| b \| c def f : C → Nat \| .a => 2 \| .b => 3 \| .c => 4 example : f x > 1 := by grind [ f, -- instructs `grind` to use `f`-equation theorems, C -- instructs `grind` to case-split on free variables of type `C` ] ```	2025-01-26 02:14:08 +00:00
Leonardo de Moura	a062eea204	feat: beta reduction in `grind` (#6700 ) This PR adds support for beta reduction in the `grind` tactic. `grind` can now solve goals such as ```lean example (f : Nat → Nat) : f = (fun x : Nat => x + 5) → f 2 > 5 := by grind ```	2025-01-19 21:29:24 +00:00

Leonardo de Moura

849a252b20

fix: case split on data in grind (#6781 )

This PR fixes the support for case splitting on data in the `grind`
tactic. The following example works now:
```lean
inductive C where
  | a | b | c

def f : C → Nat
  | .a => 2
  | .b => 3
  | .c => 4

example : f x > 1 := by
  grind [
      f, -- instructs `grind` to use `f`-equation theorems, 
      C -- instructs `grind` to case-split on free variables of type `C`
  ]
```

2025-01-26 02:14:08 +00:00

Leonardo de Moura

a062eea204

feat: beta reduction in grind (#6700 )

This PR adds support for beta reduction in the `grind` tactic. `grind`
can now solve goals such as
```lean
example (f : Nat → Nat) : f = (fun x : Nat => x + 5) → f 2 > 5 := by
  grind
```

2025-01-19 21:29:24 +00:00

2 commits