proposition: Theorem isdecinclS : isdecincl S.
proof: Proof. intro n. apply isdecpropif. - apply (isinclS n). - destruct n as [ | n ]. + assert (nh : ¬ (hfiber S 0)). * intro hf. induction hf as [ m e ]. apply (negpathssx0 _ e). * apply (ii2 nh). + apply (ii1 (make_hfiber _ n (idpath _))). Defined.
imports: UniMath.Foundations.Sets