Skip to content
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

Closed
wants to merge 1 commit into from

Conversation

YaelDillies
Copy link
Collaborator

The classical decidability instances were found in theorem statements, making them harder to use.


Open in Gitpod

The classical decidability instances were found in theorem statements, making them harder to use.
@YaelDillies YaelDillies added awaiting-review The author would like community review of the PR t-combinatorics Combinatorics labels May 1, 2024
@@ -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
Copy link
Member

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 variables was deliberate to affect the order.

Copy link
Member

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

Copy link
Collaborator Author

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!

Copy link
Member

@eric-wieser eric-wieser left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

bors merge

@leanprover-community-mathlib4-bot leanprover-community-mathlib4-bot added ready-to-merge This PR has been sent to bors. and removed awaiting-review The author would like community review of the PR labels May 1, 2024
mathlib-bors bot pushed a commit that referenced this pull request May 1, 2024
The classical decidability instances were found in theorem statements, making them harder to use.
mathlib-bors bot pushed a commit that referenced this pull request May 1, 2024
The classical decidability instances were found in theorem statements, making them harder to use.
@mathlib-bors
Copy link

mathlib-bors bot commented May 2, 2024

Pull request successfully merged into master.

Build succeeded:

@mathlib-bors mathlib-bors bot changed the title chore(SimpleGraph/Regularity): Don't use Classical [Merged by Bors] - chore(SimpleGraph/Regularity): Don't use Classical May 2, 2024
@mathlib-bors mathlib-bors bot closed this May 2, 2024
@mathlib-bors mathlib-bors bot deleted the srl_no_classical branch May 2, 2024 00:23
apnelson1 pushed a commit that referenced this pull request May 12, 2024
The classical decidability instances were found in theorem statements, making them harder to use.
callesonne pushed a commit that referenced this pull request May 16, 2024
The classical decidability instances were found in theorem statements, making them harder to use.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
ready-to-merge This PR has been sent to bors. t-combinatorics Combinatorics
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

3 participants