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

feat(data/finset): lemmas for folding min and max #1774

Merged
merged 2 commits into from
Dec 4, 2019
Merged

Conversation

jcommelin
Copy link
Member

From the perfectoid project.

Copy link
Member

@fpvandoorn fpvandoorn left a comment

Choose a reason for hiding this comment

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

Nice refactoring of the proofs. Unfortunate that there is some massaging required to apply the general statements. But LGTM in any case.

@fpvandoorn fpvandoorn added the ready-to-merge All that is left is for bors to build and merge this PR. (Remember you need to say `bors r+`.) label Dec 3, 2019
@mergify mergify bot merged commit b031290 into master Dec 4, 2019
@mergify mergify bot deleted the finset-min-max branch December 4, 2019 00:28
anrddh pushed a commit to anrddh/mathlib that referenced this pull request May 15, 2020
anrddh pushed a commit to anrddh/mathlib that referenced this pull request May 16, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
ready-to-merge All that is left is for bors to build and merge this PR. (Remember you need to say `bors r+`.)
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

2 participants