Want to take part in these discussions? Sign in if you have an account, or apply for one below
Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.
I think I’m missing something here.
Say we have an equivalence
and a polymorphic predicate:
Then should we not expect the following equivalence?
It seems to me like this should be supported through substitute of like for like, but I can’t figure out how to prove this through the language of HoTT, even when using Univalence. Is my thinking correct here or am I missing something?
So given an equivalence , does it induce an equivalence ?
Doesn’t this concern that dependent map of Lemma 2.3.4 of the HoTT book? In the terms here:
So you have equivalences between and and .
Yes, it follows that (transporting on the other side) and hence for every , . This in turn induces the desired equivalence.
Thanks David and Ulrik. I think I follow.
1 to 5 of 5