-
Notifications
You must be signed in to change notification settings - Fork 243
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
[Merged by Bors] - chore(SimpleGraph/Regularity): Don't use Classical
#12575
Conversation
The classical decidability instances were found in theorem statements, making them harder to use.
@@ -105,7 +108,7 @@ private theorem distinctPairs_increment : | |||
|
|||
private lemma pairwiseDisjoint_distinctPairs : | |||
(P.parts.offDiag.attach : Set {x // x ∈ P.parts.offDiag}).PairwiseDisjoint | |||
(distinctPairs G ε hP) := by |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Is this argument ordering desirable? I think it's likely that the original non-use of variable
s was deliberate to affect the order.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Oh nevermind, it's private
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I will also note that "original" here means "written by 2021 me", so I don't feel too bad for impeding on myself!
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
bors merge
Pull request successfully merged into master. Build succeeded: |
Classical
Classical
The classical decidability instances were found in theorem statements, making them harder to use.