This PR changes the approach in `simpIteCbv` and `simpDIteCbv`, by replacing call to `Decidable.decide` with reducing and direct pattern matching on the `Decidable` instance for `isTrue`/`isFalse`. This produces simpler proof terms. --------- Co-authored-by: Claude Opus 4.6 <noreply@anthropic.com> |
||
|---|---|---|
| .. | ||
| 10067.lean | ||
| 10850.lean | ||
| cbv4.lean | ||
| cbv_aes.lean | ||
| cbv_arm_ldst.lean | ||
| mvcgenRflReducibility.lean | ||
| ppFVarsAnonymous.lean | ||
| test_single.sh | ||