feat(ConditionallyCompleteLattice/Indexed): add binary versions of lemmas#38906
feat(ConditionallyCompleteLattice/Indexed): add binary versions of lemmas#38906lua-vr wants to merge 6 commits into
Conversation
PR summary 8eb1ca9e64Import changes for modified filesNo significant changes to the import graph Import changes for all files
|
|
-awaiting-author |
|
This pull request has conflicts, please merge |
|
This pull request has conflicts, please merge |
e6f56e2 to
cfd711c
Compare
| theorem ciSup_le' {f : ι → α} {a : α} (h : ∀ i, f i ≤ a) : ⨆ i, f i ≤ a := | ||
| csSup_le' <| forall_mem_range.2 h | ||
|
|
||
| theorem ciSup₂_le' {f : ∀ i, κ i → α} (h : ∀ i j, f i j ≤ a) : ⨆ (i) (j), f i j ≤ a := |
There was a problem hiding this comment.
Please also add the dual of the theorem. Otherwise it will be more annoying when we do tag the whole file with to_dual.
There was a problem hiding this comment.
Sadly ConditionallyCompleteLinearOrderBot has no dual, so none of the theorems around here can be to_dualized
There was a problem hiding this comment.
Ah that's too bad, in that case ignore my comment.
There was a problem hiding this comment.
@JovanGerb in #38938 I made an attempt to tag the whole file with to_dual (but this section was not included)
Add binary versions of some of the lemmas. Those are useful when the domain is indexed over the members of a set.
From the Carleson project.