[Merged by Bors] - feat(Order/Zorn): change zorn to use Maximal API#14781
[Merged by Bors] - feat(Order/Zorn): change zorn to use Maximal API#14781
Conversation
PR summary f665fa8f24
|
| File | Base Count | Head Count | Change |
|---|---|---|---|
| Mathlib.Order.Zorn | 344 | 352 | +8 (+2.33%) |
| Mathlib.Order.Extension.Linear | 345 | 353 | +8 (+2.32%) |
| Mathlib.SetTheory.Cardinal.SchroederBernstein | 382 | 390 | +8 (+2.09%) |
| Mathlib.Order.ZornAtoms | 362 | 365 | +3 (+0.83%) |
| Mathlib.Order.PrimeSeparator | 402 | 403 | +1 (+0.25%) |
Import changes for all files
| Files | Import difference |
|---|---|
Mathlib.Order.PrimeSeparator |
1 |
Mathlib.Order.ZornAtoms |
3 |
3 filesMathlib.Order.Zorn Mathlib.SetTheory.Cardinal.SchroederBernstein Mathlib.Order.Extension.Linear |
8 |
Declarations diff
+ zorn_le
+ zorn_le_nonempty
+ zorn_le_nonempty_Ici₀
+ zorn_le_nonempty₀
+ zorn_le₀
- zorn_nonempty_Ici₀
- zorn_nonempty_partialOrder
- zorn_nonempty_partialOrder₀
- zorn_nonempty_preorder
- zorn_nonempty_preorder₀
- zorn_partialOrder
- zorn_partialOrder₀
- zorn_preorder
- zorn_preorder₀
You can run this locally as follows
## summary with just the declaration names:
./scripts/declarations_diff.sh <optional_commit>
## more verbose report:
./scripts/declarations_diff.sh long <optional_commit>The doc-module for script/declarations_diff.sh contains some details about this script.
j-loreaux
left a comment
There was a problem hiding this comment.
Looks relatively reasonable, but here are some comments.
| obtain ⟨Jset, _, hmax⟩ := zorn_subset_nonempty S chainub I IinS | ||
| obtain ⟨Jidl, IJ, JF⟩ := hmax.prop |
There was a problem hiding this comment.
I see this pattern a lot in this PR. Should we just have an additional lemma besides zorn_subset_nonempty that does the second step deconstruction too?
Co-authored-by: Jireh Loreaux <loreaujy@gmail.com>
Co-authored-by: Jireh Loreaux <loreaujy@gmail.com>
Co-authored-by: Jireh Loreaux <loreaujy@gmail.com>
Co-authored-by: Jireh Loreaux <loreaujy@gmail.com>
Co-authored-by: Jireh Loreaux <loreaujy@gmail.com>
Co-authored-by: Jireh Loreaux <loreaujy@gmail.com>
Co-authored-by: Jireh Loreaux <loreaujy@gmail.com>
|
LGTM now. maintainer merge |
|
🚀 Pull request has been placed on the maintainer queue by j-loreaux. |
|
!bench |
|
Here are the benchmark results for commit f665fa8. |
|
bors merge |
We change statements of Zorn's lemma to use the new `Maximal` API from #14721. The new definitions eliminate the need for separate `PartialOrder` and `Preorder` versions of Zorn's lemma, and slightly simplify most of its applications. The new statements of Zorn aren't defeq to the old ones, so a good number of files are touched, but very few theorem statements outside `Order.Zorn` itself are actually changed - most changes are small modifications of existing proofs. - [x] depends on: #14721
|
Pull request successfully merged into master. Build succeeded: |
We change statements of Zorn's lemma to use the new `Maximal` API from #14721. The new definitions eliminate the need for separate `PartialOrder` and `Preorder` versions of Zorn's lemma, and slightly simplify most of its applications. The new statements of Zorn aren't defeq to the old ones, so a good number of files are touched, but very few theorem statements outside `Order.Zorn` itself are actually changed - most changes are small modifications of existing proofs. - [x] depends on: #14721
We change statements of Zorn's lemma to use the new `Maximal` API from #14721. The new definitions eliminate the need for separate `PartialOrder` and `Preorder` versions of Zorn's lemma, and slightly simplify most of its applications. The new statements of Zorn aren't defeq to the old ones, so a good number of files are touched, but very few theorem statements outside `Order.Zorn` itself are actually changed - most changes are small modifications of existing proofs. - [x] depends on: #14721
We change statements of Zorn's lemma to use the new `Maximal` API from #14721. The new definitions eliminate the need for separate `PartialOrder` and `Preorder` versions of Zorn's lemma, and slightly simplify most of its applications. The new statements of Zorn aren't defeq to the old ones, so a good number of files are touched, but very few theorem statements outside `Order.Zorn` itself are actually changed - most changes are small modifications of existing proofs. - [x] depends on: #14721
We change statements of Zorn's lemma to use the new
MaximalAPI from #14721. The new definitions eliminate the need for separatePartialOrderandPreorderversions of Zorn's lemma, and slightly simplify most of its applications.The new statements of Zorn aren't defeq to the old ones, so a good number of files are touched, but very few theorem statements outside
Order.Zornitself are actually changed - most changes are small modifications of existing proofs.