proposition: Lemma tensor_eq'_equiv_tensor_eq'' {C : univalent_category} (TC TD : tensor C) : tensor_eq'' TC TD ≃ tensor_eq' TC TD.
proof: Proof. apply weq_subtypes_iff. - intro. repeat (apply impred_isaprop ; intro). apply homset_property. - intro. repeat (apply impred_isaprop ; intro). apply homset_property. - intro pob. split. + intros q ? ? ? ? f g. apply transport_f_f_to_transport. exact (q _ _ _ _ f g). + intros q ? ? ? ? f g. apply transport_to_transport_f_f. exact (q _ _ _ _ f g). Defined.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Core.Univalence UniMath.CategoryTheory.DisplayedCats.Core UniMath.CategoryTheory.DisplayedCats.Functors UniMath.CategoryTheory.DisplayedCats.Total UniMath.CategoryTheory.DisplayedCats.Constructions UniMath.Bicategories.Core.Bicat UniMath.Bicategories.Core.Examples.BicatOfUnivCats UniMath.Bicategories.Core.Invertible_2cells UniMath.Bicategories.DisplayedBicats.DispBicat UniMath.Bicategories.DisplayedBicats.DispUnivalence UniMath.Bicategories.DisplayedBicats.DispInvertibles UniMath.Bicategories.Core.Univalence UniMath.Bicategories.MonoidalCategories.UnivalenceMonCat.CurriedMonoidalCategories