proposition: Lemma symmetric_monoidal_comonad_category_Pisset (smF : ∑ (F : C ⟶ C) (d : fmonoidal_lax M M F), is_symmetric_monoidal_functor HM HM d) : isaset (∑ H : ∑ T : disp_Comonad_data (pr1 smF), disp_Comonad_laws T, symmetric_monoidal_comonads_extra_laws (pr12 smF) (pr11 H) (pr21 H)).
proof: Proof. change isaset with (isofhlevel 2). apply isofhleveltotal2. - apply isofhleveltotal2. { apply isasetdirprod; apply [C,C]. } intro T. apply isasetaprop. apply isaprop_disp_Comonad_laws. - intro TT. apply isasetaprop. apply isaprop_symmetric_monoidal_comonads_extra_laws. Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.FunctorCategory UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Monoidal.WhiskeredBifunctors UniMath.CategoryTheory.Monoidal.Categories UniMath.CategoryTheory.Monoidal.Functors UniMath.CategoryTheory.Monoidal.Structure.Symmetric UniMath.CategoryTheory.DisplayedCats.Core UniMath.CategoryTheory.DisplayedCats.Constructions UniMath.CategoryTheory.DisplayedCats.Total UniMath.CategoryTheory.DisplayedCats.Examples.Sigma UniMath.CategoryTheory.DisplayedCats.SIP UniMath.CategoryTheory.DisplayedCats.Univalence UniMath.CategoryTheory.Core.Univalence UniMath.CategoryTheory.Monads.Comonads