fact: Definition inner_cut_lt (L' R' : Type@{i}) {s : InSort S L' R'} (yL : L' -> No) (yR : R' -> No) (ycut : forall (l:L') (r:R'), (yL l) < (yR r)) : snd (inner {{ yL | yR // ycut }}).1 = (hor {l':L' & fst (inner (yL l')).1} {r:R & (xR_let r).1 {{ yL | yR // ycut }} }) := 1.
imports: HoTT.Basics HoTT.Types TruncType HSet HoTT.Truncations.Core