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] - feat(Data/Set/Intervals/Disjoint): i[Inter|Union]_Ii[c|o]... #10298
Conversation
mo271
commented
Feb 6, 2024
This prepares removing some lemmas from |
@@ -253,4 +255,26 @@ theorem iUnion_Iic_eq_Iic_iSup {R : Type*} [CompleteLinearOrder R] {f : ι → R | |||
@iUnion_Ici_eq_Ici_iInf ι (OrderDual R) _ f has_greatest_elem | |||
#align Union_Iic_eq_Iic_supr iUnion_Iic_eq_Iic_iSup | |||
|
|||
theorem iUnion_Iio_of_not_bddAbove_range (hf : ¬ BddAbove (range f)) : |
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.
Please add order-dual versions (probably using the OrderDual
trick).
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 thought the version below, now renamed iUnion_Iio_eq_univ_iff
and iInter_Iio_eq_empty_iff
are duals of each other. Do you mean some other sort of dual statement? If yes, which one?
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.
ping @urkud
@@ -253,4 +255,26 @@ theorem iUnion_Iic_eq_Iic_iSup {R : Type*} [CompleteLinearOrder R] {f : ι → R | |||
@iUnion_Ici_eq_Ici_iInf ι (OrderDual R) _ f has_greatest_elem | |||
#align Union_Iic_eq_Iic_supr iUnion_Iic_eq_Iic_iSup | |||
|
|||
theorem iUnion_Iio_of_not_bddAbove_range (hf : ¬ BddAbove (range f)) : | |||
⋃ i, Iio (f i) = univ := by | |||
simpa [not_bddAbove_iff, Set.eq_univ_iff_forall] using hf |
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.
simpa
says that it can be an iff
lemma.
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.
Made it an iff
lemma.
Is the name good like this?
ac2a85d
to
dd3f397
Compare
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 just have comments about the names, to make them match the other lemmas you introduce. Apart from that, LGTM.
bors d+
✌️ mo271 can now approve this pull request. To approve and merge a pull request, simply reply with |
bors r+ |
Co-authored-by: Moritz Firsching <firsching@google.com>
Build failed (retrying...): |
will fix the build... |
Co-authored-by: Rémy Degenne <remydegenne@gmail.com>
Co-authored-by: Rémy Degenne <remydegenne@gmail.com>
e29b9c7
to
0599398
Compare
Canceled. |
fixed the name and rebased |
bors r+ |
Co-authored-by: Moritz Firsching <firsching@google.com>
Pull request successfully merged into master. Build succeeded: |
- [x] depends on: #10298 Co-authored-by: Moritz Firsching <firsching@google.com>
Co-authored-by: Moritz Firsching <firsching@google.com>
- [x] depends on: #10298 Co-authored-by: Moritz Firsching <firsching@google.com>
Co-authored-by: Moritz Firsching <firsching@google.com>
- [x] depends on: #10298 Co-authored-by: Moritz Firsching <firsching@google.com>
Co-authored-by: Moritz Firsching <firsching@google.com>
- [x] depends on: #10298 Co-authored-by: Moritz Firsching <firsching@google.com>
Co-authored-by: Moritz Firsching <firsching@google.com>
- [x] depends on: #10298 Co-authored-by: Moritz Firsching <firsching@google.com>