f7c4edc2b7
This PR adds support in the `grind` tactic for propagating dependent forall terms `forall (h : p), q[h]` where `p` is a proposition.
6 lines
207 B
Text
6 lines
207 B
Text
opaque f (a : Array Bool) (i : Nat) (h : i < a.size) : Bool
|
||
|
||
set_option trace.grind.eqc true
|
||
|
||
example : (p ∨ ∀ h : i < a.size, f a i h) → (hb : i < b.size) → a = b → ¬p → f b i hb := by
|
||
grind
|