proposition: Proposition local_equivalence_twocell_rwhisker_alt {x y z : B₁} {f₁ f₂ : F x --> F y} (τ : f₁ ==> f₂) (g : F y --> F z) : local_equivalence_inv_twocell (τ ▹ g) = local_equivalence_inv_onecell_comp f₁ g • (local_equivalence_inv_twocell τ ▹ _) • (local_equivalence_inv_onecell_comp f₂ g)^-1.
proof: Proof. rewrite <- local_equivalence_twocell_rwhisker. rewrite !vassocl. rewrite vcomp_rinv. rewrite id2_right. apply idpath. Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Prelude UniMath.CategoryTheory.Equivalences.Core UniMath.CategoryTheory.Equivalences.FullyFaithful UniMath.Bicategories.Core.Bicat UniMath.Bicategories.Core.Examples.BicatOfUnivCats UniMath.Bicategories.Core.Invertible_2cells UniMath.Bicategories.Core.Univalence UniMath.Bicategories.Core.BicategoryLaws UniMath.Bicategories.Morphisms.Adjunctions UniMath.Bicategories.Core.EquivToAdjequiv UniMath.Bicategories.DisplayedBicats.DispBicat UniMath.Bicategories.PseudoFunctors.Display.PseudoFunctorBicat UniMath.Bicategories.PseudoFunctors.PseudoFunctor UniMath.Bicategories.PseudoFunctors.Properties