proposition: Lemma X_aux_type_center_of_contr_proof (b : D) (anot : C) (hnot : unitary dagD (H anot) b) : ∏ (t t' : ∑ a : C, unitary dagD (H a) b) (f : pr1 t --> pr1 t'), #H f· pr12 t' = pr12 t -> #F f· #F (fH^-1 (pr12 t'· dagD _ _ (pr1 hnot))) = #F (fH^-1 (pr12 t· dagD _ _ (pr1 hnot))).
proof: Proof. intros t t' f. destruct t as [a h]. destruct t' as [a' h']. simpl in *. intro star. rewrite <- functor_comp. apply maponpaths. apply (invmaponpathsweq (weq_from_fully_faithful fH a anot)). simpl. rewrite functor_comp. inv_functor fH a' anot. rewrite assoc. inv_functor fH a anot. rewrite <- star. apply idpath. Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.whiskering UniMath.CategoryTheory.DisplayedCats.Core UniMath.CategoryTheory.DisplayedCats.Functors UniMath.CategoryTheory.DisplayedCats.Total UniMath.CategoryTheory.DisplayedCats.TotalCategoryFacts UniMath.CategoryTheory.precomp_fully_faithful UniMath.CategoryTheory.DaggerCategories.Categories UniMath.CategoryTheory.DaggerCategories.Functors UniMath.CategoryTheory.DaggerCategories.Transformations UniMath.CategoryTheory.DaggerCategories.Unitary UniMath.CategoryTheory.DaggerCategories.Univalence UniMath.CategoryTheory.DaggerCategories.FunctorCategory UniMath.CategoryTheory.DaggerCategories.Functors.FullyFaithful UniMath.CategoryTheory.DaggerCategories.Functors.WeakEquivalences