fact: Definition amal_type_ind (P : amal_type -> Type) `{forall x, IsHSet (P x)} (e : forall w, P (amal_eta w)) (mh : forall (x y : Words) (h1 h2 : H), DPath P (amal_mu_H x y h1 h2) (e (x ++ (inl h1 :: [inl h2]) ++ y)) (e (x ++ [inl (h1 * h2)] ++ y))) (mk : forall (x y : Words) (k1 k2 : K), DPath P (amal_mu_K x y k1 k2) (e (x ++ (inr k1 :: [inr k2]) ++ y)) (e (x ++ [inr (k1 * k2)] ++ y))) (t : forall (x y : Words) (z : G), DPath P (amal_tau x y z) (e (x ++ [inl (f z)] ++ y)) (e (x ++ [inr (g z)] ++ y))) (oh : forall (x y : Words), DPath P (amal_omega_H x y) (e (x ++ [inl mon_unit] ++ y)) (e (x ++ y))) (ok : forall (x y : Words), DPath P (amal_omega_K x y) (e (x ++ [inr mon_unit] ++ y)) (e (x ++ y))) : forall x, P x.
imports: Basics Types Cubical Spaces.List Colimits.Pushout Truncations.Core Truncations.SeparatedTrunc Algebra.Groups.Group WildCat