fact: Definition inner_cut_le (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)) : fst (inner {{ yL | yR // ycut }}).1 = (Build_HProp ((forall l, (xL_let l).2.1 {{ yL | yR // ycut }}) * (forall r', snd (inner (yR r')).1))) := 1.
imports: HoTT.Basics HoTT.Types TruncType HSet HoTT.Truncations.Core