chore(Logic/Relation): golf using grind#41610
Conversation
SnirBroshi
commented
Jul 11, 2026
PR summary 87e8eb9264Import changes for modified filesNo significant changes to the import graph Import changes for all files
|
|
!radar |
|
Benchmark results for 87e8eb9 against c368140 are in. No significant results found. @themathqueen
Small changes (1🟥)
|
| | symm => apply h.symm; assumption | ||
| | trans _ _ _ _ _ hab hbc => exact h.trans hab hbc) | ||
| (EqvGen.rel a b) | ||
| ⟨by intro h; induction h <;> grind [Equivalence], .rel a b⟩ |
There was a problem hiding this comment.
| ⟨by intro h; induction h <;> grind [Equivalence], .rel a b⟩ | |
| ⟨fun h ↦ by induction h <;> grind [Equivalence], .rel a b⟩ |
|
Here and in your other grind golfing PR: can you add a performance comparison (look at |
| · exact Or.inr (single bd) | ||
| · cases U bd be | ||
| exact Or.inl ec | ||
| · grind [cases_head IH, Relator.RightUnique] |
There was a problem hiding this comment.
At the most extreme the whole proof could even be
induction ab with grind [→ cases_head, Relator.RightUnique]though some compromise inbetween along the spectrum of readability/performance is probably preferable