[Merged by Bors] - chore(Data/Finset/Powerset): Fix decidability instances #11672
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Typeclass search cannot sy,thesize `∀ t ⊆ s, Decidable (p t)` hypothesis, hence the instance could never fire. Fix it and compress back the binders, both in the instancs and `Combinatorics.Additive.SalemSpencer` where they were supposed to be used.
YaelDillies
added
the
awaiting-review
leanprover-community-mathlib4-bot
added
the
merge-conflict
leanprover-community-mathlib4-bot
removed
the
merge-conflict
|
✌️ YaelDillies can now approve this pull request. To approve and merge a pull request, simply reply with |
leanprover-community-mathlib4-bot
added
delegated
and removed
awaiting-review
mathlib-bors bot
pushed a commit
that referenced
this pull request
Apr 16, 2024
Typeclass search cannot synthesize `∀ t ⊆ s, Decidable (p t)` hypothesis, hence the instance could never fire. Fix it and compress back the binders, both in the instancs and `Combinatorics.Additive.SalemSpencer` where they were supposed to be used.
|
Pull request successfully merged into master. Build succeeded: |
mathlib-bors
bot
changed the title
uniwuni
pushed a commit
that referenced
this pull request
Apr 19, 2024
Typeclass search cannot synthesize `∀ t ⊆ s, Decidable (p t)` hypothesis, hence the instance could never fire. Fix it and compress back the binders, both in the instancs and `Combinatorics.Additive.SalemSpencer` where they were supposed to be used.
callesonne
pushed a commit
that referenced
this pull request
Apr 22, 2024
Typeclass search cannot synthesize `∀ t ⊆ s, Decidable (p t)` hypothesis, hence the instance could never fire. Fix it and compress back the binders, both in the instancs and `Combinatorics.Additive.SalemSpencer` where they were supposed to be used.
Jun2M
pushed a commit
that referenced
this pull request
Apr 24, 2024
Typeclass search cannot synthesize `∀ t ⊆ s, Decidable (p t)` hypothesis, hence the instance could never fire. Fix it and compress back the binders, both in the instancs and `Combinatorics.Additive.SalemSpencer` where they were supposed to be used.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Typeclass search cannot synthesize
∀ t ⊆ s, Decidable (p t)hypothesis, hence the instance could never fire. Fix it and compress back the binders, both in the instancs andCombinatorics.Additive.SalemSpencerwhere they were supposed to be used.