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
Set truncation #13
Set truncation #13
Conversation
} | ||
|
||
\instance SetTruncTruncated {A : \Type} : Truncated_-1+ 1 (SetTrunc A) | ||
| isTruncated x y p q => path (\lam i => path (trunc x y p q i)) |
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 wish I can prove this via:
pmap path (path (trunc x y p q))
But it doesn't work, they fail with some type inferences where only one candidates available
| i, left => x | ||
| i, right => y |
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.
Two additional definitional equalities that aren't written in Agda but seem to exist.
It's also possible to prove isSet A -> SetTrunc A = A
, but I have no time.
: Path (\lam i => A.2 (p @ i)) b b' ofHLevel_-1+ n \elim p | ||
| idp => h a b b' |
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 have a much shorter proof rather than in Agda!
This is actually a specialization of |
As title.