The modal factorization system

This is a formalization of most of section 7.5 and 7.6 in the book, in the generality of an arbitrary modality.  Pleasingly, all the theorems in `hit.Connectedness` that generalize to a modality (mainly, those that don't involve the interaction of multiple values of `n`) could be proven in that generality with essentially cut-and-pasted proofs, while the remaining theorems in `hit.Connectedness` still work where they are with essentially the same proofs (at least once I got the coercions and hints configured correctly).  The proof of lemma 7.6.5 is a bit trickier than in the book, because our `O_ind` has only a propositional computation rule.  I only found [one mistake](https://github.com/HoTT/book/pull/731) in the book.
Eww, I hate when `change` tells me that (and I haven't quite figured out how to fix it, or even when it shows up).

Here's a replacement for `repeat rewrite ev_equiv_compose`:
```coq
    unfold equiv_compose', equiv_compose.
    repeat change (equiv_fun {| equiv_fun := ?f |}) with f.
```