proposition: Lemma dagger_transformation_equality {F G : functor C D} {dagF : is_dagger_functor dagC dagD F} {dagG : is_dagger_functor dagC dagD G} (α β : dagger_functor_cat⟦make_dagger_functor dagF , make_dagger_functor dagG⟧) : (∏ x : C, pr11 α x = pr11 β x) -> α = β.
proof: Proof. intro p. use subtypePath. { intro ; apply isapropunit. } apply (nat_trans_eq D). exact p. Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.FunctorCategory UniMath.CategoryTheory.DisplayedCats.Core UniMath.CategoryTheory.DisplayedCats.Constructions UniMath.CategoryTheory.DisplayedCats.Total UniMath.CategoryTheory.DaggerCategories.Categories UniMath.CategoryTheory.DaggerCategories.Unitary UniMath.CategoryTheory.DaggerCategories.Univalence UniMath.CategoryTheory.DaggerCategories.Functors UniMath.CategoryTheory.DaggerCategories.Transformations