This PR adds support in the `grind` tactic for propagating dependent forall terms `forall (h : p), q[h]` where `p` is a proposition. |
||
|---|---|---|
| .. | ||
| Cases.lean | ||
| Lemmas.lean | ||
| Norm.lean | ||
| Propagator.lean | ||
| Tactics.lean | ||
| Util.lean | ||
This PR adds support in the `grind` tactic for propagating dependent forall terms `forall (h : p), q[h]` where `p` is a proposition. |
||
|---|---|---|
| .. | ||
| Cases.lean | ||
| Lemmas.lean | ||
| Norm.lean | ||
| Propagator.lean | ||
| Tactics.lean | ||
| Util.lean | ||