Commutative idempotent binary operations with eventually idempotent right action imply sethood - #445
fredrik-bakke wants to merge 32 commits into
Conversation
…th eventually idempotent right action
|
I'll mark this PR as ready for review once I've found the time to re-review the comments I received on my CSB-WLPO pull request, to avoid having you repeat feedback you've given me before. |
|
EDIT: Nevermind, I've just stared at this for too long and started imagining things. |
|
I'm going to unsubscribe from this PR until it's ready for PR (just to avoid a lot of emails about commits). Please ping me when it's ready. Thanks! |
Is this motivated by something you have in mind? |
| → is-set X | ||
| refl-is-set X r {x} p refl = r x p | ||
|
|
||
| refl-is-set' : (X : 𝓤 ̇ ) |
There was a problem hiding this comment.
Better name: if-every-loop-is-refl-then-the-type-is-a-set.
There was a problem hiding this comment.
Sorry, does that mean I should rename refl-is-set too?
The motivation was to see how far I could stretch the original result. I have some new results today though, so better conditions will/might follow soon. |
Gives a generalisation of David Wärn's result that the algebraic structure of a semilattice implies sethood.
Theorem. Given a type$A$ with a binary operation ${-}*{-}$ that satisfies
then$A$ is a set.