[Merged by Bors] - refactor(set_theory/ordinal/basic): ordinal.min → infi#14707
[Merged by Bors] - refactor(set_theory/ordinal/basic): ordinal.min → infi#14707
ordinal.min → infi#14707Conversation
min → Infordinal.min → infi
|
This PR/issue depends on: |
|
Getting a random timeout here too. |
eric-wieser
left a comment
There was a problem hiding this comment.
Can you update the module docstring?
urkud
left a comment
There was a problem hiding this comment.
I have two trivial comments, otherwise LGTM.
| cInf_le ⟨⊥, λ a _, bot_le⟩ h | ||
|
|
||
| theorem cinfi_le' (f : ι → α) (i : ι) : infi f ≤ f i := | ||
| cinfi_le ⟨⊥, λ a _, bot_le⟩ _ |
There was a problem hiding this comment.
We have a lemma called order_bot.bdd_below (or something very similar). Even though this lemma is trivial, it makes sense to use it here for readability.
There was a problem hiding this comment.
This lemma could be used all throughout this section. I think that would make a good small, but separate PR.
| (rel_embedding.preimage _ _).is_well_order | ||
|
|
||
| instance is_well_order.subtype_nonempty : nonempty {r // is_well_order σ r} := | ||
| ⟨⟨well_ordering_rel, infer_instance⟩⟩ |
There was a problem hiding this comment.
No, this instance isn't contained in an enclosing namespace. I think that's how it should be.
There was a problem hiding this comment.
I mean, what is the full name of this instance?
There was a problem hiding this comment.
is_well_order.subtype_nonempty is the full name.
We ditch `ordinal.min` (which is really just `infi`). Apart from this, we add some missing theorems on conditionally complete lattices with a bottom element.
|
Pull request successfully merged into master. Build succeeded: |
ordinal.min → infiordinal.min → infi
…r-community#14707) We ditch `ordinal.min` (which is really just `infi`). Apart from this, we add some missing theorems on conditionally complete lattices with a bottom element.
We ditch `ordinal.min` (which is really just `infi`). Apart from this, we add some missing theorems on conditionally complete lattices with a bottom element.
We ditch `ordinal.min` (which is really just `infi`). Apart from this, we add some missing theorems on conditionally complete lattices with a bottom element.
We ditch
ordinal.min(which is really justinfi). Apart from this, we add some missing theorems on conditionally complete lattices with a bottom element.well_founded.conditionally_complete_linear_order_with_bot#14706