proposition: Lemma category_symmetric_monoidal_comonad_disp_eq (F : category_symmetric_lax_monoidal_functors HM HM) (T T' : disp_cat_symmetric_monoidal_comonads F) : pr1 T = pr1 T' -> T = T'.
proof: Proof. intro H. induction T as [T Textralaws]. induction T' as [T' T'extralaws]. apply subtypePath. - intro; apply isaprop_symmetric_monoidal_comonads_extra_laws. - exact H. 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