Fernando Chu
Fernando Chu
You only need nix, not nixos. See the official page for guidance https://nixos.org/download.html
I've been thinking about this, and doing path induction on `p` and `eqf` in `(ap φ p)⁻¹ ∙ eqf = eqg` simplifies the goal to `refl (φ f) ≡ eqg`,...
Thanks, you're right. I've been thinking about this. We can not induct on `p` but we can induct on `eqg`, it is also enough to prove it for the case...
Yup I definetely agree, managing 2-paths is still very hard (to me). I suggest again maybe changing to the usual quasi-inverses proof, I can PR if you want.
I've just finished it! (I've also formalized it in [my agda repo](https://github.com/shiranaiyo/HoTT-Book-Agda/blob/b0a6ea213f29b1b991ccffa9adfcade23eb725a2/src/Chapter6/Book.lagda.md#L122)). I'll be closing this issue :) Thank you!
Oh I didn't know, thanks for reopening then
Same here :)
Same thing happens to me, though it seems only when I use sizes/breakpoints
Actually, you're right. I meant that the required properties were not introduced, but they were if you count the exercises, with the exception that `Prop` is a set, but that's...
I mistook `Prop` being a set with `isProp` being a set. The latter is easy, but the former does not seem so (to me), and that's what we need here....