Loogle!
Result
Found 255 declarations mentioning CategoryTheory.MorphismProperty.ContainsIdentities. Of these, only the first 200 are shown.
- CategoryTheory.MorphismProperty.ContainsIdentities 📋 Mathlib.CategoryTheory.MorphismProperty.Composition
{C : Type u} [CategoryTheory.Category.{v, u} C] (W : CategoryTheory.MorphismProperty C) : Prop - CategoryTheory.MorphismProperty.ContainsIdentities.instIdentities 📋 Mathlib.CategoryTheory.MorphismProperty.Composition
{C : Type u} [CategoryTheory.Category.{v, u} C] : (CategoryTheory.MorphismProperty.identities C).ContainsIdentities - CategoryTheory.MorphismProperty.IsMultiplicative.toContainsIdentities 📋 Mathlib.CategoryTheory.MorphismProperty.Composition
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} {W : CategoryTheory.MorphismProperty C} [self : W.IsMultiplicative] : W.ContainsIdentities - CategoryTheory.MorphismProperty.IsMultiplicative.mk 📋 Mathlib.CategoryTheory.MorphismProperty.Composition
{C : Type u} [CategoryTheory.Category.{v, u} C] {W : CategoryTheory.MorphismProperty C} [toContainsIdentities : W.ContainsIdentities] [toIsStableUnderComposition : W.IsStableUnderComposition] : W.IsMultiplicative - CategoryTheory.MorphismProperty.id_mem 📋 Mathlib.CategoryTheory.MorphismProperty.Composition
{C : Type u} [CategoryTheory.Category.{v, u} C] (W : CategoryTheory.MorphismProperty C) [W.ContainsIdentities] (X : C) : W (CategoryTheory.CategoryStruct.id X) - CategoryTheory.MorphismProperty.ContainsIdentities.id_mem 📋 Mathlib.CategoryTheory.MorphismProperty.Composition
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} {W : CategoryTheory.MorphismProperty C} [self : W.ContainsIdentities] (X : C) : W (CategoryTheory.CategoryStruct.id X) - CategoryTheory.MorphismProperty.ContainsIdentities.mk 📋 Mathlib.CategoryTheory.MorphismProperty.Composition
{C : Type u} [CategoryTheory.Category.{v, u} C] {W : CategoryTheory.MorphismProperty C} (id_mem : ∀ (X : C), W (CategoryTheory.CategoryStruct.id X)) : W.ContainsIdentities - CategoryTheory.MorphismProperty.ContainsIdentities.of_op 📋 Mathlib.CategoryTheory.MorphismProperty.Composition
{C : Type u} [CategoryTheory.Category.{v, u} C] (W : CategoryTheory.MorphismProperty C) [W.op.ContainsIdentities] : W.ContainsIdentities - CategoryTheory.MorphismProperty.ContainsIdentities.op 📋 Mathlib.CategoryTheory.MorphismProperty.Composition
{C : Type u} [CategoryTheory.Category.{v, u} C] (W : CategoryTheory.MorphismProperty C) [W.ContainsIdentities] : W.op.ContainsIdentities - CategoryTheory.MorphismProperty.ContainsIdentities.of_unop 📋 Mathlib.CategoryTheory.MorphismProperty.Composition
{C : Type u} [CategoryTheory.Category.{v, u} C] (W : CategoryTheory.MorphismProperty Cᵒᵖ) [W.unop.ContainsIdentities] : W.ContainsIdentities - CategoryTheory.MorphismProperty.ContainsIdentities.unop 📋 Mathlib.CategoryTheory.MorphismProperty.Composition
{C : Type u} [CategoryTheory.Category.{v, u} C] (W : CategoryTheory.MorphismProperty Cᵒᵖ) [W.ContainsIdentities] : W.unop.ContainsIdentities - CategoryTheory.MorphismProperty.ContainsIdentities.eqToHom 📋 Mathlib.CategoryTheory.MorphismProperty.Composition
{C : Type u} [CategoryTheory.Category.{v, u} C] (W : CategoryTheory.MorphismProperty C) [W.ContainsIdentities] {x y : C} (h : x = y) : W (CategoryTheory.eqToHom h) - CategoryTheory.MorphismProperty.ContainsIdentities.inverseImage 📋 Mathlib.CategoryTheory.MorphismProperty.Composition
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u'} [CategoryTheory.Category.{v', u'} D] {P : CategoryTheory.MorphismProperty D} [P.ContainsIdentities] (F : CategoryTheory.Functor C D) : (P.inverseImage F).ContainsIdentities - CategoryTheory.MorphismProperty.of_isIso 📋 Mathlib.CategoryTheory.MorphismProperty.Composition
{C : Type u} [CategoryTheory.Category.{v, u} C] (P : CategoryTheory.MorphismProperty C) [P.ContainsIdentities] [P.RespectsIso] {X Y : C} (f : X ⟶ Y) [CategoryTheory.IsIso f] : P f - CategoryTheory.MorphismProperty.Pi.containsIdentities 📋 Mathlib.CategoryTheory.MorphismProperty.Composition
{J : Type w} {C : J → Type u} [(j : J) → CategoryTheory.Category.{v, u} (C j)] (W : (j : J) → CategoryTheory.MorphismProperty (C j)) [∀ (j : J), (W j).ContainsIdentities] : (CategoryTheory.MorphismProperty.pi W).ContainsIdentities - CategoryTheory.MorphismProperty.Prod.containsIdentities 📋 Mathlib.CategoryTheory.MorphismProperty.Composition
{C₁ : Type u_1} {C₂ : Type u_2} [CategoryTheory.Category.{v_1, u_1} C₁] [CategoryTheory.Category.{v_2, u_2} C₂] (W₁ : CategoryTheory.MorphismProperty C₁) (W₂ : CategoryTheory.MorphismProperty C₂) [W₁.ContainsIdentities] [W₂.ContainsIdentities] : (W₁.prod W₂).ContainsIdentities - CategoryTheory.MorphismProperty.ContainsIdentities.iInf 📋 Mathlib.CategoryTheory.MorphismProperty.Composition
{C : Type u} [CategoryTheory.Category.{v, u} C] {ι : Type u_1} {W : ι → CategoryTheory.MorphismProperty C} [∀ (i : ι), (W i).ContainsIdentities] : (⨅ i, W i).ContainsIdentities - CategoryTheory.MorphismProperty.ContainsIdentities.iff_identities_le 📋 Mathlib.CategoryTheory.MorphismProperty.Composition
{C : Type u} [CategoryTheory.Category.{v, u} C] {W : CategoryTheory.MorphismProperty C} : W.ContainsIdentities ↔ CategoryTheory.MorphismProperty.identities C ≤ W - CategoryTheory.MorphismProperty.isomorphisms_le_of_containsIdentities 📋 Mathlib.CategoryTheory.MorphismProperty.Composition
{C : Type u} [CategoryTheory.Category.{v, u} C] (P : CategoryTheory.MorphismProperty C) [P.ContainsIdentities] [P.RespectsIso] : CategoryTheory.MorphismProperty.isomorphisms C ≤ P - CategoryTheory.MorphismProperty.ContainsIdentities.inf 📋 Mathlib.CategoryTheory.MorphismProperty.Composition
{C : Type u} [CategoryTheory.Category.{v, u} C] {P Q : CategoryTheory.MorphismProperty C} [P.ContainsIdentities] [Q.ContainsIdentities] : (P ⊓ Q).ContainsIdentities - CategoryTheory.MorphismProperty.ContainsIdentities.sInf 📋 Mathlib.CategoryTheory.MorphismProperty.Composition
{C : Type u} [CategoryTheory.Category.{v, u} C] {W : Set (CategoryTheory.MorphismProperty C)} (h : ∀ W' ∈ W, W'.ContainsIdentities) : (sInf W).ContainsIdentities - CategoryTheory.MorphismProperty.Comma.id 📋 Mathlib.CategoryTheory.MorphismProperty.Comma
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] {B : Type u_2} [CategoryTheory.Category.{v_2, u_2} B] {T : Type u_3} [CategoryTheory.Category.{v_3, u_3} T] {L : CategoryTheory.Functor A T} {R : CategoryTheory.Functor B T} {P : CategoryTheory.MorphismProperty T} {Q : CategoryTheory.MorphismProperty A} {W : CategoryTheory.MorphismProperty B} [Q.ContainsIdentities] [W.ContainsIdentities] (X : CategoryTheory.MorphismProperty.Comma L R P Q W) : X.Hom X - CategoryTheory.MorphismProperty.Comma.id_left 📋 Mathlib.CategoryTheory.MorphismProperty.Comma
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] {B : Type u_2} [CategoryTheory.Category.{v_2, u_2} B] {T : Type u_3} [CategoryTheory.Category.{v_3, u_3} T] {L : CategoryTheory.Functor A T} {R : CategoryTheory.Functor B T} {P : CategoryTheory.MorphismProperty T} {Q : CategoryTheory.MorphismProperty A} {W : CategoryTheory.MorphismProperty B} [Q.ContainsIdentities] [W.ContainsIdentities] (X : CategoryTheory.MorphismProperty.Comma L R P Q W) : X.id.left = CategoryTheory.CategoryStruct.id X.left - CategoryTheory.MorphismProperty.Comma.id_right 📋 Mathlib.CategoryTheory.MorphismProperty.Comma
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] {B : Type u_2} [CategoryTheory.Category.{v_2, u_2} B] {T : Type u_3} [CategoryTheory.Category.{v_3, u_3} T] {L : CategoryTheory.Functor A T} {R : CategoryTheory.Functor B T} {P : CategoryTheory.MorphismProperty T} {Q : CategoryTheory.MorphismProperty A} {W : CategoryTheory.MorphismProperty B} [Q.ContainsIdentities] [W.ContainsIdentities] (X : CategoryTheory.MorphismProperty.Comma L R P Q W) : X.id.right = CategoryTheory.CategoryStruct.id X.right - CategoryTheory.MorphismProperty.regularEpi.containsIdentities 📋 Mathlib.CategoryTheory.Limits.Shapes.RegularMono
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] : (CategoryTheory.MorphismProperty.regularEpi C).ContainsIdentities - CategoryTheory.MorphismProperty.regularMono.containsIdentities 📋 Mathlib.CategoryTheory.Limits.Shapes.RegularMono
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] : (CategoryTheory.MorphismProperty.regularMono C).ContainsIdentities - CategoryTheory.MorphismProperty.instContainsIdentitiesDiagonalOfRespectsIso 📋 Mathlib.CategoryTheory.MorphismProperty.Limits
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPullbacks C] {P : CategoryTheory.MorphismProperty C} [P.ContainsIdentities] [P.RespectsIso] : P.diagonal.ContainsIdentities - CategoryTheory.MorphismProperty.LeftFraction.ofHom 📋 Mathlib.CategoryTheory.Localization.CalculusOfFractions
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (W : CategoryTheory.MorphismProperty C) {X Y : C} (f : X ⟶ Y) [W.ContainsIdentities] : W.LeftFraction X Y - CategoryTheory.MorphismProperty.RightFraction.ofHom 📋 Mathlib.CategoryTheory.Localization.CalculusOfFractions
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (W : CategoryTheory.MorphismProperty C) {X Y : C} (f : X ⟶ Y) [W.ContainsIdentities] : W.RightFraction X Y - CategoryTheory.MorphismProperty.LeftFraction.ofHom_Y' 📋 Mathlib.CategoryTheory.Localization.CalculusOfFractions
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (W : CategoryTheory.MorphismProperty C) {X Y : C} (f : X ⟶ Y) [W.ContainsIdentities] : (CategoryTheory.MorphismProperty.LeftFraction.ofHom W f).Y' = Y - CategoryTheory.MorphismProperty.RightFraction.ofHom_X' 📋 Mathlib.CategoryTheory.Localization.CalculusOfFractions
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (W : CategoryTheory.MorphismProperty C) {X Y : C} (f : X ⟶ Y) [W.ContainsIdentities] : (CategoryTheory.MorphismProperty.RightFraction.ofHom W f).X' = X - CategoryTheory.MorphismProperty.LeftFraction.ofHom_f 📋 Mathlib.CategoryTheory.Localization.CalculusOfFractions
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (W : CategoryTheory.MorphismProperty C) {X Y : C} (f : X ⟶ Y) [W.ContainsIdentities] : (CategoryTheory.MorphismProperty.LeftFraction.ofHom W f).f = f - CategoryTheory.MorphismProperty.RightFraction.ofHom_f 📋 Mathlib.CategoryTheory.Localization.CalculusOfFractions
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (W : CategoryTheory.MorphismProperty C) {X Y : C} (f : X ⟶ Y) [W.ContainsIdentities] : (CategoryTheory.MorphismProperty.RightFraction.ofHom W f).f = f - CategoryTheory.MorphismProperty.LeftFraction.ofHom_s 📋 Mathlib.CategoryTheory.Localization.CalculusOfFractions
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (W : CategoryTheory.MorphismProperty C) {X Y : C} (f : X ⟶ Y) [W.ContainsIdentities] : (CategoryTheory.MorphismProperty.LeftFraction.ofHom W f).s = CategoryTheory.CategoryStruct.id Y - CategoryTheory.MorphismProperty.RightFraction.ofHom_s 📋 Mathlib.CategoryTheory.Localization.CalculusOfFractions
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (W : CategoryTheory.MorphismProperty C) {X Y : C} (f : X ⟶ Y) [W.ContainsIdentities] : (CategoryTheory.MorphismProperty.RightFraction.ofHom W f).s = CategoryTheory.CategoryStruct.id X - CategoryTheory.MorphismProperty.LeftFraction.map_ofHom 📋 Mathlib.CategoryTheory.Localization.CalculusOfFractions
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] (W : CategoryTheory.MorphismProperty C) {X Y : C} (f : X ⟶ Y) (L : CategoryTheory.Functor C D) (hL : W.IsInvertedBy L) [W.ContainsIdentities] : (CategoryTheory.MorphismProperty.LeftFraction.ofHom W f).map L hL = L.map f - CategoryTheory.MorphismProperty.RightFraction.map_ofHom 📋 Mathlib.CategoryTheory.Localization.CalculusOfFractions
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] (W : CategoryTheory.MorphismProperty C) {X Y : C} (f : X ⟶ Y) (L : CategoryTheory.Functor C D) (hL : W.IsInvertedBy L) [W.ContainsIdentities] : (CategoryTheory.MorphismProperty.RightFraction.ofHom W f).map L hL = L.map f - CategoryTheory.ObjectProperty.instContainsIdentitiesTrWOfContainsZero 📋 Mathlib.CategoryTheory.Triangulated.Subcategory
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroObject C] [CategoryTheory.HasShift C ℤ] [CategoryTheory.Preadditive C] [∀ (n : ℤ), (CategoryTheory.shiftFunctor C n).Additive] [CategoryTheory.Pretriangulated C] (P : CategoryTheory.ObjectProperty C) [P.ContainsZero] : P.trW.ContainsIdentities - CategoryTheory.Over.closedUnderLimitsOfShape_discrete_empty 📋 Mathlib.CategoryTheory.Limits.MorphismProperty
{T : Type u_1} [CategoryTheory.Category.{v_1, u_1} T] (P : CategoryTheory.MorphismProperty T) {X : T} [P.ContainsIdentities] [P.RespectsIso] : P.overObj.IsClosedUnderLimitsOfShape (CategoryTheory.Discrete PEmpty.{1}) - CategoryTheory.Under.closedUnderColimitsOfShape_discrete_empty 📋 Mathlib.CategoryTheory.Limits.MorphismProperty
{T : Type u_1} [CategoryTheory.Category.{v_1, u_1} T] (P : CategoryTheory.MorphismProperty T) {X : T} [P.ContainsIdentities] [P.RespectsIso] : P.underObj.IsClosedUnderColimitsOfShape (CategoryTheory.Discrete PEmpty.{1}) - CategoryTheory.CostructuredArrow.closedUnderLimitsOfShape_discrete_empty 📋 Mathlib.CategoryTheory.Limits.MorphismProperty
{T : Type u_1} [CategoryTheory.Category.{v_1, u_1} T] (P : CategoryTheory.MorphismProperty T) {A : Type u_2} [CategoryTheory.Category.{v_2, u_2} A] {L : CategoryTheory.Functor A T} [L.Faithful] [L.Full] {Y : A} [P.ContainsIdentities] [P.RespectsIso] : (CategoryTheory.MorphismProperty.costructuredArrowObj L P).IsClosedUnderLimitsOfShape (CategoryTheory.Discrete PEmpty.{1}) - CategoryTheory.StructuredArrow.closedUnderColimitsOfShape_discrete_empty 📋 Mathlib.CategoryTheory.Limits.MorphismProperty
{T : Type u_1} [CategoryTheory.Category.{v_1, u_1} T] (P : CategoryTheory.MorphismProperty T) {A : Type u_2} [CategoryTheory.Category.{v_2, u_2} A] {L : CategoryTheory.Functor A T} [L.Faithful] [L.Full] {Y : A} [P.ContainsIdentities] [P.RespectsIso] : (CategoryTheory.MorphismProperty.structuredArrowObj L P).IsClosedUnderColimitsOfShape (CategoryTheory.Discrete PEmpty.{1}) - CategoryTheory.MorphismProperty.Over.instHasTerminalTopOfContainsIdentities 📋 Mathlib.CategoryTheory.Limits.MorphismProperty
{T : Type u_1} [CategoryTheory.Category.{v_1, u_1} T] (P : CategoryTheory.MorphismProperty T) (X : T) [P.ContainsIdentities] : CategoryTheory.Limits.HasTerminal (P.Over ⊤ X) - CategoryTheory.MorphismProperty.Under.instHasInitialTopOfContainsIdentities 📋 Mathlib.CategoryTheory.Limits.MorphismProperty
{T : Type u_1} [CategoryTheory.Category.{v_1, u_1} T] (P : CategoryTheory.MorphismProperty T) (X : T) [P.ContainsIdentities] : CategoryTheory.Limits.HasInitial (P.Under ⊤ X) - CategoryTheory.MorphismProperty.Under.instHasFiniteColimitsTopOfHasFiniteWidePushouts 📋 Mathlib.CategoryTheory.Limits.MorphismProperty
{T : Type u_1} [CategoryTheory.Category.{v_1, u_1} T] (P : CategoryTheory.MorphismProperty T) (X : T) [CategoryTheory.Limits.HasPushouts T] [P.IsStableUnderComposition] [P.ContainsIdentities] [P.IsStableUnderCobaseChange] [P.HasOfPrecompProperty P] [CategoryTheory.Limits.HasFiniteWidePushouts T] : CategoryTheory.Limits.HasFiniteColimits (P.Under ⊤ X) - CategoryTheory.MorphismProperty.Over.mkIdTerminal 📋 Mathlib.CategoryTheory.Limits.MorphismProperty
{T : Type u_1} [CategoryTheory.Category.{v_1, u_1} T] (P : CategoryTheory.MorphismProperty T) (X : T) [P.ContainsIdentities] : CategoryTheory.Limits.IsTerminal (CategoryTheory.MorphismProperty.Over.mk ⊤ (CategoryTheory.CategoryStruct.id X) ⋯) - CategoryTheory.MorphismProperty.Under.mkIdInitial 📋 Mathlib.CategoryTheory.Limits.MorphismProperty
{T : Type u_1} [CategoryTheory.Category.{v_1, u_1} T] (P : CategoryTheory.MorphismProperty T) (X : T) [P.ContainsIdentities] : CategoryTheory.Limits.IsInitial (CategoryTheory.MorphismProperty.Under.mk ⊤ (CategoryTheory.CategoryStruct.id X) ⋯) - CategoryTheory.MorphismProperty.Over.instCreatesLimitsOfShapeTopOverDiscretePEmptyForgetOfContainsIdentitiesOfRespectsIso 📋 Mathlib.CategoryTheory.Limits.MorphismProperty
{T : Type u_1} [CategoryTheory.Category.{v_1, u_1} T] (P : CategoryTheory.MorphismProperty T) (X : T) [P.ContainsIdentities] [P.RespectsIso] : CategoryTheory.CreatesLimitsOfShape (CategoryTheory.Discrete PEmpty.{1}) (CategoryTheory.MorphismProperty.Over.forget P ⊤ X) - CategoryTheory.MorphismProperty.Under.instCreatesColimitsOfShapeTopUnderDiscretePEmptyForgetOfContainsIdentitiesOfRespectsIso 📋 Mathlib.CategoryTheory.Limits.MorphismProperty
{T : Type u_1} [CategoryTheory.Category.{v_1, u_1} T] (P : CategoryTheory.MorphismProperty T) (X : T) [P.ContainsIdentities] [P.RespectsIso] : CategoryTheory.CreatesColimitsOfShape (CategoryTheory.Discrete PEmpty.{1}) (CategoryTheory.MorphismProperty.Under.forget P ⊤ X) - CategoryTheory.MorphismProperty.Under.instCreatesFiniteColimitsTopUnderForget 📋 Mathlib.CategoryTheory.Limits.MorphismProperty
{T : Type u_1} [CategoryTheory.Category.{v_1, u_1} T] (P : CategoryTheory.MorphismProperty T) (X : T) [CategoryTheory.Limits.HasPushouts T] [P.IsStableUnderComposition] [P.ContainsIdentities] [P.IsStableUnderCobaseChange] [P.HasOfPrecompProperty P] : CategoryTheory.Limits.CreatesFiniteColimits (CategoryTheory.MorphismProperty.Under.forget P ⊤ X) - CategoryTheory.MorphismProperty.Under.instPreservesFiniteColimitsTopUnderForget 📋 Mathlib.CategoryTheory.Limits.MorphismProperty
{T : Type u_1} [CategoryTheory.Category.{v_1, u_1} T] (P : CategoryTheory.MorphismProperty T) (X : T) [CategoryTheory.Limits.HasPushouts T] [P.IsStableUnderComposition] [P.ContainsIdentities] [P.IsStableUnderCobaseChange] [P.HasOfPrecompProperty P] : CategoryTheory.Limits.PreservesFiniteColimits (CategoryTheory.MorphismProperty.Under.forget P ⊤ X) - CategoryTheory.MorphismProperty.Over.instUniqueHomTopMkId 📋 Mathlib.CategoryTheory.Limits.MorphismProperty
{T : Type u_1} [CategoryTheory.Category.{v_1, u_1} T] (P : CategoryTheory.MorphismProperty T) {X : T} [P.ContainsIdentities] (Y : P.Over ⊤ X) : Unique (Y ⟶ CategoryTheory.MorphismProperty.Over.mk ⊤ (CategoryTheory.CategoryStruct.id X) ⋯) - CategoryTheory.MorphismProperty.Under.instUniqueHomTopMkId 📋 Mathlib.CategoryTheory.Limits.MorphismProperty
{T : Type u_1} [CategoryTheory.Category.{v_1, u_1} T] (P : CategoryTheory.MorphismProperty T) {X : T} [P.ContainsIdentities] (Y : P.Under ⊤ X) : Unique (CategoryTheory.MorphismProperty.Under.mk ⊤ (CategoryTheory.CategoryStruct.id X) ⋯ ⟶ Y) - HomotopicalAlgebra.instWeakEquivalenceIdOfContainsIdentitiesWeakEquivalences 📋 Mathlib.AlgebraicTopology.ModelCategory.Instances
(C : Type u) [CategoryTheory.Category.{v, u} C] [HomotopicalAlgebra.CategoryWithWeakEquivalences C] [(HomotopicalAlgebra.weakEquivalences C).ContainsIdentities] (X : C) : HomotopicalAlgebra.WeakEquivalence (CategoryTheory.CategoryStruct.id X) - HomotopicalAlgebra.Cylinder.instWeakEquivalenceI₀ 📋 Mathlib.AlgebraicTopology.ModelCategory.Cylinder
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : C} [HomotopicalAlgebra.CategoryWithWeakEquivalences C] (P : HomotopicalAlgebra.Cylinder A) [(HomotopicalAlgebra.weakEquivalences C).HasTwoOutOfThreeProperty] [(HomotopicalAlgebra.weakEquivalences C).ContainsIdentities] : HomotopicalAlgebra.WeakEquivalence P.i₀ - HomotopicalAlgebra.Cylinder.instWeakEquivalenceI₁ 📋 Mathlib.AlgebraicTopology.ModelCategory.Cylinder
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : C} [HomotopicalAlgebra.CategoryWithWeakEquivalences C] (P : HomotopicalAlgebra.Cylinder A) [(HomotopicalAlgebra.weakEquivalences C).HasTwoOutOfThreeProperty] [(HomotopicalAlgebra.weakEquivalences C).ContainsIdentities] : HomotopicalAlgebra.WeakEquivalence P.i₁ - HomotopicalAlgebra.PathObject.instWeakEquivalenceP₀ 📋 Mathlib.AlgebraicTopology.ModelCategory.PathObject
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : C} [HomotopicalAlgebra.CategoryWithWeakEquivalences C] (P : HomotopicalAlgebra.PathObject A) [(HomotopicalAlgebra.weakEquivalences C).HasTwoOutOfThreeProperty] [(HomotopicalAlgebra.weakEquivalences C).ContainsIdentities] : HomotopicalAlgebra.WeakEquivalence P.p₀ - HomotopicalAlgebra.PathObject.instWeakEquivalenceP₁ 📋 Mathlib.AlgebraicTopology.ModelCategory.PathObject
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : C} [HomotopicalAlgebra.CategoryWithWeakEquivalences C] (P : HomotopicalAlgebra.PathObject A) [(HomotopicalAlgebra.weakEquivalences C).HasTwoOutOfThreeProperty] [(HomotopicalAlgebra.weakEquivalences C).ContainsIdentities] : HomotopicalAlgebra.WeakEquivalence P.p₁ - HomotopicalAlgebra.Cylinder.LeftHomotopy.weakEquivalence_iff 📋 Mathlib.AlgebraicTopology.ModelCategory.LeftHomotopy
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y : C} [HomotopicalAlgebra.CategoryWithWeakEquivalences C] (P : HomotopicalAlgebra.Cylinder X) [(HomotopicalAlgebra.weakEquivalences C).HasTwoOutOfThreeProperty] [(HomotopicalAlgebra.weakEquivalences C).ContainsIdentities] {f₀ f₁ : X ⟶ Y} (h : P.LeftHomotopy f₀ f₁) : HomotopicalAlgebra.WeakEquivalence f₀ ↔ HomotopicalAlgebra.WeakEquivalence f₁ - HomotopicalAlgebra.PathObject.RightHomotopy.weakEquivalence_iff 📋 Mathlib.AlgebraicTopology.ModelCategory.RightHomotopy
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y : C} [HomotopicalAlgebra.CategoryWithWeakEquivalences C] (P : HomotopicalAlgebra.PathObject Y) [(HomotopicalAlgebra.weakEquivalences C).HasTwoOutOfThreeProperty] [(HomotopicalAlgebra.weakEquivalences C).ContainsIdentities] {f₀ f₁ : X ⟶ Y} (h : P.RightHomotopy f₀ f₁) : HomotopicalAlgebra.WeakEquivalence f₀ ↔ HomotopicalAlgebra.WeakEquivalence f₁ - CategoryTheory.LocalizerMorphism.instHasLeftResolutionsIdOfContainsIdentities 📋 Mathlib.CategoryTheory.Localization.DerivabilityStructure.Basic
{C₁ : Type u₁} [CategoryTheory.Category.{v₁, u₁} C₁] {W₁ : CategoryTheory.MorphismProperty C₁} [W₁.ContainsIdentities] : (CategoryTheory.LocalizerMorphism.id W₁).HasLeftResolutions - CategoryTheory.LocalizerMorphism.instHasRightResolutionsIdOfContainsIdentities 📋 Mathlib.CategoryTheory.Localization.DerivabilityStructure.Basic
{C₁ : Type u₁} [CategoryTheory.Category.{v₁, u₁} C₁] {W₁ : CategoryTheory.MorphismProperty C₁} [W₁.ContainsIdentities] : (CategoryTheory.LocalizerMorphism.id W₁).HasRightResolutions - CategoryTheory.LocalizerMorphism.instIsLeftDerivabilityStructureIdOfContainsIdentities 📋 Mathlib.CategoryTheory.Localization.DerivabilityStructure.Basic
{C₁ : Type u₁} [CategoryTheory.Category.{v₁, u₁} C₁] {W₁ : CategoryTheory.MorphismProperty C₁} [W₁.ContainsIdentities] : (CategoryTheory.LocalizerMorphism.id W₁).IsLeftDerivabilityStructure - CategoryTheory.LocalizerMorphism.instIsRightDerivabilityStructureIdOfContainsIdentities 📋 Mathlib.CategoryTheory.Localization.DerivabilityStructure.Basic
{C₁ : Type u₁} [CategoryTheory.Category.{v₁, u₁} C₁] {W₁ : CategoryTheory.MorphismProperty C₁} [W₁.ContainsIdentities] : (CategoryTheory.LocalizerMorphism.id W₁).IsRightDerivabilityStructure - CategoryTheory.LocalizerMorphism.IsLeftDerivabilityStructure.mk' 📋 Mathlib.CategoryTheory.Localization.DerivabilityStructure.Constructor
{C₁ : Type u_1} {C₂ : Type u_2} [CategoryTheory.Category.{v_1, u_1} C₁] [CategoryTheory.Category.{v_2, u_2} C₂] {W₁ : CategoryTheory.MorphismProperty C₁} {W₂ : CategoryTheory.MorphismProperty C₂} (Φ : CategoryTheory.LocalizerMorphism W₁ W₂) [∀ (X₂ : C₂), CategoryTheory.IsConnected (Φ.LeftResolution X₂)] [Φ.arrow.HasLeftResolutions] [W₂.ContainsIdentities] [Φ.IsLocalizedEquivalence] : Φ.IsLeftDerivabilityStructure - CategoryTheory.LocalizerMorphism.IsRightDerivabilityStructure.mk' 📋 Mathlib.CategoryTheory.Localization.DerivabilityStructure.Constructor
{C₁ : Type u_1} {C₂ : Type u_2} [CategoryTheory.Category.{v_1, u_1} C₁] [CategoryTheory.Category.{v_2, u_2} C₂] {W₁ : CategoryTheory.MorphismProperty C₁} {W₂ : CategoryTheory.MorphismProperty C₂} (Φ : CategoryTheory.LocalizerMorphism W₁ W₂) [∀ (X₂ : C₂), CategoryTheory.IsConnected (Φ.RightResolution X₂)] [Φ.arrow.HasRightResolutions] [W₂.ContainsIdentities] [Φ.IsLocalizedEquivalence] : Φ.IsRightDerivabilityStructure - CategoryTheory.LocalizerMorphism.IsRightDerivabilityStructure.Constructor.isConnected 📋 Mathlib.CategoryTheory.Localization.DerivabilityStructure.Constructor
{C₁ : Type u_1} {C₂ : Type u_2} [CategoryTheory.Category.{v_1, u_1} C₁] [CategoryTheory.Category.{v_2, u_2} C₂] {W₁ : CategoryTheory.MorphismProperty C₁} {W₂ : CategoryTheory.MorphismProperty C₂} (Φ : CategoryTheory.LocalizerMorphism W₁ W₂) [∀ (X₂ : C₂), CategoryTheory.IsConnected (Φ.RightResolution X₂)] [Φ.arrow.HasRightResolutions] [W₂.ContainsIdentities] {D : Type u_3} [CategoryTheory.Category.{v_3, u_3} D] (L : CategoryTheory.Functor C₂ D) [L.IsLocalization W₂] {X₂ : C₂} {X₃ : D} (y : L.obj X₂ ⟶ X₃) : CategoryTheory.IsConnected ((CategoryTheory.TwoSquare.mk Φ.functor (Φ.functor.comp L) L (CategoryTheory.Functor.id D) (Φ.functor.comp L).rightUnitor.inv).CostructuredArrowDownwards y) - CategoryTheory.Precoverage.instContainsIdentitiesMorphismPropertyOfHasIsos 📋 Mathlib.CategoryTheory.Sites.MorphismProperty
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {K : CategoryTheory.Precoverage C} [K.HasIsos] : K.morphismProperty.ContainsIdentities - CategoryTheory.MorphismProperty.instHasIsosPrecoverageOfContainsIdentitiesOfRespectsIso 📋 Mathlib.CategoryTheory.Sites.MorphismProperty
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {P : CategoryTheory.MorphismProperty C} [P.ContainsIdentities] [P.RespectsIso] : P.precoverage.HasIsos - AlgebraicGeometry.Scheme.instHasIsosPrecoverageOfContainsIdentitiesOfRespectsIso 📋 Mathlib.AlgebraicGeometry.Sites.MorphismProperty
(P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme) [P.ContainsIdentities] [P.RespectsIso] : (AlgebraicGeometry.Scheme.precoverage P).HasIsos - AlgebraicGeometry.Scheme.coverOfIsIso 📋 Mathlib.AlgebraicGeometry.Cover.MorphismProperty
{P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} [P.ContainsIdentities] [P.RespectsIso] {X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) [CategoryTheory.IsIso f] : AlgebraicGeometry.Scheme.Cover (AlgebraicGeometry.Scheme.precoverage P) Y - AlgebraicGeometry.Scheme.Cover.pushforwardIso 📋 Mathlib.AlgebraicGeometry.Cover.MorphismProperty
{P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} [P.RespectsIso] [P.ContainsIdentities] [P.IsStableUnderComposition] {X Y : AlgebraicGeometry.Scheme} (𝒰 : AlgebraicGeometry.Scheme.Cover (AlgebraicGeometry.Scheme.precoverage P) X) (f : X ⟶ Y) [CategoryTheory.IsIso f] : AlgebraicGeometry.Scheme.Cover (AlgebraicGeometry.Scheme.precoverage P) Y - AlgebraicGeometry.Scheme.coverOfIsIso_I₀ 📋 Mathlib.AlgebraicGeometry.Cover.MorphismProperty
{P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} [P.ContainsIdentities] [P.RespectsIso] {X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) [CategoryTheory.IsIso f] : (AlgebraicGeometry.Scheme.coverOfIsIso f).I₀ = PUnit.{v + 1} - AlgebraicGeometry.Scheme.coverOfIsIso_X 📋 Mathlib.AlgebraicGeometry.Cover.MorphismProperty
{P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} [P.ContainsIdentities] [P.RespectsIso] {X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) [CategoryTheory.IsIso f] (x✝ : PUnit.{v + 1}) : (AlgebraicGeometry.Scheme.coverOfIsIso f).X x✝ = X - AlgebraicGeometry.Scheme.coverOfIsIso_f 📋 Mathlib.AlgebraicGeometry.Cover.MorphismProperty
{P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} [P.ContainsIdentities] [P.RespectsIso] {X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) [CategoryTheory.IsIso f] (x✝ : PUnit.{v + 1}) : (AlgebraicGeometry.Scheme.coverOfIsIso f).f x✝ = f - AlgebraicGeometry.Scheme.Cover.pushforwardIso_I₀ 📋 Mathlib.AlgebraicGeometry.Cover.MorphismProperty
{P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} [P.RespectsIso] [P.ContainsIdentities] [P.IsStableUnderComposition] {X Y : AlgebraicGeometry.Scheme} (𝒰 : AlgebraicGeometry.Scheme.Cover (AlgebraicGeometry.Scheme.precoverage P) X) (f : X ⟶ Y) [CategoryTheory.IsIso f] : (𝒰.pushforwardIso f).I₀ = 𝒰.I₀ - AlgebraicGeometry.Scheme.Cover.pushforwardIso_X 📋 Mathlib.AlgebraicGeometry.Cover.MorphismProperty
{P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} [P.RespectsIso] [P.ContainsIdentities] [P.IsStableUnderComposition] {X Y : AlgebraicGeometry.Scheme} (𝒰 : AlgebraicGeometry.Scheme.Cover (AlgebraicGeometry.Scheme.precoverage P) X) (f : X ⟶ Y) [CategoryTheory.IsIso f] (x✝ : 𝒰.I₀) : (𝒰.pushforwardIso f).X x✝ = 𝒰.X x✝ - AlgebraicGeometry.Scheme.Cover.pushforwardIso_f 📋 Mathlib.AlgebraicGeometry.Cover.MorphismProperty
{P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} [P.RespectsIso] [P.ContainsIdentities] [P.IsStableUnderComposition] {X Y : AlgebraicGeometry.Scheme} (𝒰 : AlgebraicGeometry.Scheme.Cover (AlgebraicGeometry.Scheme.precoverage P) X) (f : X ⟶ Y) [CategoryTheory.IsIso f] (x✝ : 𝒰.I₀) : (𝒰.pushforwardIso f).f x✝ = CategoryTheory.CategoryStruct.comp (𝒰.f x✝) f - AlgebraicGeometry.IsZariskiLocalAtSource.of_isOpenImmersion 📋 Mathlib.AlgebraicGeometry.Morphisms.Basic
{P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} [AlgebraicGeometry.IsZariskiLocalAtSource P] {X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) [P.ContainsIdentities] [AlgebraicGeometry.IsOpenImmersion f] : P f - AlgebraicGeometry.HasRingHomProperty.containsIdentities 📋 Mathlib.AlgebraicGeometry.Morphisms.RingHomProperties
{P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} {Q : {R S : Type u} → [inst : CommRing R] → [inst_1 : CommRing S] → (R →+* S) → Prop} [AlgebraicGeometry.HasRingHomProperty P Q] (hP : RingHom.ContainsIdentities fun {R S} [CommRing R] [CommRing S] => Q) : P.ContainsIdentities - AlgebraicGeometry.HasAffineProperty.affineAnd_containsIdentities 📋 Mathlib.AlgebraicGeometry.Morphisms.AffineAnd
{Q : {R S : Type u} → [inst : CommRing R] → [inst_1 : CommRing S] → (R →+* S) → Prop} {P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} (hA : AlgebraicGeometry.HasAffineProperty P (AlgebraicGeometry.affineAnd fun {R S} [CommRing R] [CommRing S] => Q)) (hQi : RingHom.RespectsIso fun {R S} [CommRing R] [CommRing S] => Q) (hQ : RingHom.ContainsIdentities fun {R S} [CommRing R] [CommRing S] => Q) : P.ContainsIdentities - AlgebraicGeometry.IsFinite.instContainsIdentitiesScheme 📋 Mathlib.AlgebraicGeometry.Morphisms.Finite
: CategoryTheory.MorphismProperty.ContainsIdentities @AlgebraicGeometry.IsFinite - AlgebraicGeometry.Scheme.instOverCoverOfIsIsoOfIsOver 📋 Mathlib.AlgebraicGeometry.Cover.Over
{P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} (S : AlgebraicGeometry.Scheme) [P.IsStableUnderBaseChange] [AlgebraicGeometry.Scheme.IsJointlySurjectivePreserving P] [P.ContainsIdentities] [P.RespectsIso] {X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) [X.Over S] [Y.Over S] [AlgebraicGeometry.Scheme.Hom.IsOver f S] [CategoryTheory.IsIso f] : AlgebraicGeometry.Scheme.Cover.Over S (AlgebraicGeometry.Scheme.coverOfIsIso f) - AlgebraicGeometry.QuasiCompactCover.instCoverOfIsIso 📋 Mathlib.AlgebraicGeometry.Cover.QuasiCompact
{P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} [P.ContainsIdentities] [P.RespectsIso] {X Y : AlgebraicGeometry.Scheme} {f : X ⟶ Y} [CategoryTheory.IsIso f] : AlgebraicGeometry.QuasiCompactCover (AlgebraicGeometry.Scheme.coverOfIsIso f).toPreZeroHypercover - AlgebraicGeometry.sourceLocalClosure.instContainsIdentitiesScheme 📋 Mathlib.AlgebraicGeometry.Morphisms.LocalClosure
{W P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} [W.IsStableUnderBaseChange] [W.ContainsIdentities] [P.ContainsIdentities] : (AlgebraicGeometry.sourceLocalClosure W P).ContainsIdentities - AlgebraicGeometry.sourceLocalClosure.le 📋 Mathlib.AlgebraicGeometry.Morphisms.LocalClosure
{W P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} [W.ContainsIdentities] [W.RespectsIso] : P ≤ AlgebraicGeometry.sourceLocalClosure W P - AlgebraicGeometry.IsLocalIso.le_of_isZariskiLocalAtSource 📋 Mathlib.AlgebraicGeometry.Morphisms.LocalIso
(P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme) [P.ContainsIdentities] [AlgebraicGeometry.IsZariskiLocalAtSource P] : @AlgebraicGeometry.IsLocalIso ≤ P - AlgebraicGeometry.IsLocalIso.eq_iInf 📋 Mathlib.AlgebraicGeometry.Morphisms.LocalIso
: @AlgebraicGeometry.IsLocalIso = ⨅ P, ⨅ (_ : P.ContainsIdentities), ⨅ (_ : AlgebraicGeometry.IsZariskiLocalAtSource P), P - AlgebraicGeometry.Scheme.exists_hom_isAffine_of_isZariskiLocalAtSource 📋 Mathlib.AlgebraicGeometry.Morphisms.Descent
(P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme) (X : AlgebraicGeometry.Scheme) [CompactSpace ↥X] [AlgebraicGeometry.IsZariskiLocalAtSource P] [P.ContainsIdentities] : ∃ Y p, AlgebraicGeometry.Surjective p ∧ P p ∧ AlgebraicGeometry.IsAffine Y - AlgebraicGeometry.Scheme.zariskiPrecoverage_le_propQCPrecoverage 📋 Mathlib.AlgebraicGeometry.Sites.QuasiCompact
{P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} [P.ContainsIdentities] [AlgebraicGeometry.IsZariskiLocalAtSource P] : AlgebraicGeometry.Scheme.zariskiPrecoverage ≤ AlgebraicGeometry.Scheme.propQCPrecoverage P - CategoryTheory.MorphismProperty.overEquivOfIsInitial 📋 Mathlib.CategoryTheory.Comma.Over.StrictInitial
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (P Q : CategoryTheory.MorphismProperty C) [P.ContainsIdentities] [Q.IsMultiplicative] [Q.RespectsIso] [CategoryTheory.Limits.HasStrictInitialObjects C] (X : C) (h : CategoryTheory.Limits.IsInitial X) : P.Over Q X ≌ CategoryTheory.Discrete PUnit.{w + 1} - CategoryTheory.MorphismProperty.underEquivOfIsTerminal 📋 Mathlib.CategoryTheory.Comma.Over.StrictInitial
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (P Q : CategoryTheory.MorphismProperty C) [P.ContainsIdentities] [Q.IsMultiplicative] [Q.RespectsIso] [CategoryTheory.Limits.HasStrictTerminalObjects C] (X : C) (h : CategoryTheory.Limits.IsTerminal X) : P.Under Q X ≌ CategoryTheory.Discrete PUnit.{w + 1} - CategoryTheory.MorphismProperty.overEquivOfIsInitial_functor 📋 Mathlib.CategoryTheory.Comma.Over.StrictInitial
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (P Q : CategoryTheory.MorphismProperty C) [P.ContainsIdentities] [Q.IsMultiplicative] [Q.RespectsIso] [CategoryTheory.Limits.HasStrictInitialObjects C] (X : C) (h : CategoryTheory.Limits.IsInitial X) : (CategoryTheory.MorphismProperty.overEquivOfIsInitial.{w, v_1, u_1} P Q X h).functor = CategoryTheory.Functor.star (P.Over Q X) - CategoryTheory.MorphismProperty.underEquivOfIsTerminal_functor 📋 Mathlib.CategoryTheory.Comma.Over.StrictInitial
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (P Q : CategoryTheory.MorphismProperty C) [P.ContainsIdentities] [Q.IsMultiplicative] [Q.RespectsIso] [CategoryTheory.Limits.HasStrictTerminalObjects C] (X : C) (h : CategoryTheory.Limits.IsTerminal X) : (CategoryTheory.MorphismProperty.underEquivOfIsTerminal.{w, v_1, u_1} P Q X h).functor = CategoryTheory.Functor.star (P.Under Q X) - CategoryTheory.MorphismProperty.overEquivOfIsInitial_inverse 📋 Mathlib.CategoryTheory.Comma.Over.StrictInitial
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (P Q : CategoryTheory.MorphismProperty C) [P.ContainsIdentities] [Q.IsMultiplicative] [Q.RespectsIso] [CategoryTheory.Limits.HasStrictInitialObjects C] (X : C) (h : CategoryTheory.Limits.IsInitial X) : (CategoryTheory.MorphismProperty.overEquivOfIsInitial.{w, v_1, u_1} P Q X h).inverse = CategoryTheory.Functor.fromPUnit (CategoryTheory.MorphismProperty.Over.mk Q (CategoryTheory.CategoryStruct.id X) ⋯) - CategoryTheory.MorphismProperty.underEquivOfIsTerminal_inverse 📋 Mathlib.CategoryTheory.Comma.Over.StrictInitial
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (P Q : CategoryTheory.MorphismProperty C) [P.ContainsIdentities] [Q.IsMultiplicative] [Q.RespectsIso] [CategoryTheory.Limits.HasStrictTerminalObjects C] (X : C) (h : CategoryTheory.Limits.IsTerminal X) : (CategoryTheory.MorphismProperty.underEquivOfIsTerminal.{w, v_1, u_1} P Q X h).inverse = CategoryTheory.Functor.fromPUnit (CategoryTheory.MorphismProperty.Under.mk Q (CategoryTheory.CategoryStruct.id X) ⋯) - CategoryTheory.MorphismProperty.overEquivOfIsInitial_counitIso 📋 Mathlib.CategoryTheory.Comma.Over.StrictInitial
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (P Q : CategoryTheory.MorphismProperty C) [P.ContainsIdentities] [Q.IsMultiplicative] [Q.RespectsIso] [CategoryTheory.Limits.HasStrictInitialObjects C] (X : C) (h : CategoryTheory.Limits.IsInitial X) : (CategoryTheory.MorphismProperty.overEquivOfIsInitial.{w, v_1, u_1} P Q X h).counitIso = CategoryTheory.Iso.refl ((CategoryTheory.Functor.fromPUnit (CategoryTheory.MorphismProperty.Over.mk Q (CategoryTheory.CategoryStruct.id X) ⋯)).comp (CategoryTheory.Functor.star (P.Over Q X))) - CategoryTheory.MorphismProperty.underEquivOfIsTerminal_counitIso 📋 Mathlib.CategoryTheory.Comma.Over.StrictInitial
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (P Q : CategoryTheory.MorphismProperty C) [P.ContainsIdentities] [Q.IsMultiplicative] [Q.RespectsIso] [CategoryTheory.Limits.HasStrictTerminalObjects C] (X : C) (h : CategoryTheory.Limits.IsTerminal X) : (CategoryTheory.MorphismProperty.underEquivOfIsTerminal.{w, v_1, u_1} P Q X h).counitIso = CategoryTheory.Iso.refl ((CategoryTheory.Functor.fromPUnit (CategoryTheory.MorphismProperty.Under.mk Q (CategoryTheory.CategoryStruct.id X) ⋯)).comp (CategoryTheory.Functor.star (P.Under Q X))) - CategoryTheory.MorphismProperty.underEquivOfIsTerminal_unitIso 📋 Mathlib.CategoryTheory.Comma.Over.StrictInitial
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (P Q : CategoryTheory.MorphismProperty C) [P.ContainsIdentities] [Q.IsMultiplicative] [Q.RespectsIso] [CategoryTheory.Limits.HasStrictTerminalObjects C] (X : C) (h : CategoryTheory.Limits.IsTerminal X) : (CategoryTheory.MorphismProperty.underEquivOfIsTerminal.{w, v_1, u_1} P Q X h).unitIso = CategoryTheory.NatIso.ofComponents (fun A => CategoryTheory.MorphismProperty.Under.isoMk (CategoryTheory.asIso A.hom).symm ⋯) ⋯ - CategoryTheory.MorphismProperty.overEquivOfIsInitial_unitIso 📋 Mathlib.CategoryTheory.Comma.Over.StrictInitial
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (P Q : CategoryTheory.MorphismProperty C) [P.ContainsIdentities] [Q.IsMultiplicative] [Q.RespectsIso] [CategoryTheory.Limits.HasStrictInitialObjects C] (X : C) (h : CategoryTheory.Limits.IsInitial X) : (CategoryTheory.MorphismProperty.overEquivOfIsInitial.{w, v_1, u_1} P Q X h).unitIso = CategoryTheory.NatIso.ofComponents (fun A => CategoryTheory.MorphismProperty.Over.isoMk (CategoryTheory.asIso A.hom) ⋯) ⋯ - CategoryTheory.MorphismProperty.isContinuous_comap_forget 📋 Mathlib.CategoryTheory.MorphismProperty.CommaSites
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {P : CategoryTheory.MorphismProperty C} {S : C} [P.IsStableUnderComposition] (K : CategoryTheory.Precoverage C) [K.HasIsos] [K.IsStableUnderBaseChange] [K.IsStableUnderComposition] [K.HasPullbacks] [CategoryTheory.Limits.HasFiniteWidePullbacks C] [P.HasOfPostcompProperty P] [P.IsStableUnderBaseChange] [P.ContainsIdentities] (H : K ≤ P.precoverage) : (CategoryTheory.MorphismProperty.Over.forget P ⊤ S).IsContinuous (CategoryTheory.Precoverage.comap ((CategoryTheory.MorphismProperty.Over.forget P ⊤ S).comp (CategoryTheory.Over.forget S)) K).toGrothendieck (K.toGrothendieck.over S) - CategoryTheory.MorphismProperty.toGrothendieck_comap_forget_eq_inducedTopology 📋 Mathlib.CategoryTheory.MorphismProperty.CommaSites
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {P : CategoryTheory.MorphismProperty C} {S : C} [P.IsStableUnderComposition] (K : CategoryTheory.Precoverage C) [K.HasIsos] [K.IsStableUnderBaseChange] [K.IsStableUnderComposition] [K.HasPullbacks] [CategoryTheory.Limits.HasFiniteWidePullbacks C] [P.HasOfPostcompProperty P] [P.IsStableUnderBaseChange] [P.ContainsIdentities] (H : K ≤ P.precoverage) : (CategoryTheory.Precoverage.comap ((CategoryTheory.MorphismProperty.Over.forget P ⊤ S).comp (CategoryTheory.Over.forget S)) K).toGrothendieck = (CategoryTheory.MorphismProperty.Over.forget P ⊤ S).inducedTopology (K.toGrothendieck.over S) - CategoryTheory.Span.id 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] (c : C) : CategoryTheory.Span Wₗ Wᵣ c c - CategoryTheory.Span.id_apex 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] (c : C) : (CategoryTheory.Span.id c).apex = c - CategoryTheory.Span.SpanBicat.instBicategory 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] : CategoryTheory.Bicategory (CategoryTheory.Span.SpanBicat C Wₗ Wᵣ) - CategoryTheory.Span.SpanBicat.instCategoryStruct 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] : CategoryTheory.CategoryStruct.{max u_1 v_1, u_1} (CategoryTheory.Span.SpanBicat C Wₗ Wᵣ) - CategoryTheory.Span.id_l 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] (c : C) : (CategoryTheory.Span.id c).l = CategoryTheory.CategoryStruct.id c - CategoryTheory.Span.id_r 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] (c : C) : (CategoryTheory.Span.id c).r = CategoryTheory.CategoryStruct.id c - CategoryTheory.Span.SpanBicat.instCategoryHom 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} : CategoryTheory.Category.{v_1, max u_1 v_1} (X ⟶ Y) - CategoryTheory.Span.SpanBicat.id_apex 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] (X : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ) : (CategoryTheory.CategoryStruct.id X).apex = X.of - CategoryTheory.Span.SpanBicat.mkHom 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} {apex : C} (l : apex ⟶ X.of) (r : apex ⟶ Y.of) (wl : Wₗ l) (wr : Wᵣ r) : X ⟶ Y - CategoryTheory.Span.SpanBicat.instIsIsoLId 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} : CategoryTheory.IsIso (CategoryTheory.CategoryStruct.id X).l - CategoryTheory.Span.SpanBicat.instIsIsoRId 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} : CategoryTheory.IsIso (CategoryTheory.CategoryStruct.id X).r - CategoryTheory.Span.SpanBicat.id_l 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} : (CategoryTheory.CategoryStruct.id X).l = CategoryTheory.CategoryStruct.id X.of - CategoryTheory.Span.SpanBicat.id_r 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} : (CategoryTheory.CategoryStruct.id X).r = CategoryTheory.CategoryStruct.id X.of - CategoryTheory.Span.SpanBicat.leftUnitor 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {c c' : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S₁ : c ⟶ c') : CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.id c) S₁ ≅ S₁ - CategoryTheory.Span.SpanBicat.rightUnitor 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {c c' : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S₁ : c ⟶ c') : CategoryTheory.CategoryStruct.comp S₁ (CategoryTheory.CategoryStruct.id c') ≅ S₁ - CategoryTheory.Span.SpanBicat.πᵣ 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S₁ : X ⟶ Y) (S₂ : Y ⟶ Z) : (CategoryTheory.CategoryStruct.comp S₁ S₂).apex ⟶ S₂.apex - CategoryTheory.Span.SpanBicat.πₗ 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S₁ : X ⟶ Y) (S₂ : Y ⟶ Z) : (CategoryTheory.CategoryStruct.comp S₁ S₂).apex ⟶ S₁.apex - CategoryTheory.Span.SpanBicat.apexIso 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} {S S' : X ⟶ Y} (e : S ≅ S') : S.apex ≅ S'.apex - CategoryTheory.Span.SpanBicat.compPullbackCone 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S₁ : X ⟶ Y) (S₂ : Y ⟶ Z) : CategoryTheory.Limits.PullbackCone S₁.r S₂.l - CategoryTheory.Span.SpanBicat.instIsIsoπᵣId 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S : X ⟶ Y) : CategoryTheory.IsIso (CategoryTheory.Span.SpanBicat.πᵣ (CategoryTheory.CategoryStruct.id X) S) - CategoryTheory.Span.SpanBicat.instIsIsoπₗId 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S : X ⟶ Y) : CategoryTheory.IsIso (CategoryTheory.Span.SpanBicat.πₗ S (CategoryTheory.CategoryStruct.id Y)) - CategoryTheory.Span.SpanBicat.apexIso_refl 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S : X ⟶ Y) : CategoryTheory.Span.SpanBicat.apexIso (CategoryTheory.Iso.refl S) = CategoryTheory.Iso.refl S.apex - CategoryTheory.Span.SpanBicat.isLimitCompPullbackCone 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S₁ : X ⟶ Y) (S₂ : Y ⟶ Z) : CategoryTheory.Limits.IsLimit (CategoryTheory.Span.SpanBicat.compPullbackCone S₁ S₂) - CategoryTheory.Span.SpanBicat.hom₂_id_hom 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S : X ⟶ Y) : (CategoryTheory.CategoryStruct.id S).hom = CategoryTheory.CategoryStruct.id S.apex - CategoryTheory.Span.SpanBicat.compPullbackCone_pt 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S₁ : X ⟶ Y) (S₂ : Y ⟶ Z) : (CategoryTheory.Span.SpanBicat.compPullbackCone S₁ S₂).pt = (CategoryTheory.CategoryStruct.comp S₁ S₂).apex - CategoryTheory.Span.SpanBicat.associator 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {c₁ c₂ c₃ c₄ : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S₁ : c₁ ⟶ c₂) (S₂ : c₂ ⟶ c₃) (S₃ : c₃ ⟶ c₄) : CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp S₁ S₂) S₃ ≅ CategoryTheory.CategoryStruct.comp S₁ (CategoryTheory.CategoryStruct.comp S₂ S₃) - CategoryTheory.Span.SpanBicat.instIsIsoHomOfHom 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} {S S' : X ⟶ Y} (e : S ⟶ S') [CategoryTheory.IsIso e] : CategoryTheory.IsIso e.hom - CategoryTheory.Span.SpanBicat.comp_l 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S₁ : X ⟶ Y) (S₂ : Y ⟶ Z) : (CategoryTheory.CategoryStruct.comp S₁ S₂).l = CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πₗ S₁ S₂) S₁.l - CategoryTheory.Span.SpanBicat.comp_r 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S₁ : X ⟶ Y) (S₂ : Y ⟶ Z) : (CategoryTheory.CategoryStruct.comp S₁ S₂).r = CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πᵣ S₁ S₂) S₂.r - CategoryTheory.Span.SpanBicat.apexIso_hom 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} {S S' : X ⟶ Y} (e : S ≅ S') : (CategoryTheory.Span.SpanBicat.apexIso e).hom = e.hom.hom - CategoryTheory.Span.SpanBicat.apexIso_inv 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} {S S' : X ⟶ Y} (e : S ≅ S') : (CategoryTheory.Span.SpanBicat.apexIso e).inv = e.inv.hom - CategoryTheory.Span.SpanBicat.compLiftApex 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} {S₁ : X ⟶ Y} {S₂ : Y ⟶ Z} {c : C} (fₗ : c ⟶ S₁.apex) (fᵣ : c ⟶ S₂.apex) (hₘ : CategoryTheory.CategoryStruct.comp fₗ S₁.r = CategoryTheory.CategoryStruct.comp fᵣ S₂.l := by cat_disch) : c ⟶ (CategoryTheory.CategoryStruct.comp S₁ S₂).apex - CategoryTheory.Span.SpanBicat.compPullbackCone_fst 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S₁ : X ⟶ Y) (S₂ : Y ⟶ Z) : (CategoryTheory.Span.SpanBicat.compPullbackCone S₁ S₂).fst = CategoryTheory.Span.SpanBicat.πₗ S₁ S₂ - CategoryTheory.Span.SpanBicat.compPullbackCone_snd 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S₁ : X ⟶ Y) (S₂ : Y ⟶ Z) : (CategoryTheory.Span.SpanBicat.compPullbackCone S₁ S₂).snd = CategoryTheory.Span.SpanBicat.πᵣ S₁ S₂ - CategoryTheory.Span.SpanBicat.comp_comm 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S₁ : X ⟶ Y) (S₂ : Y ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πₗ S₁ S₂) S₁.r = CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πᵣ S₁ S₂) S₂.l - CategoryTheory.Span.SpanBicat.comp_l_assoc 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S₁ : X ⟶ Y) (S₂ : Y ⟶ Z) {Z✝ : C} (h : X.of ⟶ Z✝) : CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp S₁ S₂).l h = CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πₗ S₁ S₂) (CategoryTheory.CategoryStruct.comp S₁.l h) - CategoryTheory.Span.SpanBicat.comp_r_assoc 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S₁ : X ⟶ Y) (S₂ : Y ⟶ Z) {Z✝ : C} (h : Z.of ⟶ Z✝) : CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp S₁ S₂).r h = CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πᵣ S₁ S₂) (CategoryTheory.CategoryStruct.comp S₂.r h) - CategoryTheory.Span.SpanBicat.hom_inv_id_hom 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} {S S' : X ⟶ Y} (e : S ≅ S') : CategoryTheory.CategoryStruct.comp e.hom.hom e.inv.hom = CategoryTheory.CategoryStruct.id S.apex - CategoryTheory.Span.SpanBicat.inv_hom_id_hom 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} {S S' : X ⟶ Y} (e : S ≅ S') : CategoryTheory.CategoryStruct.comp e.inv.hom e.hom.hom = CategoryTheory.CategoryStruct.id S'.apex - CategoryTheory.Span.SpanBicat.compLiftApex_πᵣ 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} {S₁ : X ⟶ Y} {S₂ : Y ⟶ Z} {c : C} (fₗ : c ⟶ S₁.apex) (fᵣ : c ⟶ S₂.apex) (hₘ : CategoryTheory.CategoryStruct.comp fₗ S₁.r = CategoryTheory.CategoryStruct.comp fᵣ S₂.l := by cat_disch) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.compLiftApex fₗ fᵣ hₘ) (CategoryTheory.Span.SpanBicat.πᵣ S₁ S₂) = fᵣ - CategoryTheory.Span.SpanBicat.compLiftApex_πₗ 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} {S₁ : X ⟶ Y} {S₂ : Y ⟶ Z} {c : C} (fₗ : c ⟶ S₁.apex) (fᵣ : c ⟶ S₂.apex) (hₘ : CategoryTheory.CategoryStruct.comp fₗ S₁.r = CategoryTheory.CategoryStruct.comp fᵣ S₂.l := by cat_disch) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.compLiftApex fₗ fᵣ hₘ) (CategoryTheory.Span.SpanBicat.πₗ S₁ S₂) = fₗ - CategoryTheory.Span.SpanBicat.hom_inv_id_hom_assoc 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} {S S' : X ⟶ Y} (e : S ≅ S') {Z : C} (h : S.apex ⟶ Z) : CategoryTheory.CategoryStruct.comp e.hom.hom (CategoryTheory.CategoryStruct.comp e.inv.hom h) = h - CategoryTheory.Span.SpanBicat.inv_hom_id_hom_assoc 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} {S S' : X ⟶ Y} (e : S ≅ S') {Z : C} (h : S'.apex ⟶ Z) : CategoryTheory.CategoryStruct.comp e.inv.hom (CategoryTheory.CategoryStruct.comp e.hom.hom h) = h - CategoryTheory.Span.SpanBicat.leftUnitor_hom_hom 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S : X ⟶ Y) : (CategoryTheory.Bicategory.leftUnitor S).hom.hom = CategoryTheory.Span.SpanBicat.πᵣ (CategoryTheory.CategoryStruct.id X) S - CategoryTheory.Span.SpanBicat.rightUnitor_hom_hom 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S : X ⟶ Y) : (CategoryTheory.Bicategory.rightUnitor S).hom.hom = CategoryTheory.Span.SpanBicat.πₗ S (CategoryTheory.CategoryStruct.id Y) - CategoryTheory.Span.SpanBicat.inv_hom 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} {S S' : X ⟶ Y} (e : S ⟶ S') [CategoryTheory.IsIso e] : (CategoryTheory.inv e).hom = CategoryTheory.inv e.hom - CategoryTheory.Span.SpanBicat.comp_comm_assoc 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S₁ : X ⟶ Y) (S₂ : Y ⟶ Z) {Z✝ : C} (h : Y.of ⟶ Z✝) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πₗ S₁ S₂) (CategoryTheory.CategoryStruct.comp S₁.r h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πᵣ S₁ S₂) (CategoryTheory.CategoryStruct.comp S₂.l h) - CategoryTheory.Span.SpanBicat.mkHom₂_hom 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} {S S' : X ⟶ Y} (e : S.apex ⟶ S'.apex) (hₗ : CategoryTheory.CategoryStruct.comp e S'.l = S.l := by cat_disch) (hᵣ : CategoryTheory.CategoryStruct.comp e S'.r = S.r := by cat_disch) : (CategoryTheory.Span.SpanBicat.mkHom₂ e hₗ hᵣ).hom = e - CategoryTheory.Span.SpanBicat.mkHom₂ 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} {S S' : X ⟶ Y} (e : S.apex ⟶ S'.apex) (hₗ : CategoryTheory.CategoryStruct.comp e S'.l = S.l := by cat_disch) (hᵣ : CategoryTheory.CategoryStruct.comp e S'.r = S.r := by cat_disch) : S ⟶ S' - CategoryTheory.Span.SpanBicat.hom₂_ext 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} {S S' : X ⟶ Y} {f g : S ⟶ S'} (h : f.hom = g.hom) : f = g - CategoryTheory.Span.SpanBicat.hom₂_ext_iff 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} {S S' : X ⟶ Y} {f g : S ⟶ S'} : f = g ↔ f.hom = g.hom - CategoryTheory.Span.SpanBicat.compLiftApex_πᵣ_assoc 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} {S₁ : X ⟶ Y} {S₂ : Y ⟶ Z} {c : C} (fₗ : c ⟶ S₁.apex) (fᵣ : c ⟶ S₂.apex) (hₘ : CategoryTheory.CategoryStruct.comp fₗ S₁.r = CategoryTheory.CategoryStruct.comp fᵣ S₂.l := by cat_disch) {Z✝ : C} (h : S₂.apex ⟶ Z✝) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.compLiftApex fₗ fᵣ hₘ) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πᵣ S₁ S₂) h) = CategoryTheory.CategoryStruct.comp fᵣ h - CategoryTheory.Span.SpanBicat.compLiftApex_πₗ_assoc 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} {S₁ : X ⟶ Y} {S₂ : Y ⟶ Z} {c : C} (fₗ : c ⟶ S₁.apex) (fᵣ : c ⟶ S₂.apex) (hₘ : CategoryTheory.CategoryStruct.comp fₗ S₁.r = CategoryTheory.CategoryStruct.comp fᵣ S₂.l := by cat_disch) {Z✝ : C} (h : S₁.apex ⟶ Z✝) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.compLiftApex fₗ fᵣ hₘ) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πₗ S₁ S₂) h) = CategoryTheory.CategoryStruct.comp fₗ h - CategoryTheory.Span.SpanBicat.leftUnitor_inv_hom_πᵣ 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S : X ⟶ Y) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.leftUnitor S).inv.hom (CategoryTheory.Span.SpanBicat.πᵣ (CategoryTheory.CategoryStruct.id X) S) = CategoryTheory.CategoryStruct.id S.apex - CategoryTheory.Span.SpanBicat.rightUnitor_inv_hom_πₗ 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S : X ⟶ Y) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.rightUnitor S).inv.hom (CategoryTheory.Span.SpanBicat.πₗ S (CategoryTheory.CategoryStruct.id Y)) = CategoryTheory.CategoryStruct.id S.apex - CategoryTheory.Span.SpanBicat.mkIso₂ 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} {S S' : X ⟶ Y} (e : S.apex ≅ S'.apex) (hₗ : CategoryTheory.CategoryStruct.comp e.hom S'.l = S.l := by cat_disch) (hᵣ : CategoryTheory.CategoryStruct.comp e.hom S'.r = S.r := by cat_disch) : S ≅ S' - CategoryTheory.Span.SpanBicat.leftUnitor_inv_hom_πₗ 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S : X ⟶ Y) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.leftUnitor S).inv.hom (CategoryTheory.Span.SpanBicat.πₗ (CategoryTheory.CategoryStruct.id X) S) = S.l - CategoryTheory.Span.SpanBicat.rightUnitor_inv_hom_πᵣ 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S : X ⟶ Y) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.rightUnitor S).inv.hom (CategoryTheory.Span.SpanBicat.πᵣ S (CategoryTheory.CategoryStruct.id Y)) = S.r - CategoryTheory.Span.SpanBicat.whiskerLeft_hom_πₗ 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S : X ⟶ Y) {S₁ S₂ : Y ⟶ Z} (f : S₁ ⟶ S₂) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.whiskerLeft S f).hom (CategoryTheory.Span.SpanBicat.πₗ S S₂) = CategoryTheory.Span.SpanBicat.πₗ S S₁ - CategoryTheory.Span.SpanBicat.whiskerRight_hom_πᵣ 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} {S₁ S₂ : X ⟶ Y} (f : S₁ ⟶ S₂) (S : Y ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.whiskerRight f S).hom (CategoryTheory.Span.SpanBicat.πᵣ S₂ S) = CategoryTheory.Span.SpanBicat.πᵣ S₁ S - CategoryTheory.Span.SpanBicat.hom₂_comp_hom 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} {S S' S'' : X ⟶ Y} (f : S ⟶ S') (g : S' ⟶ S'') : (CategoryTheory.CategoryStruct.comp f g).hom = CategoryTheory.CategoryStruct.comp f.hom g.hom - CategoryTheory.Span.SpanBicat.rightUnitor_inv_hom_πₗ_assoc 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S : X ⟶ Y) {Z : C} (h : S.apex ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.rightUnitor S).inv.hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πₗ S (CategoryTheory.CategoryStruct.id Y)) h) = h - CategoryTheory.Span.SpanBicat.eqToHom_hom 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S S' : X ⟶ Y) (h : S = S') : (CategoryTheory.eqToHom h).hom = CategoryTheory.eqToHom ⋯ - CategoryTheory.Span.SpanBicat.comp_hom_ext_apex 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} {S₁ : X ⟶ Y} {S₂ : Y ⟶ Z} {c : C} {f g : c ⟶ (CategoryTheory.CategoryStruct.comp S₁ S₂).apex} (hₗ : CategoryTheory.CategoryStruct.comp f (CategoryTheory.Span.SpanBicat.πₗ S₁ S₂) = CategoryTheory.CategoryStruct.comp g (CategoryTheory.Span.SpanBicat.πₗ S₁ S₂)) (hᵣ : CategoryTheory.CategoryStruct.comp f (CategoryTheory.Span.SpanBicat.πᵣ S₁ S₂) = CategoryTheory.CategoryStruct.comp g (CategoryTheory.Span.SpanBicat.πᵣ S₁ S₂)) : f = g - CategoryTheory.Span.SpanBicat.comp_hom_ext_apex_iff 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} {S₁ : X ⟶ Y} {S₂ : Y ⟶ Z} {c : C} {f g : c ⟶ (CategoryTheory.CategoryStruct.comp S₁ S₂).apex} : f = g ↔ CategoryTheory.CategoryStruct.comp f (CategoryTheory.Span.SpanBicat.πₗ S₁ S₂) = CategoryTheory.CategoryStruct.comp g (CategoryTheory.Span.SpanBicat.πₗ S₁ S₂) ∧ CategoryTheory.CategoryStruct.comp f (CategoryTheory.Span.SpanBicat.πᵣ S₁ S₂) = CategoryTheory.CategoryStruct.comp g (CategoryTheory.Span.SpanBicat.πᵣ S₁ S₂) - CategoryTheory.Span.SpanBicat.whiskerLeft_hom_πᵣ 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S : X ⟶ Y) {S₁ S₂ : Y ⟶ Z} (f : S₁ ⟶ S₂) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.whiskerLeft S f).hom (CategoryTheory.Span.SpanBicat.πᵣ S S₂) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πᵣ S S₁) f.hom - CategoryTheory.Span.SpanBicat.whiskerRight_hom_πₗ 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} {S₁ S₂ : X ⟶ Y} (f : S₁ ⟶ S₂) (S : Y ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.whiskerRight f S).hom (CategoryTheory.Span.SpanBicat.πₗ S₂ S) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πₗ S₁ S) f.hom - CategoryTheory.Span.SpanBicat.whiskerLeft_hom_πₗ_assoc 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S : X ⟶ Y) {S₁ S₂ : Y ⟶ Z} (f : S₁ ⟶ S₂) {Z✝ : C} (h : S.apex ⟶ Z✝) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.whiskerLeft S f).hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πₗ S S₂) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πₗ S S₁) h - CategoryTheory.Span.SpanBicat.whiskerRight_hom_πᵣ_assoc 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} {S₁ S₂ : X ⟶ Y} (f : S₁ ⟶ S₂) (S : Y ⟶ Z) {Z✝ : C} (h : S.apex ⟶ Z✝) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.whiskerRight f S).hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πᵣ S₂ S) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πᵣ S₁ S) h - CategoryTheory.Span.SpanBicat.rightUnitor_inv_hom_πᵣ_assoc 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S : X ⟶ Y) {Z : C} (h : (CategoryTheory.CategoryStruct.id Y).apex ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.rightUnitor S).inv.hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πᵣ S (CategoryTheory.CategoryStruct.id Y)) h) = CategoryTheory.CategoryStruct.comp S.r h - CategoryTheory.Span.SpanBicat.compLift 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} {S₁ : X ⟶ Y} {S₂ : Y ⟶ Z} {S : X ⟶ Z} (fₗ : S.apex ⟶ S₁.apex) (fᵣ : S.apex ⟶ S₂.apex) (hₗ : CategoryTheory.CategoryStruct.comp fₗ S₁.l = S.l := by cat_disch) (hₘ : CategoryTheory.CategoryStruct.comp fₗ S₁.r = CategoryTheory.CategoryStruct.comp fᵣ S₂.l := by cat_disch) (hᵣ : CategoryTheory.CategoryStruct.comp fᵣ S₂.r = S.r := by cat_disch) : S ⟶ CategoryTheory.CategoryStruct.comp S₁ S₂ - CategoryTheory.Span.SpanBicat.whiskerLeft_hom_πᵣ_assoc 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S : X ⟶ Y) {S₁ S₂ : Y ⟶ Z} (f : S₁ ⟶ S₂) {Z✝ : C} (h : S₂.apex ⟶ Z✝) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.whiskerLeft S f).hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πᵣ S S₂) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πᵣ S S₁) (CategoryTheory.CategoryStruct.comp f.hom h) - CategoryTheory.Span.SpanBicat.whiskerRight_hom_πₗ_assoc 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} {S₁ S₂ : X ⟶ Y} (f : S₁ ⟶ S₂) (S : Y ⟶ Z) {Z✝ : C} (h : S₂.apex ⟶ Z✝) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.whiskerRight f S).hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πₗ S₂ S) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πₗ S₁ S) (CategoryTheory.CategoryStruct.comp f.hom h) - CategoryTheory.Span.SpanBicat.compLift_hom 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} {S₁ : X ⟶ Y} {S₂ : Y ⟶ Z} {S : X ⟶ Z} (fₗ : S.apex ⟶ S₁.apex) (fᵣ : S.apex ⟶ S₂.apex) (hₗ : CategoryTheory.CategoryStruct.comp fₗ S₁.l = S.l := by cat_disch) (hₘ : CategoryTheory.CategoryStruct.comp fₗ S₁.r = CategoryTheory.CategoryStruct.comp fᵣ S₂.l := by cat_disch) (hᵣ : CategoryTheory.CategoryStruct.comp fᵣ S₂.r = S.r := by cat_disch) : (CategoryTheory.Span.SpanBicat.compLift fₗ fᵣ hₗ hₘ hᵣ).hom = CategoryTheory.Span.SpanBicat.compLiftApex fₗ fᵣ ⋯ - CategoryTheory.Span.SpanBicat.compLift_hom_πᵣ 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} {S₁ : X ⟶ Y} {S₂ : Y ⟶ Z} (S : X ⟶ Z) (fₗ : S.apex ⟶ S₁.apex) (fᵣ : S.apex ⟶ S₂.apex) (hₗ : CategoryTheory.CategoryStruct.comp fₗ S₁.l = S.l := by cat_disch) (hₘ : CategoryTheory.CategoryStruct.comp fₗ S₁.r = CategoryTheory.CategoryStruct.comp fᵣ S₂.l := by cat_disch) (hᵣ : CategoryTheory.CategoryStruct.comp fᵣ S₂.r = S.r := by cat_disch) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.compLift fₗ fᵣ hₗ hₘ hᵣ).hom (CategoryTheory.Span.SpanBicat.πᵣ S₁ S₂) = fᵣ - CategoryTheory.Span.SpanBicat.compLift_hom_πₗ 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} {S₁ : X ⟶ Y} {S₂ : Y ⟶ Z} (S : X ⟶ Z) (fₗ : S.apex ⟶ S₁.apex) (fᵣ : S.apex ⟶ S₂.apex) (hₗ : CategoryTheory.CategoryStruct.comp fₗ S₁.l = S.l := by cat_disch) (hₘ : CategoryTheory.CategoryStruct.comp fₗ S₁.r = CategoryTheory.CategoryStruct.comp fᵣ S₂.l := by cat_disch) (hᵣ : CategoryTheory.CategoryStruct.comp fᵣ S₂.r = S.r := by cat_disch) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.compLift fₗ fᵣ hₗ hₘ hᵣ).hom (CategoryTheory.Span.SpanBicat.πₗ S₁ S₂) = fₗ - CategoryTheory.Span.SpanBicat.associator_hom_hom_πₗ 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {W X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S₁ : W ⟶ X) (S₂ : X ⟶ Y) (S₃ : Y ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.associator S₁ S₂ S₃).hom.hom (CategoryTheory.Span.SpanBicat.πₗ S₁ (CategoryTheory.CategoryStruct.comp S₂ S₃)) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πₗ (CategoryTheory.CategoryStruct.comp S₁ S₂) S₃) (CategoryTheory.Span.SpanBicat.πₗ S₁ S₂) - CategoryTheory.Span.SpanBicat.associator_inv_hom_πᵣ 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {W X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S₁ : W ⟶ X) (S₂ : X ⟶ Y) (S₃ : Y ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.associator S₁ S₂ S₃).inv.hom (CategoryTheory.Span.SpanBicat.πᵣ (CategoryTheory.CategoryStruct.comp S₁ S₂) S₃) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πᵣ S₁ (CategoryTheory.CategoryStruct.comp S₂ S₃)) (CategoryTheory.Span.SpanBicat.πᵣ S₂ S₃) - CategoryTheory.Span.SpanBicat.associator_hom_hom_πᵣ_πᵣ 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {W X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S₁ : W ⟶ X) (S₂ : X ⟶ Y) (S₃ : Y ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.associator S₁ S₂ S₃).hom.hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πᵣ S₁ (CategoryTheory.CategoryStruct.comp S₂ S₃)) (CategoryTheory.Span.SpanBicat.πᵣ S₂ S₃)) = CategoryTheory.Span.SpanBicat.πᵣ (CategoryTheory.CategoryStruct.comp S₁ S₂) S₃ - CategoryTheory.Span.SpanBicat.associator_inv_hom_πₗ_πₗ 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {W X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S₁ : W ⟶ X) (S₂ : X ⟶ Y) (S₃ : Y ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.associator S₁ S₂ S₃).inv.hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πₗ (CategoryTheory.CategoryStruct.comp S₁ S₂) S₃) (CategoryTheory.Span.SpanBicat.πₗ S₁ S₂)) = CategoryTheory.Span.SpanBicat.πₗ S₁ (CategoryTheory.CategoryStruct.comp S₂ S₃) - CategoryTheory.Span.SpanBicat.associator_hom_hom_πₗ_assoc 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {W X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S₁ : W ⟶ X) (S₂ : X ⟶ Y) (S₃ : Y ⟶ Z) {Z✝ : C} (h : S₁.apex ⟶ Z✝) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.associator S₁ S₂ S₃).hom.hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πₗ S₁ (CategoryTheory.CategoryStruct.comp S₂ S₃)) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πₗ (CategoryTheory.CategoryStruct.comp S₁ S₂) S₃) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πₗ S₁ S₂) h) - CategoryTheory.Span.SpanBicat.associator_inv_hom_πᵣ_assoc 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {W X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S₁ : W ⟶ X) (S₂ : X ⟶ Y) (S₃ : Y ⟶ Z) {Z✝ : C} (h : S₃.apex ⟶ Z✝) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.associator S₁ S₂ S₃).inv.hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πᵣ (CategoryTheory.CategoryStruct.comp S₁ S₂) S₃) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πᵣ S₁ (CategoryTheory.CategoryStruct.comp S₂ S₃)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πᵣ S₂ S₃) h) - CategoryTheory.Span.SpanBicat.associator_hom_hom_πᵣ_πₗ 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {W X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S₁ : W ⟶ X) (S₂ : X ⟶ Y) (S₃ : Y ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.associator S₁ S₂ S₃).hom.hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πᵣ S₁ (CategoryTheory.CategoryStruct.comp S₂ S₃)) (CategoryTheory.Span.SpanBicat.πₗ S₂ S₃)) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πₗ (CategoryTheory.CategoryStruct.comp S₁ S₂) S₃) (CategoryTheory.Span.SpanBicat.πᵣ S₁ S₂) - CategoryTheory.Span.SpanBicat.associator_inv_hom_πₗ_πᵣ 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {W X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S₁ : W ⟶ X) (S₂ : X ⟶ Y) (S₃ : Y ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.associator S₁ S₂ S₃).inv.hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πₗ (CategoryTheory.CategoryStruct.comp S₁ S₂) S₃) (CategoryTheory.Span.SpanBicat.πᵣ S₁ S₂)) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πᵣ S₁ (CategoryTheory.CategoryStruct.comp S₂ S₃)) (CategoryTheory.Span.SpanBicat.πₗ S₂ S₃) - CategoryTheory.Span.SpanBicat.associator_hom_hom_πᵣ_πᵣ_assoc 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {W X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S₁ : W ⟶ X) (S₂ : X ⟶ Y) (S₃ : Y ⟶ Z) {Z✝ : C} (h : S₃.apex ⟶ Z✝) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.associator S₁ S₂ S₃).hom.hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πᵣ S₁ (CategoryTheory.CategoryStruct.comp S₂ S₃)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πᵣ S₂ S₃) h)) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πᵣ (CategoryTheory.CategoryStruct.comp S₁ S₂) S₃) h - CategoryTheory.Span.SpanBicat.associator_inv_hom_πₗ_πₗ_assoc 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {W X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S₁ : W ⟶ X) (S₂ : X ⟶ Y) (S₃ : Y ⟶ Z) {Z✝ : C} (h : S₁.apex ⟶ Z✝) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.associator S₁ S₂ S₃).inv.hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πₗ (CategoryTheory.CategoryStruct.comp S₁ S₂) S₃) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πₗ S₁ S₂) h)) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πₗ S₁ (CategoryTheory.CategoryStruct.comp S₂ S₃)) h - CategoryTheory.Span.SpanBicat.associator_hom_hom_πᵣ_πₗ_assoc 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {W X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S₁ : W ⟶ X) (S₂ : X ⟶ Y) (S₃ : Y ⟶ Z) {Z✝ : C} (h : S₂.apex ⟶ Z✝) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.associator S₁ S₂ S₃).hom.hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πᵣ S₁ (CategoryTheory.CategoryStruct.comp S₂ S₃)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πₗ S₂ S₃) h)) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πₗ (CategoryTheory.CategoryStruct.comp S₁ S₂) S₃) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πᵣ S₁ S₂) h) - CategoryTheory.Span.SpanBicat.associator_inv_hom_πₗ_πᵣ_assoc 📋 Mathlib.CategoryTheory.Bicategory.Span.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wₗ Wᵣ : CategoryTheory.MorphismProperty C} [Wₗ.ContainsIdentities] [Wᵣ.ContainsIdentities] [Wₗ.HasPullbacksAgainst Wᵣ] [Wₗ.IsStableUnderBaseChangeAgainst Wᵣ] [Wᵣ.IsStableUnderBaseChangeAgainst Wₗ] [Wₗ.IsStableUnderComposition] [Wᵣ.IsStableUnderComposition] {W X Y Z : CategoryTheory.Span.SpanBicat C Wₗ Wᵣ} (S₁ : W ⟶ X) (S₂ : X ⟶ Y) (S₃ : Y ⟶ Z) {Z✝ : C} (h : S₂.apex ⟶ Z✝) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.associator S₁ S₂ S₃).inv.hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πₗ (CategoryTheory.CategoryStruct.comp S₁ S₂) S₃) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πᵣ S₁ S₂) h)) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πᵣ S₁ (CategoryTheory.CategoryStruct.comp S₂ S₃)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Span.SpanBicat.πₗ S₂ S₃) h) - CategoryTheory.Localization.StrictUniversalPropertyFixedTarget.prodLift₁ 📋 Mathlib.CategoryTheory.Localization.Prod
{C₁ : Type u₁} {C₂ : Type u₂} [CategoryTheory.Category.{v₁, u₁} C₁] [CategoryTheory.Category.{v₂, u₂} C₂] {W₁ : CategoryTheory.MorphismProperty C₁} {W₂ : CategoryTheory.MorphismProperty C₂} {E : Type u₅} [CategoryTheory.Category.{v₅, u₅} E] (F : CategoryTheory.Functor (C₁ × C₂) E) [W₂.ContainsIdentities] (hF : (W₁.prod W₂).IsInvertedBy F) : CategoryTheory.Functor W₁.Localization (CategoryTheory.Functor C₂ E) - CategoryTheory.Localization.StrictUniversalPropertyFixedTarget.prodLift 📋 Mathlib.CategoryTheory.Localization.Prod
{C₁ : Type u₁} {C₂ : Type u₂} [CategoryTheory.Category.{v₁, u₁} C₁] [CategoryTheory.Category.{v₂, u₂} C₂] {W₁ : CategoryTheory.MorphismProperty C₁} {W₂ : CategoryTheory.MorphismProperty C₂} {E : Type u₅} [CategoryTheory.Category.{v₅, u₅} E] (F : CategoryTheory.Functor (C₁ × C₂) E) (hF : (W₁.prod W₂).IsInvertedBy F) [W₁.ContainsIdentities] [W₂.ContainsIdentities] : CategoryTheory.Functor (W₁.Localization × W₂.Localization) E - CategoryTheory.Functor.IsLocalization.prod 📋 Mathlib.CategoryTheory.Localization.Prod
{C₁ : Type u₁} {C₂ : Type u₂} {D₁ : Type u₃} {D₂ : Type u₄} [CategoryTheory.Category.{v₁, u₁} C₁] [CategoryTheory.Category.{v₂, u₂} C₂] [CategoryTheory.Category.{v₃, u₃} D₁] [CategoryTheory.Category.{v₄, u₄} D₂] (L₁ : CategoryTheory.Functor C₁ D₁) (W₁ : CategoryTheory.MorphismProperty C₁) (L₂ : CategoryTheory.Functor C₂ D₂) (W₂ : CategoryTheory.MorphismProperty C₂) [W₁.ContainsIdentities] [W₂.ContainsIdentities] [L₁.IsLocalization W₁] [L₂.IsLocalization W₂] : (L₁.prod L₂).IsLocalization (W₁.prod W₂) - CategoryTheory.Localization.Construction.prodIsLocalization 📋 Mathlib.CategoryTheory.Localization.Prod
{C₁ : Type u₁} {C₂ : Type u₂} [CategoryTheory.Category.{v₁, u₁} C₁] [CategoryTheory.Category.{v₂, u₂} C₂] (W₁ : CategoryTheory.MorphismProperty C₁) (W₂ : CategoryTheory.MorphismProperty C₂) [W₁.ContainsIdentities] [W₂.ContainsIdentities] : (W₁.Q.prod W₂.Q).IsLocalization (W₁.prod W₂) - CategoryTheory.Localization.StrictUniversalPropertyFixedTarget.prod 📋 Mathlib.CategoryTheory.Localization.Prod
{C₁ : Type u₁} {C₂ : Type u₂} [CategoryTheory.Category.{v₁, u₁} C₁] [CategoryTheory.Category.{v₂, u₂} C₂] (W₁ : CategoryTheory.MorphismProperty C₁) (W₂ : CategoryTheory.MorphismProperty C₂) {E : Type u₅} [CategoryTheory.Category.{v₅, u₅} E] [W₁.ContainsIdentities] [W₂.ContainsIdentities] : CategoryTheory.Localization.StrictUniversalPropertyFixedTarget (W₁.Q.prod W₂.Q) (W₁.prod W₂) E - CategoryTheory.Localization.StrictUniversalPropertyFixedTarget.prod_fac 📋 Mathlib.CategoryTheory.Localization.Prod
{C₁ : Type u₁} {C₂ : Type u₂} [CategoryTheory.Category.{v₁, u₁} C₁] [CategoryTheory.Category.{v₂, u₂} C₂] {W₁ : CategoryTheory.MorphismProperty C₁} {W₂ : CategoryTheory.MorphismProperty C₂} {E : Type u₅} [CategoryTheory.Category.{v₅, u₅} E] (F : CategoryTheory.Functor (C₁ × C₂) E) (hF : (W₁.prod W₂).IsInvertedBy F) [W₁.ContainsIdentities] [W₂.ContainsIdentities] : (W₁.Q.prod W₂.Q).comp (CategoryTheory.Localization.StrictUniversalPropertyFixedTarget.prodLift F hF) = F - CategoryTheory.Localization.StrictUniversalPropertyFixedTarget.prod_fac₁ 📋 Mathlib.CategoryTheory.Localization.Prod
{C₁ : Type u₁} {C₂ : Type u₂} [CategoryTheory.Category.{v₁, u₁} C₁] [CategoryTheory.Category.{v₂, u₂} C₂] {W₁ : CategoryTheory.MorphismProperty C₁} {W₂ : CategoryTheory.MorphismProperty C₂} {E : Type u₅} [CategoryTheory.Category.{v₅, u₅} E] (F : CategoryTheory.Functor (C₁ × C₂) E) (hF : (W₁.prod W₂).IsInvertedBy F) [W₂.ContainsIdentities] : W₁.Q.comp (CategoryTheory.Localization.StrictUniversalPropertyFixedTarget.prodLift₁ F hF) = CategoryTheory.Functor.curry.obj F - CategoryTheory.Localization.StrictUniversalPropertyFixedTarget.prod_fac₂ 📋 Mathlib.CategoryTheory.Localization.Prod
{C₁ : Type u₁} {C₂ : Type u₂} [CategoryTheory.Category.{v₁, u₁} C₁] [CategoryTheory.Category.{v₂, u₂} C₂] {W₁ : CategoryTheory.MorphismProperty C₁} {W₂ : CategoryTheory.MorphismProperty C₂} {E : Type u₅} [CategoryTheory.Category.{v₅, u₅} E] (F : CategoryTheory.Functor (C₁ × C₂) E) (hF : (W₁.prod W₂).IsInvertedBy F) [W₁.ContainsIdentities] [W₂.ContainsIdentities] : W₂.Q.comp (CategoryTheory.Functor.curry.obj (CategoryTheory.Localization.StrictUniversalPropertyFixedTarget.prodLift F hF)).flip = (CategoryTheory.Localization.StrictUniversalPropertyFixedTarget.prodLift₁ F hF).flip - CategoryTheory.Localization.lift₂ 📋 Mathlib.CategoryTheory.Localization.Bifunctor
{C₁ : Type u_1} {C₂ : Type u_2} {D₁ : Type u_3} {D₂ : Type u_4} {E : Type u_5} [CategoryTheory.Category.{v_1, u_1} C₁] [CategoryTheory.Category.{v_2, u_2} C₂] [CategoryTheory.Category.{v_3, u_3} D₁] [CategoryTheory.Category.{v_4, u_4} D₂] [CategoryTheory.Category.{v_5, u_5} E] (F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ E)) {W₁ : CategoryTheory.MorphismProperty C₁} {W₂ : CategoryTheory.MorphismProperty C₂} (hF : W₁.IsInvertedBy₂ W₂ F) (L₁ : CategoryTheory.Functor C₁ D₁) (L₂ : CategoryTheory.Functor C₂ D₂) [L₁.IsLocalization W₁] [L₂.IsLocalization W₂] [W₁.ContainsIdentities] [W₂.ContainsIdentities] : CategoryTheory.Functor D₁ (CategoryTheory.Functor D₂ E) - CategoryTheory.Localization.instLifting₂Lift₂ 📋 Mathlib.CategoryTheory.Localization.Bifunctor
{C₁ : Type u_1} {C₂ : Type u_2} {D₁ : Type u_3} {D₂ : Type u_4} {E : Type u_5} [CategoryTheory.Category.{v_1, u_1} C₁] [CategoryTheory.Category.{v_2, u_2} C₂] [CategoryTheory.Category.{v_3, u_3} D₁] [CategoryTheory.Category.{v_4, u_4} D₂] [CategoryTheory.Category.{v_5, u_5} E] (F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ E)) {W₁ : CategoryTheory.MorphismProperty C₁} {W₂ : CategoryTheory.MorphismProperty C₂} (hF : W₁.IsInvertedBy₂ W₂ F) (L₁ : CategoryTheory.Functor C₁ D₁) (L₂ : CategoryTheory.Functor C₂ D₂) [L₁.IsLocalization W₁] [L₂.IsLocalization W₂] [W₁.ContainsIdentities] [W₂.ContainsIdentities] : CategoryTheory.Localization.Lifting₂ L₁ L₂ W₁ W₂ F (CategoryTheory.Localization.lift₂ F hF L₁ L₂)
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
🔍_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
🔍Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
🔍(?a -> ?b) -> List ?a -> List ?b
🔍List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
🔍|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of all→and∀) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
🔍|- _ < _ → tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
⊢ (_ : Type _)finds all definitions which provide data while⊢ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision 69fae59