proposition: Proposition local_equivalence_twocell_lwhisker_inv {x y z : B₁} (f : F x --> F y) {g₁ g₂ : F y --> F z} (τ : g₁ ==> g₂) : (local_equivalence_inv_onecell_comp f g₁)^-1 • local_equivalence_inv_twocell (f ◃ τ) = (_ ◃ local_equivalence_inv_twocell τ) • (local_equivalence_inv_onecell_comp f g₂)^-1.
proof: Proof. use vcomp_move_R_pM ; [ is_iso | ]. rewrite !vassocr. apply local_equivalence_twocell_lwhisker_alt. 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