refactor(Combinatorics/SimpleGraph): no proof obligation in rotate#36814
refactor(Combinatorics/SimpleGraph): no proof obligation in rotate#36814YaelDillies wants to merge 3 commits intoleanprover-community:masterfrom
rotate#36814Conversation
PR summary 28f63a901bImport changes for modified filesNo significant changes to the import graph Import changes for all files
|
|
Could you elaborate on the tradeoff here in the description? The obvious downside is that the proof can no longer be found by unification in lemmas about the definition. Are there enough places where having a total (junk) function is beneficial to warrant this loss? |
|
Doesn't this mean that goals with |
|
This pull request has conflicts, please merge |
If the walk doesn't go through the new vertex, return `nil` instead.
71af528 to
02c9f4f
Compare
|
I understand the tradeoff. I do not have an application for removing the proof field and opened the PR solely because we do tend to prefer junk values over propositional arguments (eg |
|
Yeah I agree this definition feels nicer because it doesn't require a hypothesis in the def, but Eric's point about the unification is a good one. In the diff, it's true that proof obligations aren't provided more, but that could be because the places this def is used in mathlib are simple enough that the downside doesn't really appear. Maybe the sensible thing to do is shelve this PR until there's a more concrete signal that the junk value is useful, as Eric suggests |
|
Do we have a good way to "shelve" a PR? |
|
This pull request has conflicts, please merge |
If the walk doesn't go through the new vertex, return
nilinstead.