{F X Y : pType} (i : F ->* X) (f : X ->* Y) (cx : IsComplex i f) (n : nat) : IsComplex (fmap (iterated_loops n) i) (fmap (iterated_loops n) f). Proof. induction n as [|n IHn]; [ exact cx | ]. apply iscomplex_loops; assumption. Defined.
Require Import Basics Types. Require Import SuccessorStructure. Require Import WildCat. Require Import Pointed. Require Import Modalities.Identity Modalities.Descent. Require Import Truncations. Require Import HFiber. Require Import ObjectClassifier.