-
Notifications
You must be signed in to change notification settings - Fork 1.1k
chore(Order/UpperLower/Basic): use to_dual
#34640
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
base: master
Are you sure you want to change the base?
Conversation
PR summary b8dad038b1Import changes for modified filesNo significant changes to the import graph Import changes for all files
|
|
This overlaps with #33964, no? |
|
There's some overlap, yes. I'll make it a dependent PR. |
|
This PR/issue depends on:
|
|
|
||
| @[simp] | ||
| @[to_dual (attr := simp)] | ||
| theorem compl_Iic : (Iic a)ᶜ = Ioi a := |
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 have this other PR #33543 where I teach to_dual that compl should be translated to hnot. I guess that that is a bad idea...
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.
We already avoid translating the order on sets, don't we? So I don't think this should cause any conflict.
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.
Yes, but I mean that the name translation will get messed up.
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.
Ideally, compl should be translated to hnot only when the type is not a boolean algebra.
However, we need to implement a new feature for the to_dual attribute to do this...
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.
Rather than doing that, I think it would be better to stop using compl in the definition of Heyting algebras and make compl a notation exclusively for Boolean algebras.
| theorem IsUpperSet.ordConnected (h : IsUpperSet s) : s.OrdConnected := | ||
| ⟨fun _ ha _ _ => Icc_subset_Ici_self.trans <| h.Ici_subset ha⟩ | ||
|
|
||
| @[to_dual existing] |
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.
Can you add a comment here saying that to_dual cannot yet reorder arguments of arguments? That way it'll be easier to clean up later
| @[to_dual none] | ||
| theorem WellFounded.min_le (h : WellFounded ((· < ·) : β → β → Prop)) |
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.
Why is this in this PR? And shouldn't we just change it to h : WellFoundedLT β?
to_dualforIio/Iic#33964