[Merged by Bors] - feat: pushing Lattice and predecessors through Equiv#37605
[Merged by Bors] - feat: pushing Lattice and predecessors through Equiv#37605Parcly-Taxel wants to merge 1 commit intoleanprover-community:masterfrom
Lattice and predecessors through Equiv#37605Conversation
PR summary cd8272a9d5Import changes for modified filesNo significant changes to the import graph Import changes for all files
|
|
Doesn't this just duplicate what we can already do with the |
Yaël asked me to do this. See #36934 (comment). |
YaelDillies
left a comment
There was a problem hiding this comment.
Thanks! 🚀
maintainer merge
|
🚀 Pull request has been placed on the maintainer queue by YaelDillies. |
|
I didn't check if really all the declarations work in the case of an injective function, but I agree with @vihdzp that it's not clear why we want this. @YaelDillies if you have a good reason can you explain this in the PR description (and maybe also in the code)? Thanks! |
|
The point is to transfer as cheaply as possible instances over to type synonyms. Note that we already have these for most of the algebraic hierarchy even when they "generalise" from an equiv to a structure-preserving injective function (note that the equiv needn't be structure-preserving, precisely because said structure needn't exist already). |
|
Have we thought about potentially automating this, instead of writinf these instances out explicitly? (I don't want to block this PR, but it may be interesting to think about) I find that the |
|
I would be very happy for automation to exist here, but note that what Jeremy's PR is doing is merely extending the statu quo and we shouldn't block him on that. Also note that ideas for such automation have in the past systematically been shot down on the same basis as Violeta and Riccardo's objection above. |
|
I agree with @riccardobrasca that a bit of details in the PR description would help before merging. |
|
Have added my comment above as description |
|
Thanks. bors merge |
The point is to transfer as cheaply as possible instances over to type synonyms. Note that we already have these for most of the algebraic hierarchy even when they "generalise" from an equiv to a structure-preserving injective function (note that the equiv needn't be structure-preserving, precisely because said structure needn't exist already). Co-authored-by: Parcly Taxel <reddeloostw@gmail.com>
|
Pull request successfully merged into master. Build succeeded:
|
Lattice and predecessors through EquivLattice and predecessors through Equiv
…community#37605) The point is to transfer as cheaply as possible instances over to type synonyms. Note that we already have these for most of the algebraic hierarchy even when they "generalise" from an equiv to a structure-preserving injective function (note that the equiv needn't be structure-preserving, precisely because said structure needn't exist already). Co-authored-by: Parcly Taxel <reddeloostw@gmail.com>
…community#37605) The point is to transfer as cheaply as possible instances over to type synonyms. Note that we already have these for most of the algebraic hierarchy even when they "generalise" from an equiv to a structure-preserving injective function (note that the equiv needn't be structure-preserving, precisely because said structure needn't exist already). Co-authored-by: Parcly Taxel <reddeloostw@gmail.com>
Where `CABA` is `CompleteAtomicBooleanAlgebra`. The natural follow-up to #37605. Co-authored-by: Parcly Taxel <reddeloostw@gmail.com>
…munity#37733) Where `CABA` is `CompleteAtomicBooleanAlgebra`. The natural follow-up to leanprover-community#37605. Co-authored-by: Parcly Taxel <reddeloostw@gmail.com>
The point is to transfer as cheaply as possible instances over to type synonyms. Note that we already have these for most of the algebraic hierarchy even when they "generalise" from an equiv to a structure-preserving injective function (note that the equiv needn't be structure-preserving, precisely because said structure needn't exist already).