proposition: Lemma functors_eq_data_equiv_unitary_functors_eq_inv_law2 (u : is_univalent_dagger dagD) : ∏ y : unitary_functors_eq, functors_eq_data_to_unitary_functors_eq u (functors_eq_data_from_unitary_functors_eq u y) = y.
proof: Proof. intro p. use total2_paths_f. - apply funextsec ; intro. use total2_paths_f. + apply maponpaths, idtodaggeriso_daggerisotoid. + apply isaprop_is_unitary. - repeat (apply funextsec ; intro). apply homset_property. 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