Skip to content
This repository was archived by the owner on Jul 24, 2024. It is now read-only.

[Merged by Bors] - refactor(set_theory/ordinal/basic): ordinal.mininfi#14707

Closed
vihdzp wants to merge 22 commits intomasterfrom
min_ordinal_refactor
Closed

[Merged by Bors] - refactor(set_theory/ordinal/basic): ordinal.mininfi#14707
vihdzp wants to merge 22 commits intomasterfrom
min_ordinal_refactor

Conversation

@vihdzp
Copy link
Copy Markdown
Collaborator

@vihdzp vihdzp commented Jun 13, 2022

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.


Open in Gitpod

@vihdzp vihdzp added the awaiting-review The author would like community review of the PR label Jun 13, 2022
@vihdzp vihdzp changed the title refactor(set_theory/ordinal/basic): minInf refactor(set_theory/ordinal/basic): ordinal.mininfi Jun 13, 2022
@ghost ghost added the blocked-by-other-PR This PR depends on another PR which is still in the queue. A bot manages this label via PR comment. label Jun 13, 2022
@ghost ghost removed the blocked-by-other-PR This PR depends on another PR which is still in the queue. A bot manages this label via PR comment. label Jun 20, 2022
@ghost
Copy link
Copy Markdown

ghost commented Jun 20, 2022

@vihdzp
Copy link
Copy Markdown
Collaborator Author

vihdzp commented Jun 25, 2022

Getting a random timeout here too.

Copy link
Copy Markdown
Member

@eric-wieser eric-wieser left a comment

Choose a reason for hiding this comment

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

Can you update the module docstring?

Copy link
Copy Markdown
Member

@urkud urkud left a comment

Choose a reason for hiding this comment

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

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⟩ _
Copy link
Copy Markdown
Member

Choose a reason for hiding this comment

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

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.

Copy link
Copy Markdown
Collaborator Author

Choose a reason for hiding this comment

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

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⟩⟩
Copy link
Copy Markdown
Member

Choose a reason for hiding this comment

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

Is it in the ordinal namespace?

Copy link
Copy Markdown
Collaborator Author

Choose a reason for hiding this comment

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

No, this instance isn't contained in an enclosing namespace. I think that's how it should be.

Copy link
Copy Markdown
Member

Choose a reason for hiding this comment

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

I mean, what is the full name of this instance?

Copy link
Copy Markdown
Collaborator Author

Choose a reason for hiding this comment

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

is_well_order.subtype_nonempty is the full name.

Copy link
Copy Markdown
Member

Choose a reason for hiding this comment

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

You're right. Thanks!
bors merge

bors bot pushed a commit that referenced this pull request Jul 25, 2022
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.
@bors
Copy link
Copy Markdown

bors bot commented Jul 25, 2022

Pull request successfully merged into master.

Build succeeded:

@bors bors bot changed the title refactor(set_theory/ordinal/basic): ordinal.mininfi [Merged by Bors] - refactor(set_theory/ordinal/basic): ordinal.mininfi Jul 25, 2022
@bors bors bot closed this Jul 25, 2022
@bors bors bot deleted the min_ordinal_refactor branch July 25, 2022 04:02
bottine pushed a commit to bottine/mathlib that referenced this pull request Jul 30, 2022
…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.
robertylewis pushed a commit that referenced this pull request Aug 2, 2022
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.
khwilson pushed a commit that referenced this pull request Aug 2, 2022
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.
@YaelDillies YaelDillies removed the awaiting-review The author would like community review of the PR label Feb 27, 2023
Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

4 participants