Loogle!
Result
Found 197 declarations mentioning CategoryTheory.Limits.PullbackCone.
- CategoryTheory.Limits.PullbackCone 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) : Type (max u v) - CategoryTheory.Limits.PullbackCone.flip 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} (t : CategoryTheory.Limits.PullbackCone f g) : CategoryTheory.Limits.PullbackCone g f - CategoryTheory.Limits.PullbackCone.fst 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} (t : CategoryTheory.Limits.PullbackCone f g) : t.pt ⟶ X - CategoryTheory.Limits.PullbackCone.snd 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} (t : CategoryTheory.Limits.PullbackCone f g) : t.pt ⟶ Y - CategoryTheory.CommSq.cone 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {W X Y Z : C} {f : W ⟶ X} {g : W ⟶ Y} {h : X ⟶ Z} {i : Y ⟶ Z} (s : CategoryTheory.CommSq f g h i) : CategoryTheory.Limits.PullbackCone h i - CategoryTheory.Limits.Cone.ofPullbackCone 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor CategoryTheory.Limits.WalkingCospan C} (t : CategoryTheory.Limits.PullbackCone (F.map CategoryTheory.Limits.WalkingCospan.Hom.inl) (F.map CategoryTheory.Limits.WalkingCospan.Hom.inr)) : CategoryTheory.Limits.Cone F - CategoryTheory.Limits.PullbackCone.ofCone 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor CategoryTheory.Limits.WalkingCospan C} (t : CategoryTheory.Limits.Cone F) : CategoryTheory.Limits.PullbackCone (F.map CategoryTheory.Limits.WalkingCospan.Hom.inl) (F.map CategoryTheory.Limits.WalkingCospan.Hom.inr) - CategoryTheory.Limits.PullbackCone.flipIsLimit 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} {t : CategoryTheory.Limits.PullbackCone f g} (ht : CategoryTheory.Limits.IsLimit t) : CategoryTheory.Limits.IsLimit t.flip - CategoryTheory.Limits.PullbackCone.isLimitOfFlip 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} {t : CategoryTheory.Limits.PullbackCone f g} (ht : CategoryTheory.Limits.IsLimit t.flip) : CategoryTheory.Limits.IsLimit t - CategoryTheory.Limits.PullbackCone.flip_pt 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} (t : CategoryTheory.Limits.PullbackCone f g) : t.flip.pt = t.pt - CategoryTheory.Limits.PullbackCone.flipFlipIso 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} (t : CategoryTheory.Limits.PullbackCone f g) : t.flip.flip ≅ t - CategoryTheory.Limits.PullbackCone.mk 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} {W : C} (fst : W ⟶ X) (snd : W ⟶ Y) (eq : CategoryTheory.CategoryStruct.comp fst f = CategoryTheory.CategoryStruct.comp snd g := by cat_disch) : CategoryTheory.Limits.PullbackCone f g - CategoryTheory.Limits.PullbackCone.flip_fst 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} (t : CategoryTheory.Limits.PullbackCone f g) : t.flip.fst = t.snd - CategoryTheory.Limits.PullbackCone.flip_snd 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} (t : CategoryTheory.Limits.PullbackCone f g) : t.flip.snd = t.fst - CategoryTheory.Limits.PullbackCone.eta 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} (t : CategoryTheory.Limits.PullbackCone f g) : t ≅ CategoryTheory.Limits.PullbackCone.mk t.fst t.snd ⋯ - CategoryTheory.Limits.PullbackCone.mkSelfIsLimit 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} {t : CategoryTheory.Limits.PullbackCone f g} (ht : CategoryTheory.Limits.IsLimit t) : CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.PullbackCone.mk t.fst t.snd ⋯) - CategoryTheory.Limits.PullbackCone.IsLimit.lift 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} {t : CategoryTheory.Limits.PullbackCone f g} (ht : CategoryTheory.Limits.IsLimit t) {W : C} (h : W ⟶ X) (k : W ⟶ Y) (w : CategoryTheory.CategoryStruct.comp h f = CategoryTheory.CategoryStruct.comp k g) : W ⟶ t.pt - CategoryTheory.Limits.PullbackCone.condition 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} (t : CategoryTheory.Limits.PullbackCone f g) : CategoryTheory.CategoryStruct.comp t.fst f = CategoryTheory.CategoryStruct.comp t.snd g - CategoryTheory.Limits.Cone.ofPullbackCone_pt 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor CategoryTheory.Limits.WalkingCospan C} (t : CategoryTheory.Limits.PullbackCone (F.map CategoryTheory.Limits.WalkingCospan.Hom.inl) (F.map CategoryTheory.Limits.WalkingCospan.Hom.inr)) : (CategoryTheory.Limits.Cone.ofPullbackCone t).pt = t.pt - CategoryTheory.Limits.PullbackCone.condition_assoc 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} (t : CategoryTheory.Limits.PullbackCone f g) {Z✝ : C} (h : Z ⟶ Z✝) : CategoryTheory.CategoryStruct.comp t.fst (CategoryTheory.CategoryStruct.comp f h) = CategoryTheory.CategoryStruct.comp t.snd (CategoryTheory.CategoryStruct.comp g h) - CategoryTheory.Limits.PullbackCone.IsLimit.lift_fst 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} {t : CategoryTheory.Limits.PullbackCone f g} (ht : CategoryTheory.Limits.IsLimit t) {W : C} (h : W ⟶ X) (k : W ⟶ Y) (w : CategoryTheory.CategoryStruct.comp h f = CategoryTheory.CategoryStruct.comp k g) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.PullbackCone.IsLimit.lift ht h k w) t.fst = h - CategoryTheory.Limits.PullbackCone.IsLimit.lift_snd 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} {t : CategoryTheory.Limits.PullbackCone f g} (ht : CategoryTheory.Limits.IsLimit t) {W : C} (h : W ⟶ X) (k : W ⟶ Y) (w : CategoryTheory.CategoryStruct.comp h f = CategoryTheory.CategoryStruct.comp k g) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.PullbackCone.IsLimit.lift ht h k w) t.snd = k - CategoryTheory.Limits.PullbackCone.π_app_left 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} (c : CategoryTheory.Limits.PullbackCone f g) : c.π.app CategoryTheory.Limits.WalkingCospan.left = c.fst - CategoryTheory.Limits.PullbackCone.π_app_right 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} (c : CategoryTheory.Limits.PullbackCone f g) : c.π.app CategoryTheory.Limits.WalkingCospan.right = c.snd - CategoryTheory.Limits.PullbackCone.IsLimit.lift_fst_assoc 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} {t : CategoryTheory.Limits.PullbackCone f g} (ht : CategoryTheory.Limits.IsLimit t) {W : C} (h : W ⟶ X) (k : W ⟶ Y) (w : CategoryTheory.CategoryStruct.comp h f = CategoryTheory.CategoryStruct.comp k g) {Z✝ : C} (h✝ : X ⟶ Z✝) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.PullbackCone.IsLimit.lift ht h k w) (CategoryTheory.CategoryStruct.comp t.fst h✝) = CategoryTheory.CategoryStruct.comp h h✝ - CategoryTheory.Limits.PullbackCone.IsLimit.lift_snd_assoc 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} {t : CategoryTheory.Limits.PullbackCone f g} (ht : CategoryTheory.Limits.IsLimit t) {W : C} (h : W ⟶ X) (k : W ⟶ Y) (w : CategoryTheory.CategoryStruct.comp h f = CategoryTheory.CategoryStruct.comp k g) {Z✝ : C} (h✝ : Y ⟶ Z✝) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.PullbackCone.IsLimit.lift ht h k w) (CategoryTheory.CategoryStruct.comp t.snd h✝) = CategoryTheory.CategoryStruct.comp k h✝ - CategoryTheory.Limits.PullbackCone.condition_one 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} (t : CategoryTheory.Limits.PullbackCone f g) : t.π.app CategoryTheory.Limits.WalkingCospan.one = CategoryTheory.CategoryStruct.comp t.fst f - CategoryTheory.Limits.PullbackCone.IsLimit.lift' 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} {t : CategoryTheory.Limits.PullbackCone f g} (ht : CategoryTheory.Limits.IsLimit t) {W : C} (h : W ⟶ X) (k : W ⟶ Y) (w : CategoryTheory.CategoryStruct.comp h f = CategoryTheory.CategoryStruct.comp k g) : { l // CategoryTheory.CategoryStruct.comp l t.fst = h ∧ CategoryTheory.CategoryStruct.comp l t.snd = k } - CategoryTheory.Limits.PullbackCone.IsLimit.hom_ext 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} {t : CategoryTheory.Limits.PullbackCone f g} (ht : CategoryTheory.Limits.IsLimit t) {W : C} {k l : W ⟶ t.pt} (h₀ : CategoryTheory.CategoryStruct.comp k t.fst = CategoryTheory.CategoryStruct.comp l t.fst) (h₁ : CategoryTheory.CategoryStruct.comp k t.snd = CategoryTheory.CategoryStruct.comp l t.snd) : k = l - CategoryTheory.Limits.PullbackCone.eta_hom_hom 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} (t : CategoryTheory.Limits.PullbackCone f g) : t.eta.hom.hom = CategoryTheory.CategoryStruct.id t.pt - CategoryTheory.Limits.PullbackCone.eta_inv_hom 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} (t : CategoryTheory.Limits.PullbackCone f g) : t.eta.inv.hom = CategoryTheory.CategoryStruct.id t.pt - CategoryTheory.Limits.PullbackCone.ext 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} {s t : CategoryTheory.Limits.PullbackCone f g} (i : s.pt ≅ t.pt) (w₁ : s.fst = CategoryTheory.CategoryStruct.comp i.hom t.fst := by cat_disch) (w₂ : s.snd = CategoryTheory.CategoryStruct.comp i.hom t.snd := by cat_disch) : s ≅ t - CategoryTheory.Limits.Cone.ofPullbackCone_π 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor CategoryTheory.Limits.WalkingCospan C} (t : CategoryTheory.Limits.PullbackCone (F.map CategoryTheory.Limits.WalkingCospan.Hom.inl) (F.map CategoryTheory.Limits.WalkingCospan.Hom.inr)) : (CategoryTheory.Limits.Cone.ofPullbackCone t).π = CategoryTheory.CategoryStruct.comp t.π (CategoryTheory.Limits.diagramIsoCospan F).inv - CategoryTheory.Limits.PullbackCone.IsLimit.mk 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} {W : C} {fst : W ⟶ X} {snd : W ⟶ Y} (eq : CategoryTheory.CategoryStruct.comp fst f = CategoryTheory.CategoryStruct.comp snd g) (lift : (s : CategoryTheory.Limits.PullbackCone f g) → s.pt ⟶ W) (fac_left : ∀ (s : CategoryTheory.Limits.PullbackCone f g), CategoryTheory.CategoryStruct.comp (lift s) fst = s.fst) (fac_right : ∀ (s : CategoryTheory.Limits.PullbackCone f g), CategoryTheory.CategoryStruct.comp (lift s) snd = s.snd) (uniq : ∀ (s : CategoryTheory.Limits.PullbackCone f g) (m : s.pt ⟶ W), CategoryTheory.CategoryStruct.comp m fst = s.fst → CategoryTheory.CategoryStruct.comp m snd = s.snd → m = lift s) : CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.PullbackCone.mk fst snd eq) - CategoryTheory.Limits.PullbackCone.equalizer_ext 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} (t : CategoryTheory.Limits.PullbackCone f g) {W : C} {k l : W ⟶ t.pt} (h₀ : CategoryTheory.CategoryStruct.comp k t.fst = CategoryTheory.CategoryStruct.comp l t.fst) (h₁ : CategoryTheory.CategoryStruct.comp k t.snd = CategoryTheory.CategoryStruct.comp l t.snd) (j : CategoryTheory.Limits.WalkingCospan) : CategoryTheory.CategoryStruct.comp k (t.π.app j) = CategoryTheory.CategoryStruct.comp l (t.π.app j) - CategoryTheory.Limits.PullbackCone.isLimitAux' 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} (t : CategoryTheory.Limits.PullbackCone f g) (create : (s : CategoryTheory.Limits.PullbackCone f g) → { l // CategoryTheory.CategoryStruct.comp l t.fst = s.fst ∧ CategoryTheory.CategoryStruct.comp l t.snd = s.snd ∧ ∀ {m : s.pt ⟶ t.pt}, CategoryTheory.CategoryStruct.comp m t.fst = s.fst → CategoryTheory.CategoryStruct.comp m t.snd = s.snd → m = l }) : CategoryTheory.Limits.IsLimit t - CategoryTheory.Limits.PullbackCone.isLimitAux 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackCone
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} (t : CategoryTheory.Limits.PullbackCone f g) (lift : (s : CategoryTheory.Limits.PullbackCone f g) → s.pt ⟶ t.pt) (fac_left : ∀ (s : CategoryTheory.Limits.PullbackCone f g), CategoryTheory.CategoryStruct.comp (lift s) t.fst = s.fst) (fac_right : ∀ (s : CategoryTheory.Limits.PullbackCone f g), CategoryTheory.CategoryStruct.comp (lift s) t.snd = s.snd) (uniq : ∀ (s : CategoryTheory.Limits.PullbackCone f g) (m : s.pt ⟶ t.pt), (∀ (j : CategoryTheory.Limits.WalkingCospan), CategoryTheory.CategoryStruct.comp m (t.π.app j) = s.π.app j) → m = lift s) : CategoryTheory.Limits.IsLimit t - CategoryTheory.Limits.pullback.cone 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.HasPullback
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) [CategoryTheory.Limits.HasPullback f g] : CategoryTheory.Limits.PullbackCone f g - CategoryTheory.Limits.precompFork 📋 Mathlib.CategoryTheory.Limits.Shapes.Equalizers
{C : Type u} {X Y : C} [CategoryTheory.Category.{v, u} C] {f g : X ⟶ Y} {Z : C} (h : Z ⟶ X) (s : CategoryTheory.Limits.Fork f g) (c : CategoryTheory.Limits.PullbackCone s.ι h) : CategoryTheory.Limits.Fork (CategoryTheory.CategoryStruct.comp h f) (CategoryTheory.CategoryStruct.comp h g) - CategoryTheory.Limits.hasEqualizer_precomp_of_equalizer 📋 Mathlib.CategoryTheory.Limits.Shapes.Equalizers
{C : Type u} {X Y : C} [CategoryTheory.Category.{v, u} C] {f g : X ⟶ Y} {Z : C} (h : Z ⟶ X) {s : CategoryTheory.Limits.Fork f g} (hs : CategoryTheory.Limits.IsLimit s) {c : CategoryTheory.Limits.PullbackCone s.ι h} (hc : CategoryTheory.Limits.IsLimit c) : CategoryTheory.Limits.HasEqualizer (CategoryTheory.CategoryStruct.comp h f) (CategoryTheory.CategoryStruct.comp h g) - CategoryTheory.Limits.isLimitPrecompFork 📋 Mathlib.CategoryTheory.Limits.Shapes.Equalizers
{C : Type u} {X Y : C} [CategoryTheory.Category.{v, u} C] {f g : X ⟶ Y} {Z : C} (h : Z ⟶ X) {s : CategoryTheory.Limits.Fork f g} (hs : CategoryTheory.Limits.IsLimit s) {c : CategoryTheory.Limits.PullbackCone s.ι h} (hc : CategoryTheory.Limits.IsLimit c) : CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.precompFork h s c) - CategoryTheory.Limits.liftPrecomp 📋 Mathlib.CategoryTheory.Limits.Shapes.Equalizers
{C : Type u} {X Y : C} [CategoryTheory.Category.{v, u} C] {f g : X ⟶ Y} {Z : C} (h : Z ⟶ X) {s : CategoryTheory.Limits.Fork f g} (hs : CategoryTheory.Limits.IsLimit s) {c : CategoryTheory.Limits.PullbackCone s.ι h} (hc : CategoryTheory.Limits.IsLimit c) (s' : CategoryTheory.Limits.Fork (CategoryTheory.CategoryStruct.comp h f) (CategoryTheory.CategoryStruct.comp h g)) : s'.pt ⟶ (CategoryTheory.Limits.precompFork h s c).pt - CategoryTheory.Limits.pullbackConeOfLeftIso 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.Iso
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) [CategoryTheory.IsIso f] : CategoryTheory.Limits.PullbackCone f g - CategoryTheory.Limits.pullbackConeOfRightIso 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.Iso
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) [CategoryTheory.IsIso g] : CategoryTheory.Limits.PullbackCone f g - CategoryTheory.Limits.PullbackCone.fst_eq_snd_of_mono_eq 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.Mono
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y : C} {f : X ⟶ Y} [CategoryTheory.Mono f] (t : CategoryTheory.Limits.PullbackCone f f) : t.fst = t.snd - CategoryTheory.Limits.PullbackCone.isIso_fst_of_mono_of_isLimit 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.Mono
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y : C} {f : X ⟶ Y} [CategoryTheory.Mono f] {t : CategoryTheory.Limits.PullbackCone f f} (ht : CategoryTheory.Limits.IsLimit t) : CategoryTheory.IsIso t.fst - CategoryTheory.Limits.PullbackCone.isIso_snd_of_mono_of_isLimit 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.Mono
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y : C} {f : X ⟶ Y} [CategoryTheory.Mono f] {t : CategoryTheory.Limits.PullbackCone f f} (ht : CategoryTheory.Limits.IsLimit t) : CategoryTheory.IsIso t.snd - CategoryTheory.Limits.PullbackCone.mono_fst_of_is_pullback_of_mono 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.Mono
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} {t : CategoryTheory.Limits.PullbackCone f g} (ht : CategoryTheory.Limits.IsLimit t) [CategoryTheory.Mono g] : CategoryTheory.Mono t.fst - CategoryTheory.Limits.PullbackCone.mono_snd_of_is_pullback_of_mono 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.Mono
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} {t : CategoryTheory.Limits.PullbackCone f g} (ht : CategoryTheory.Limits.IsLimit t) [CategoryTheory.Mono f] : CategoryTheory.Mono t.snd - CategoryTheory.Limits.PullbackCone.isLimitOfCompMono 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.Mono
{C : Type u} [CategoryTheory.Category.{v, u} C] {W X Y Z : C} (f : X ⟶ W) (g : Y ⟶ W) (i : W ⟶ Z) [CategoryTheory.Mono i] (s : CategoryTheory.Limits.PullbackCone f g) (H : CategoryTheory.Limits.IsLimit s) : CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.PullbackCone.mk s.fst s.snd ⋯) - CategoryTheory.Limits.PullbackCone.isLimitOfFactors 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.Mono
{C : Type u} [CategoryTheory.Category.{v, u} C] {W X Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) (h : W ⟶ Z) [CategoryTheory.Mono h] (x : X ⟶ W) (y : Y ⟶ W) (hxh : CategoryTheory.CategoryStruct.comp x h = f) (hyh : CategoryTheory.CategoryStruct.comp y h = g) (s : CategoryTheory.Limits.PullbackCone f g) (hs : CategoryTheory.Limits.IsLimit s) : CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.PullbackCone.mk s.fst s.snd ⋯) - CategoryTheory.Limits.PullbackCone.op 📋 Mathlib.CategoryTheory.Limits.Shapes.Opposites.Pullbacks
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} (c : CategoryTheory.Limits.PullbackCone f g) : CategoryTheory.Limits.PushoutCocone f.op g.op - CategoryTheory.Limits.PushoutCocone.op 📋 Mathlib.CategoryTheory.Limits.Shapes.Opposites.Pullbacks
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y Z : C} {f : X ⟶ Y} {g : X ⟶ Z} (c : CategoryTheory.Limits.PushoutCocone f g) : CategoryTheory.Limits.PullbackCone f.op g.op - CategoryTheory.Limits.PullbackCone.unop 📋 Mathlib.CategoryTheory.Limits.Shapes.Opposites.Pullbacks
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y Z : Cᵒᵖ} {f : X ⟶ Z} {g : Y ⟶ Z} (c : CategoryTheory.Limits.PullbackCone f g) : CategoryTheory.Limits.PushoutCocone f.unop g.unop - CategoryTheory.Limits.PushoutCocone.unop 📋 Mathlib.CategoryTheory.Limits.Shapes.Opposites.Pullbacks
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y Z : Cᵒᵖ} {f : X ⟶ Y} {g : X ⟶ Z} (c : CategoryTheory.Limits.PushoutCocone f g) : CategoryTheory.Limits.PullbackCone f.unop g.unop - CategoryTheory.Limits.PullbackCone.isLimitEquivIsColimitOp 📋 Mathlib.CategoryTheory.Limits.Shapes.Opposites.Pullbacks
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} (c : CategoryTheory.Limits.PullbackCone f g) : CategoryTheory.Limits.IsLimit c ≃ CategoryTheory.Limits.IsColimit c.op - CategoryTheory.Limits.PullbackCone.op_pt 📋 Mathlib.CategoryTheory.Limits.Shapes.Opposites.Pullbacks
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} (c : CategoryTheory.Limits.PullbackCone f g) : c.op.pt = Opposite.op c.pt - CategoryTheory.Limits.PullbackCone.isLimitEquivIsColimitUnop 📋 Mathlib.CategoryTheory.Limits.Shapes.Opposites.Pullbacks
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y Z : Cᵒᵖ} {f : X ⟶ Z} {g : Y ⟶ Z} (c : CategoryTheory.Limits.PullbackCone f g) : CategoryTheory.Limits.IsLimit c ≃ CategoryTheory.Limits.IsColimit c.unop - CategoryTheory.Limits.PullbackCone.unop_pt 📋 Mathlib.CategoryTheory.Limits.Shapes.Opposites.Pullbacks
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y Z : Cᵒᵖ} {f : X ⟶ Z} {g : Y ⟶ Z} (c : CategoryTheory.Limits.PullbackCone f g) : c.unop.pt = Opposite.unop c.pt - CategoryTheory.Limits.PullbackCone.op_inl 📋 Mathlib.CategoryTheory.Limits.Shapes.Opposites.Pullbacks
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} (c : CategoryTheory.Limits.PullbackCone f g) : c.op.inl = c.fst.op - CategoryTheory.Limits.PullbackCone.op_inr 📋 Mathlib.CategoryTheory.Limits.Shapes.Opposites.Pullbacks
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} (c : CategoryTheory.Limits.PullbackCone f g) : c.op.inr = c.snd.op - CategoryTheory.Limits.PullbackCone.unop_inl 📋 Mathlib.CategoryTheory.Limits.Shapes.Opposites.Pullbacks
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y Z : Cᵒᵖ} {f : X ⟶ Z} {g : Y ⟶ Z} (c : CategoryTheory.Limits.PullbackCone f g) : c.unop.inl = c.fst.unop - CategoryTheory.Limits.PullbackCone.unop_inr 📋 Mathlib.CategoryTheory.Limits.Shapes.Opposites.Pullbacks
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y Z : Cᵒᵖ} {f : X ⟶ Z} {g : Y ⟶ Z} (c : CategoryTheory.Limits.PullbackCone f g) : c.unop.inr = c.snd.unop - CategoryTheory.Limits.PullbackCone.opUnopIso 📋 Mathlib.CategoryTheory.Limits.Shapes.Opposites.Pullbacks
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} (c : CategoryTheory.Limits.PullbackCone f g) : c.op.unop ≅ c - CategoryTheory.Limits.PullbackCone.unopOpIso 📋 Mathlib.CategoryTheory.Limits.Shapes.Opposites.Pullbacks
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y Z : Cᵒᵖ} {f : X ⟶ Z} {g : Y ⟶ Z} (c : CategoryTheory.Limits.PullbackCone f g) : c.unop.op ≅ c - CategoryTheory.CommSq.coconeOp 📋 Mathlib.CategoryTheory.Limits.Shapes.Opposites.Pullbacks
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {W X Y Z : C} {f : W ⟶ X} {g : W ⟶ Y} {h : X ⟶ Z} {i : Y ⟶ Z} (p : CategoryTheory.CommSq f g h i) : p.cocone.op ≅ ⋯.cone - CategoryTheory.CommSq.coconeUnop 📋 Mathlib.CategoryTheory.Limits.Shapes.Opposites.Pullbacks
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {W X Y Z : Cᵒᵖ} {f : W ⟶ X} {g : W ⟶ Y} {h : X ⟶ Z} {i : Y ⟶ Z} (p : CategoryTheory.CommSq f g h i) : p.cocone.unop ≅ ⋯.cone - CategoryTheory.Limits.PullbackCone.op_ι_app 📋 Mathlib.CategoryTheory.Limits.Shapes.Opposites.Pullbacks
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} (c : CategoryTheory.Limits.PullbackCone f g) (X✝ : CategoryTheory.Limits.WalkingSpan) : c.op.ι.app X✝ = CategoryTheory.CategoryStruct.comp (match X✝ with | none => CategoryTheory.Iso.refl (Opposite.op Z) | some CategoryTheory.Limits.WalkingPair.left => CategoryTheory.Iso.refl (Opposite.op X) | some CategoryTheory.Limits.WalkingPair.right => CategoryTheory.Iso.refl (Opposite.op Y)).hom (c.π.app X✝).op - CategoryTheory.Limits.PullbackCone.unop_ι_app 📋 Mathlib.CategoryTheory.Limits.Shapes.Opposites.Pullbacks
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y Z : Cᵒᵖ} {f : X ⟶ Z} {g : Y ⟶ Z} (c : CategoryTheory.Limits.PullbackCone f g) (X✝ : CategoryTheory.Limits.WalkingSpan) : c.unop.ι.app X✝ = CategoryTheory.CategoryStruct.comp (match X✝ with | none => CategoryTheory.Iso.refl Z | some CategoryTheory.Limits.WalkingPair.left => CategoryTheory.Iso.refl X | some CategoryTheory.Limits.WalkingPair.right => CategoryTheory.Iso.refl Y).hom.unop (c.π.app X✝).unop - CategoryTheory.Limits.PullbackCone.map 📋 Mathlib.CategoryTheory.Limits.Preserves.Shapes.Pullbacks
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} (c : CategoryTheory.Limits.PullbackCone f g) (G : CategoryTheory.Functor C D) : CategoryTheory.Limits.PullbackCone (G.map f) (G.map g) - CategoryTheory.Limits.PullbackCone.isLimitMapConeEquiv 📋 Mathlib.CategoryTheory.Limits.Preserves.Shapes.Pullbacks
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} (c : CategoryTheory.Limits.PullbackCone f g) (G : CategoryTheory.Functor C D) : CategoryTheory.Limits.IsLimit (G.mapCone c) ≃ CategoryTheory.Limits.IsLimit (c.map G) - CategoryTheory.Limits.PullbackCone.isLimitCoyonedaEquiv 📋 Mathlib.CategoryTheory.Limits.Preserves.Shapes.Pullbacks
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) (c : CategoryTheory.Limits.PullbackCone f g) : CategoryTheory.Limits.IsLimit c ≃ ((X_1 : Cᵒᵖ) → CategoryTheory.Limits.IsLimit (c.map (CategoryTheory.coyoneda.obj X_1))) - CategoryTheory.IsPullback.cone 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.IsPullback.Defs
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {P X Y Z : C} {fst : P ⟶ X} {snd : P ⟶ Y} {f : X ⟶ Z} {g : Y ⟶ Z} (h : CategoryTheory.IsPullback fst snd f g) : CategoryTheory.Limits.PullbackCone f g - CategoryTheory.IsPullback.of_isLimit 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.IsPullback.Defs
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} {c : CategoryTheory.Limits.PullbackCone f g} (h : CategoryTheory.Limits.IsLimit c) : CategoryTheory.IsPullback c.fst c.snd f g - CategoryTheory.Limits.PullbackCone.pasteHoriz 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.Pasting
{C : Type u} [CategoryTheory.Category.{v, u} C] {X₃ Y₁ Y₂ Y₃ : C} {g₁ : Y₁ ⟶ Y₂} {g₂ : Y₂ ⟶ Y₃} {i₃ : X₃ ⟶ Y₃} (t₂ : CategoryTheory.Limits.PullbackCone g₂ i₃) {i₂ : t₂.pt ⟶ Y₂} (t₁ : CategoryTheory.Limits.PullbackCone g₁ i₂) (hi₂ : i₂ = t₂.fst) : CategoryTheory.Limits.PullbackCone (CategoryTheory.CategoryStruct.comp g₁ g₂) i₃ - CategoryTheory.Limits.PullbackCone.pasteVert 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.Pasting
{C : Type u} [CategoryTheory.Category.{v, u} C] {X₁ X₂ X₃ Y₁ : C} {f₁ : X₂ ⟶ X₁} {f₂ : X₃ ⟶ X₂} {i₁ : Y₁ ⟶ X₁} (t₁ : CategoryTheory.Limits.PullbackCone i₁ f₁) {i₂ : t₁.pt ⟶ X₂} (t₂ : CategoryTheory.Limits.PullbackCone i₂ f₂) (hi₂ : i₂ = t₁.snd) : CategoryTheory.Limits.PullbackCone i₁ (CategoryTheory.CategoryStruct.comp f₂ f₁) - CategoryTheory.Limits.leftSquareIsPullback 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.Pasting
{C : Type u} [CategoryTheory.Category.{v, u} C] {X₃ Y₁ Y₂ Y₃ : C} {g₁ : Y₁ ⟶ Y₂} {g₂ : Y₂ ⟶ Y₃} {i₃ : X₃ ⟶ Y₃} {t₂ : CategoryTheory.Limits.PullbackCone g₂ i₃} {i₂ : t₂.pt ⟶ Y₂} (t₁ : CategoryTheory.Limits.PullbackCone g₁ i₂) (hi₂ : i₂ = t₂.fst) (H : CategoryTheory.Limits.IsLimit t₂) (H' : CategoryTheory.Limits.IsLimit (t₂.pasteHoriz t₁ hi₂)) : CategoryTheory.Limits.IsLimit t₁ - CategoryTheory.Limits.pasteHorizIsPullback 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.Pasting
{C : Type u} [CategoryTheory.Category.{v, u} C] {X₃ Y₁ Y₂ Y₃ : C} {g₁ : Y₁ ⟶ Y₂} {g₂ : Y₂ ⟶ Y₃} {i₃ : X₃ ⟶ Y₃} {t₂ : CategoryTheory.Limits.PullbackCone g₂ i₃} {i₂ : t₂.pt ⟶ Y₂} {t₁ : CategoryTheory.Limits.PullbackCone g₁ i₂} (hi₂ : i₂ = t₂.fst) (H : CategoryTheory.Limits.IsLimit t₂) (H' : CategoryTheory.Limits.IsLimit t₁) : CategoryTheory.Limits.IsLimit (t₂.pasteHoriz t₁ hi₂) - CategoryTheory.Limits.pasteVertIsPullback 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.Pasting
{C : Type u} [CategoryTheory.Category.{v, u} C] {X₁ X₂ X₃ Y₁ : C} {f₁ : X₂ ⟶ X₁} {f₂ : X₃ ⟶ X₂} {i₁ : Y₁ ⟶ X₁} {t₁ : CategoryTheory.Limits.PullbackCone i₁ f₁} {i₂ : t₁.pt ⟶ X₂} {t₂ : CategoryTheory.Limits.PullbackCone i₂ f₂} (hi₂ : i₂ = t₁.snd) (H₁ : CategoryTheory.Limits.IsLimit t₁) (H₂ : CategoryTheory.Limits.IsLimit t₂) : CategoryTheory.Limits.IsLimit (t₁.pasteVert t₂ hi₂) - CategoryTheory.Limits.topSquareIsPullback 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.Pasting
{C : Type u} [CategoryTheory.Category.{v, u} C] {X₁ X₂ X₃ Y₁ : C} {f₁ : X₂ ⟶ X₁} {f₂ : X₃ ⟶ X₂} {i₁ : Y₁ ⟶ X₁} {t₁ : CategoryTheory.Limits.PullbackCone i₁ f₁} {i₂ : t₁.pt ⟶ X₂} (t₂ : CategoryTheory.Limits.PullbackCone i₂ f₂) (hi₂ : i₂ = t₁.snd) (H₁ : CategoryTheory.Limits.IsLimit t₁) (H₂ : CategoryTheory.Limits.IsLimit (t₁.pasteVert t₂ hi₂)) : CategoryTheory.Limits.IsLimit t₂ - CategoryTheory.Limits.pasteHorizIsPullbackEquiv 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.Pasting
{C : Type u} [CategoryTheory.Category.{v, u} C] {X₃ Y₁ Y₂ Y₃ : C} {g₁ : Y₁ ⟶ Y₂} {g₂ : Y₂ ⟶ Y₃} {i₃ : X₃ ⟶ Y₃} {t₂ : CategoryTheory.Limits.PullbackCone g₂ i₃} {i₂ : t₂.pt ⟶ Y₂} (t₁ : CategoryTheory.Limits.PullbackCone g₁ i₂) (hi₂ : i₂ = t₂.fst) (H : CategoryTheory.Limits.IsLimit t₂) : CategoryTheory.Limits.IsLimit (t₂.pasteHoriz t₁ hi₂) ≃ CategoryTheory.Limits.IsLimit t₁ - CategoryTheory.Limits.pasteVertIsPullbackEquiv 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.Pasting
{C : Type u} [CategoryTheory.Category.{v, u} C] {X₁ X₂ X₃ Y₁ : C} {f₁ : X₂ ⟶ X₁} {f₂ : X₃ ⟶ X₂} {i₁ : Y₁ ⟶ X₁} {t₁ : CategoryTheory.Limits.PullbackCone i₁ f₁} {i₂ : t₁.pt ⟶ X₂} (t₂ : CategoryTheory.Limits.PullbackCone i₂ f₂) (hi₂ : i₂ = t₁.snd) (H : CategoryTheory.Limits.IsLimit t₁) : CategoryTheory.Limits.IsLimit (t₁.pasteVert t₂ hi₂) ≃ CategoryTheory.Limits.IsLimit t₂ - CategoryTheory.Limits.PullbackCone.pasteVertFlip 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.Pasting
{C : Type u} [CategoryTheory.Category.{v, u} C] {X₁ X₂ X₃ Y₁ : C} {f₁ : X₂ ⟶ X₁} {f₂ : X₃ ⟶ X₂} {i₁ : Y₁ ⟶ X₁} (t₁ : CategoryTheory.Limits.PullbackCone i₁ f₁) {i₂ : t₁.pt ⟶ X₂} (t₂ : CategoryTheory.Limits.PullbackCone i₂ f₂) (hi₂ : i₂ = t₁.snd) : (t₁.pasteVert t₂ hi₂).flip ≅ t₁.flip.pasteHoriz t₂.flip hi₂ - CommRingCat.pullbackCone 📋 Mathlib.Algebra.Category.Ring.Constructions
{A B C : CommRingCat} (f : A ⟶ C) (g : B ⟶ C) : CategoryTheory.Limits.PullbackCone f g - CategoryTheory.isColimitCoforkOfEffectiveEpi 📋 Mathlib.CategoryTheory.Limits.Shapes.RegularMono
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {B X : C} (f : X ⟶ B) [CategoryTheory.EffectiveEpi f] (c : CategoryTheory.Limits.PullbackCone f f) (hc : CategoryTheory.Limits.IsLimit c) : CategoryTheory.Limits.IsColimit (CategoryTheory.Limits.Cofork.ofπ f ⋯) - CategoryTheory.Abelian.epi_fst_of_isLimit 📋 Mathlib.CategoryTheory.Abelian.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.Limits.HasPullbacks C] {X Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) [CategoryTheory.Epi g] {s : CategoryTheory.Limits.PullbackCone f g} (hs : CategoryTheory.Limits.IsLimit s) : CategoryTheory.Epi s.fst - CategoryTheory.Abelian.epi_snd_of_isLimit 📋 Mathlib.CategoryTheory.Abelian.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.Limits.HasPullbacks C] {X Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) [CategoryTheory.Epi f] {s : CategoryTheory.Limits.PullbackCone f g} (hs : CategoryTheory.Limits.IsLimit s) : CategoryTheory.Epi s.snd - CategoryTheory.Abelian.epi_fst_of_factor_thru_epi_mono_factorization 📋 Mathlib.CategoryTheory.Abelian.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.Limits.HasPullbacks C] {W X Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) (g₁ : Y ⟶ W) [CategoryTheory.Epi g₁] (g₂ : W ⟶ Z) [CategoryTheory.Mono g₂] (hg : CategoryTheory.CategoryStruct.comp g₁ g₂ = g) (f' : X ⟶ W) (hf : CategoryTheory.CategoryStruct.comp f' g₂ = f) (t : CategoryTheory.Limits.PullbackCone f g) (ht : CategoryTheory.Limits.IsLimit t) : CategoryTheory.Epi t.fst - CategoryTheory.Limits.Types.pullbackCone 📋 Mathlib.CategoryTheory.Limits.Types.Pullbacks
{X Y Z : Type u} (f : X ⟶ Z) (g : Y ⟶ Z) : CategoryTheory.Limits.PullbackCone f g - CategoryTheory.Limits.PullbackCone.toPullbackObj 📋 Mathlib.CategoryTheory.Limits.Types.Pullbacks
{X Y S : Type v} {f : X ⟶ S} {g : Y ⟶ S} (c : CategoryTheory.Limits.PullbackCone f g) (x : c.pt) : CategoryTheory.Limits.Types.PullbackObj f g - CategoryTheory.Limits.Types.pullbackLimitCone_cone 📋 Mathlib.CategoryTheory.Limits.Types.Pullbacks
{X Y Z : Type u} (f : X ⟶ Z) (g : Y ⟶ Z) : (CategoryTheory.Limits.Types.pullbackLimitCone f g).cone = CategoryTheory.Limits.Types.pullbackCone f g - CategoryTheory.Limits.PullbackCone.IsLimit.equivPullbackObj 📋 Mathlib.CategoryTheory.Limits.Types.Pullbacks
{X Y S : Type v} {f : X ⟶ S} {g : Y ⟶ S} {c : CategoryTheory.Limits.PullbackCone f g} (hc : CategoryTheory.Limits.IsLimit c) : c.pt ≃ CategoryTheory.Limits.Types.PullbackObj f g - CategoryTheory.Limits.PullbackCone.isLimitEquivBijective 📋 Mathlib.CategoryTheory.Limits.Types.Pullbacks
{X Y S : Type v} {f : X ⟶ S} {g : Y ⟶ S} (c : CategoryTheory.Limits.PullbackCone f g) : CategoryTheory.Limits.IsLimit c ≃ Function.Bijective c.toPullbackObj - CategoryTheory.Limits.PullbackCone.toPullbackObj_coe_fst 📋 Mathlib.CategoryTheory.Limits.Types.Pullbacks
{X Y S : Type v} {f : X ⟶ S} {g : Y ⟶ S} (c : CategoryTheory.Limits.PullbackCone f g) (x : c.pt) : (↑(c.toPullbackObj x)).1 = (CategoryTheory.ConcreteCategory.hom c.fst) x - CategoryTheory.Limits.PullbackCone.toPullbackObj_coe_snd 📋 Mathlib.CategoryTheory.Limits.Types.Pullbacks
{X Y S : Type v} {f : X ⟶ S} {g : Y ⟶ S} (c : CategoryTheory.Limits.PullbackCone f g) (x : c.pt) : (↑(c.toPullbackObj x)).2 = (CategoryTheory.ConcreteCategory.hom c.snd) x - CategoryTheory.Limits.PullbackCone.IsLimit.equivPullbackObj_apply_fst 📋 Mathlib.CategoryTheory.Limits.Types.Pullbacks
{X Y S : Type v} {f : X ⟶ S} {g : Y ⟶ S} {c : CategoryTheory.Limits.PullbackCone f g} (hc : CategoryTheory.Limits.IsLimit c) (x : c.pt) : (↑((CategoryTheory.Limits.PullbackCone.IsLimit.equivPullbackObj hc) x)).1 = (CategoryTheory.ConcreteCategory.hom c.fst) x - CategoryTheory.Limits.PullbackCone.IsLimit.equivPullbackObj_apply_snd 📋 Mathlib.CategoryTheory.Limits.Types.Pullbacks
{X Y S : Type v} {f : X ⟶ S} {g : Y ⟶ S} {c : CategoryTheory.Limits.PullbackCone f g} (hc : CategoryTheory.Limits.IsLimit c) (x : c.pt) : (↑((CategoryTheory.Limits.PullbackCone.IsLimit.equivPullbackObj hc) x)).2 = (CategoryTheory.ConcreteCategory.hom c.snd) x - CategoryTheory.Limits.PullbackCone.IsLimit.equivPullbackObj_symm_apply_fst 📋 Mathlib.CategoryTheory.Limits.Types.Pullbacks
{X Y S : Type v} {f : X ⟶ S} {g : Y ⟶ S} {c : CategoryTheory.Limits.PullbackCone f g} (hc : CategoryTheory.Limits.IsLimit c) (x : CategoryTheory.Limits.Types.PullbackObj f g) : (CategoryTheory.ConcreteCategory.hom c.fst) ((CategoryTheory.Limits.PullbackCone.IsLimit.equivPullbackObj hc).symm x) = (↑x).1 - CategoryTheory.Limits.PullbackCone.IsLimit.equivPullbackObj_symm_apply_snd 📋 Mathlib.CategoryTheory.Limits.Types.Pullbacks
{X Y S : Type v} {f : X ⟶ S} {g : Y ⟶ S} {c : CategoryTheory.Limits.PullbackCone f g} (hc : CategoryTheory.Limits.IsLimit c) (x : CategoryTheory.Limits.Types.PullbackObj f g) : (CategoryTheory.ConcreteCategory.hom c.snd) ((CategoryTheory.Limits.PullbackCone.IsLimit.equivPullbackObj hc).symm x) = (↑x).2 - CategoryTheory.Limits.Types.pullbackLimitCone_isLimit 📋 Mathlib.CategoryTheory.Limits.Types.Pullbacks
{X Y Z : Type u} (f : X ⟶ Z) (g : Y ⟶ Z) : (CategoryTheory.Limits.Types.pullbackLimitCone f g).isLimit = (CategoryTheory.Limits.Types.pullbackCone f g).isLimitAux (fun s => TypeCat.ofHom fun x => ⟨((CategoryTheory.ConcreteCategory.hom s.fst) x, (CategoryTheory.ConcreteCategory.hom s.snd) x), ⋯⟩) ⋯ ⋯ ⋯ - CategoryTheory.Limits.PullbackCone.IsLimit.type_ext 📋 Mathlib.CategoryTheory.Limits.Types.Pullbacks
{X Y S : Type v} {f : X ⟶ S} {g : Y ⟶ S} {c : CategoryTheory.Limits.PullbackCone f g} (hc : CategoryTheory.Limits.IsLimit c) {x y : c.pt} (h₁ : (CategoryTheory.ConcreteCategory.hom c.fst) x = (CategoryTheory.ConcreteCategory.hom c.fst) y) (h₂ : (CategoryTheory.ConcreteCategory.hom c.snd) x = (CategoryTheory.ConcreteCategory.hom c.snd) y) : x = y - CategoryTheory.Equalizer.Presieve.isSheafFor_singleton_iff 📋 Mathlib.CategoryTheory.Sites.EqualizerSheafCondition
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type u_1)} {X Y : C} {f : X ⟶ Y} (c : CategoryTheory.Limits.PullbackCone f f) (hc : CategoryTheory.Limits.IsLimit c) : CategoryTheory.Presieve.IsSheafFor F (CategoryTheory.Presieve.singleton f) ↔ Nonempty (CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.Fork.ofι (F.map f.op) ⋯)) - TopCat.pullbackCone 📋 Mathlib.Topology.Category.TopCat.Limits.Pullbacks
{X Y Z : TopCat} (f : X ⟶ Z) (g : Y ⟶ Z) : CategoryTheory.Limits.PullbackCone f g - CategoryTheory.IsUniversalColimit.nonempty_isColimit_of_pullbackCone_left 📋 Mathlib.CategoryTheory.Limits.VanKampen
{C : Type u} [CategoryTheory.Category.{v, u} C] {ι : Type u_3} {S B : C} {X : ι → C} {a : CategoryTheory.Limits.Cofan X} (hau : CategoryTheory.IsUniversalColimit a) (f : (i : ι) → X i ⟶ S) (u : a.pt ⟶ S) (v : B ⟶ S) (s : (i : ι) → CategoryTheory.Limits.PullbackCone v (f i)) (hs : (i : ι) → CategoryTheory.Limits.IsLimit (s i)) (t : CategoryTheory.Limits.PullbackCone v u) (ht : CategoryTheory.Limits.IsLimit t) (d : CategoryTheory.Limits.Cofan fun i => (s i).pt) (e : d.pt ≅ t.pt) (hu : ∀ (i : ι), CategoryTheory.CategoryStruct.comp (a.inj i) u = f i := by cat_disch) (he₁ : ∀ (i : ι), CategoryTheory.CategoryStruct.comp (d.inj i) (CategoryTheory.CategoryStruct.comp e.hom t.fst) = (s i).fst := by cat_disch) (he₂ : ∀ (i : ι), CategoryTheory.CategoryStruct.comp (d.inj i) (CategoryTheory.CategoryStruct.comp e.hom t.snd) = CategoryTheory.CategoryStruct.comp (s i).snd (a.inj i) := by cat_disch) : Nonempty (CategoryTheory.Limits.IsColimit d) - CategoryTheory.IsUniversalColimit.nonempty_isColimit_of_pullbackCone_right 📋 Mathlib.CategoryTheory.Limits.VanKampen
{C : Type u} [CategoryTheory.Category.{v, u} C] {ι : Type u_3} {S B : C} {X : ι → C} {a : CategoryTheory.Limits.Cofan X} (hau : CategoryTheory.IsUniversalColimit a) (f : (i : ι) → X i ⟶ S) (u : a.pt ⟶ S) (v : B ⟶ S) (s : (i : ι) → CategoryTheory.Limits.PullbackCone (f i) v) (hs : (i : ι) → CategoryTheory.Limits.IsLimit (s i)) (t : CategoryTheory.Limits.PullbackCone u v) (ht : CategoryTheory.Limits.IsLimit t) (d : CategoryTheory.Limits.Cofan fun i => (s i).pt) (e : d.pt ≅ t.pt) (hu : ∀ (i : ι), CategoryTheory.CategoryStruct.comp (a.inj i) u = f i := by cat_disch) (he₁ : ∀ (i : ι), CategoryTheory.CategoryStruct.comp (d.inj i) (CategoryTheory.CategoryStruct.comp e.hom t.fst) = CategoryTheory.CategoryStruct.comp (s i).fst (a.inj i) := by cat_disch) (he₂ : ∀ (i : ι), CategoryTheory.CategoryStruct.comp (d.inj i) (CategoryTheory.CategoryStruct.comp e.hom t.snd) = (s i).snd := by cat_disch) : Nonempty (CategoryTheory.Limits.IsColimit d) - CategoryTheory.BinaryCofan.isVanKampen_mk 📋 Mathlib.CategoryTheory.Limits.VanKampen
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y : C} (c : CategoryTheory.Limits.BinaryCofan X Y) (cofans : (X Y : C) → CategoryTheory.Limits.BinaryCofan X Y) (colimits : (X Y : C) → CategoryTheory.Limits.IsColimit (cofans X Y)) (cones : {X Y Z : C} → (f : X ⟶ Z) → (g : Y ⟶ Z) → CategoryTheory.Limits.PullbackCone f g) (limits : {X Y Z : C} → (f : X ⟶ Z) → (g : Y ⟶ Z) → CategoryTheory.Limits.IsLimit (cones f g)) (h₁ : ∀ {X' Y' : C} (αX : X' ⟶ X) (αY : Y' ⟶ Y) (f : (cofans X' Y').pt ⟶ c.pt), CategoryTheory.CategoryStruct.comp αX c.inl = CategoryTheory.CategoryStruct.comp (cofans X' Y').inl f → CategoryTheory.CategoryStruct.comp αY c.inr = CategoryTheory.CategoryStruct.comp (cofans X' Y').inr f → CategoryTheory.IsPullback (cofans X' Y').inl αX f c.inl ∧ CategoryTheory.IsPullback (cofans X' Y').inr αY f c.inr) (h₂ : {Z : C} → (f : Z ⟶ c.pt) → CategoryTheory.Limits.IsColimit (CategoryTheory.Limits.BinaryCofan.mk (cones f c.inl).fst (cones f c.inr).fst)) : CategoryTheory.IsVanKampenColimit c - CategoryTheory.IsUniversalColimit.nonempty_isColimit_prod_of_pullbackCone 📋 Mathlib.CategoryTheory.Limits.VanKampen
{C : Type u} [CategoryTheory.Category.{v, u} C] {ι : Type u_3} {ι' : Type u_4} {S : C} {X : ι → C} {a : CategoryTheory.Limits.Cofan X} (hau : CategoryTheory.IsUniversalColimit a) {Y : ι' → C} {b : CategoryTheory.Limits.Cofan Y} (hbu : CategoryTheory.IsUniversalColimit b) (f : (i : ι) → X i ⟶ S) (g : (i : ι') → Y i ⟶ S) (u : a.pt ⟶ S) (v : b.pt ⟶ S) [∀ (i : ι), CategoryTheory.Limits.HasPullback (f i) v] (s : (i : ι) → (j : ι') → CategoryTheory.Limits.PullbackCone (f i) (g j)) (hs : (i : ι) → (j : ι') → CategoryTheory.Limits.IsLimit (s i j)) (t : CategoryTheory.Limits.PullbackCone u v) (ht : CategoryTheory.Limits.IsLimit t) {d : CategoryTheory.Limits.Cofan fun p => (s p.1 p.2).pt} (e : d.pt ≅ t.pt) (hu : ∀ (i : ι), CategoryTheory.CategoryStruct.comp (a.inj i) u = f i := by cat_disch) (hv : ∀ (i : ι'), CategoryTheory.CategoryStruct.comp (b.inj i) v = g i := by cat_disch) (he₁ : ∀ (i : ι) (j : ι'), CategoryTheory.CategoryStruct.comp (d.inj (i, j)) (CategoryTheory.CategoryStruct.comp e.hom t.fst) = CategoryTheory.CategoryStruct.comp (s (i, j).1 (i, j).2).fst (a.inj (i, j).1) := by cat_disch) (he₂ : ∀ (i : ι) (j : ι'), CategoryTheory.CategoryStruct.comp (d.inj (i, j)) (CategoryTheory.CategoryStruct.comp e.hom t.snd) = CategoryTheory.CategoryStruct.comp (s (i, j).1 (i, j).2).snd (b.inj (i, j).2) := by cat_disch) : Nonempty (CategoryTheory.Limits.IsColimit d) - CategoryTheory.Limits.IsInitial.ofBinaryCoproductDisjointOfIsLimit 📋 Mathlib.CategoryTheory.Limits.Shapes.DisjointCoproduct
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y : C} [CategoryTheory.Limits.BinaryCoproductDisjoint X Y] [CategoryTheory.Limits.HasBinaryCoproduct X Y] (s : CategoryTheory.Limits.PullbackCone CategoryTheory.Limits.coprod.inl CategoryTheory.Limits.coprod.inr) (hs : CategoryTheory.Limits.IsLimit s) : CategoryTheory.Limits.IsInitial s.pt - CategoryTheory.Limits.IsInitial.ofCoproductDisjointOfIsLimit 📋 Mathlib.CategoryTheory.Limits.Shapes.DisjointCoproduct
{C : Type u} [CategoryTheory.Category.{v, u} C] {ι : Type u_1} {X : ι → C} [CategoryTheory.Limits.CoproductDisjoint X] {i j : ι} (hij : i ≠ j) [CategoryTheory.Limits.HasCoproduct X] {s : CategoryTheory.Limits.PullbackCone (CategoryTheory.Limits.Sigma.ι X i) (CategoryTheory.Limits.Sigma.ι X j)} (hs : CategoryTheory.Limits.IsLimit s) : CategoryTheory.Limits.IsInitial s.pt - CategoryTheory.Limits.IsInitial.ofCoproductDisjointOfIsColimitOfIsLimit 📋 Mathlib.CategoryTheory.Limits.Shapes.DisjointCoproduct
{C : Type u} [CategoryTheory.Category.{v, u} C] {ι : Type u_1} {X : ι → C} [CategoryTheory.Limits.CoproductDisjoint X] {i j : ι} (hij : i ≠ j) {c : CategoryTheory.Limits.Cofan X} (hc : CategoryTheory.Limits.IsColimit c) {s : CategoryTheory.Limits.PullbackCone (c.inj i) (c.inj j)} (hs : CategoryTheory.Limits.IsLimit s) : CategoryTheory.Limits.IsInitial s.pt - CategoryTheory.Limits.CoproductDisjoint.nonempty_isInitial_of_ne 📋 Mathlib.CategoryTheory.Limits.Shapes.DisjointCoproduct
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} {ι : Type u_1} {X : ι → C} [self : CategoryTheory.Limits.CoproductDisjoint X] {c : CategoryTheory.Limits.Cofan X} (hc : CategoryTheory.Limits.IsColimit c) {i j : ι} : i ≠ j → ∀ (s : CategoryTheory.Limits.PullbackCone (c.inj i) (c.inj j)) (a : CategoryTheory.Limits.IsLimit s), Nonempty (CategoryTheory.Limits.IsInitial s.pt) - CategoryTheory.Limits.CoproductDisjoint.of_hasCoproduct 📋 Mathlib.CategoryTheory.Limits.Shapes.DisjointCoproduct
{C : Type u} [CategoryTheory.Category.{v, u} C] {ι : Type u_1} {X : ι → C} [CategoryTheory.Limits.HasCoproduct X] [∀ (i : ι), CategoryTheory.Mono (CategoryTheory.Limits.Sigma.ι X i)] (s : {i j : ι} → i ≠ j → CategoryTheory.Limits.PullbackCone (CategoryTheory.Limits.Sigma.ι X i) (CategoryTheory.Limits.Sigma.ι X j)) (hs : {i j : ι} → (hij : i ≠ j) → CategoryTheory.Limits.IsLimit (s hij)) (H : {i j : ι} → (hij : i ≠ j) → CategoryTheory.Limits.IsInitial (s hij).pt) : CategoryTheory.Limits.CoproductDisjoint X - CategoryTheory.Limits.CoproductDisjoint.of_cofan 📋 Mathlib.CategoryTheory.Limits.Shapes.DisjointCoproduct
{C : Type u} [CategoryTheory.Category.{v, u} C] {ι : Type u_1} {X : ι → C} {c : CategoryTheory.Limits.Cofan X} (hc : CategoryTheory.Limits.IsColimit c) [∀ (i : ι), CategoryTheory.Mono (c.inj i)] (s : {i j : ι} → i ≠ j → CategoryTheory.Limits.PullbackCone (c.inj i) (c.inj j)) (hs : {i j : ι} → (hij : i ≠ j) → CategoryTheory.Limits.IsLimit (s hij)) (H : {i j : ι} → (hij : i ≠ j) → CategoryTheory.Limits.IsInitial (s hij).pt) : CategoryTheory.Limits.CoproductDisjoint X - CategoryTheory.Limits.CoproductDisjoint.mk 📋 Mathlib.CategoryTheory.Limits.Shapes.DisjointCoproduct
{C : Type u} [CategoryTheory.Category.{v, u} C] {ι : Type u_1} {X : ι → C} (nonempty_isInitial_of_ne : ∀ {c : CategoryTheory.Limits.Cofan X} (hc : CategoryTheory.Limits.IsColimit c) {i j : ι}, i ≠ j → ∀ (s : CategoryTheory.Limits.PullbackCone (c.inj i) (c.inj j)) (a : CategoryTheory.Limits.IsLimit s), Nonempty (CategoryTheory.Limits.IsInitial s.pt)) (mono_inj : ∀ {c : CategoryTheory.Limits.Cofan X} (hc : CategoryTheory.Limits.IsColimit c) (i : ι), CategoryTheory.Mono (c.inj i)) : CategoryTheory.Limits.CoproductDisjoint X - CategoryTheory.Limits.IsInitial.ofBinaryCoproductDisjointOfIsColimitOfIsLimit 📋 Mathlib.CategoryTheory.Limits.Shapes.DisjointCoproduct
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y : C} [CategoryTheory.Limits.BinaryCoproductDisjoint X Y] {c : CategoryTheory.Limits.BinaryCofan X Y} (hc : CategoryTheory.Limits.IsColimit c) {s : CategoryTheory.Limits.PullbackCone c.inl c.inr} (hs : CategoryTheory.Limits.IsLimit s) : CategoryTheory.Limits.IsInitial s.pt - CategoryTheory.Limits.BinaryCoproductDisjoint.of_binaryCofan 📋 Mathlib.CategoryTheory.Limits.Shapes.DisjointCoproduct
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y : C} {c : CategoryTheory.Limits.BinaryCofan X Y} (hc : CategoryTheory.Limits.IsColimit c) [CategoryTheory.Mono c.inl] [CategoryTheory.Mono c.inr] {s : CategoryTheory.Limits.PullbackCone c.inl c.inr} (hs : CategoryTheory.Limits.IsLimit s) (H : CategoryTheory.Limits.IsInitial s.pt) : CategoryTheory.Limits.BinaryCoproductDisjoint X Y - TopCat.Sheaf.interUnionPullbackCone 📋 Mathlib.Topology.Sheaves.SheafCondition.PairwiseIntersections
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : TopCat} (F : TopCat.Sheaf C X) (U V : TopologicalSpace.Opens ↑X) : CategoryTheory.Limits.PullbackCone (F.obj.map (CategoryTheory.homOfLE ⋯).op) (F.obj.map (CategoryTheory.homOfLE ⋯).op) - TopCat.Sheaf.interUnionPullbackConeLift 📋 Mathlib.Topology.Sheaves.SheafCondition.PairwiseIntersections
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : TopCat} (F : TopCat.Sheaf C X) (U V : TopologicalSpace.Opens ↑X) (s : CategoryTheory.Limits.PullbackCone (F.obj.map (CategoryTheory.homOfLE ⋯).op) (F.obj.map (CategoryTheory.homOfLE ⋯).op)) : s.pt ⟶ F.obj.obj (Opposite.op (U ⊔ V)) - TopCat.Sheaf.interUnionPullbackConeLift_left 📋 Mathlib.Topology.Sheaves.SheafCondition.PairwiseIntersections
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : TopCat} (F : TopCat.Sheaf C X) (U V : TopologicalSpace.Opens ↑X) (s : CategoryTheory.Limits.PullbackCone (F.obj.map (CategoryTheory.homOfLE ⋯).op) (F.obj.map (CategoryTheory.homOfLE ⋯).op)) : CategoryTheory.CategoryStruct.comp (F.interUnionPullbackConeLift U V s) (F.obj.map (CategoryTheory.homOfLE ⋯).op) = s.fst - TopCat.Sheaf.interUnionPullbackConeLift_right 📋 Mathlib.Topology.Sheaves.SheafCondition.PairwiseIntersections
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : TopCat} (F : TopCat.Sheaf C X) (U V : TopologicalSpace.Opens ↑X) (s : CategoryTheory.Limits.PullbackCone (F.obj.map (CategoryTheory.homOfLE ⋯).op) (F.obj.map (CategoryTheory.homOfLE ⋯).op)) : CategoryTheory.CategoryStruct.comp (F.interUnionPullbackConeLift U V s) (F.obj.map (CategoryTheory.homOfLE ⋯).op) = s.snd - CategoryTheory.Limits.pullbackConeEquivBinaryFan 📋 Mathlib.CategoryTheory.Limits.Constructions.Over.Products
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : Y ⟶ X} {g : Z ⟶ X} : CategoryTheory.Limits.PullbackCone f g ≌ CategoryTheory.Limits.BinaryFan (CategoryTheory.Over.mk f) (CategoryTheory.Over.mk g) - CategoryTheory.Limits.IsLimit.pullbackConeEquivBinaryFanFunctor 📋 Mathlib.CategoryTheory.Limits.Constructions.Over.Products
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : Y ⟶ X} {g : Z ⟶ X} {c : CategoryTheory.Limits.PullbackCone f g} (hc : CategoryTheory.Limits.IsLimit c) : CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.pullbackConeEquivBinaryFan.functor.obj c) - CategoryTheory.Limits.IsLimit.pullbackConeEquivBinaryFanInverse 📋 Mathlib.CategoryTheory.Limits.Constructions.Over.Products
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : Y ⟶ X} {g : Z ⟶ X} {c : CategoryTheory.Limits.BinaryFan (CategoryTheory.Over.mk f) (CategoryTheory.Over.mk g)} (hc : CategoryTheory.Limits.IsLimit c) : CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.pullbackConeEquivBinaryFan.inverse.obj c) - CategoryTheory.Limits.pullbackConeEquivBinaryFan_functor_obj 📋 Mathlib.CategoryTheory.Limits.Constructions.Over.Products
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : Y ⟶ X} {g : Z ⟶ X} (c : CategoryTheory.Limits.PullbackCone f g) : CategoryTheory.Limits.pullbackConeEquivBinaryFan.functor.obj c = CategoryTheory.Limits.BinaryFan.mk (CategoryTheory.Over.homMk c.fst ⋯) (CategoryTheory.Over.homMk c.snd ⋯) - CategoryTheory.Limits.pullbackConeEquivBinaryFan_inverse_obj 📋 Mathlib.CategoryTheory.Limits.Constructions.Over.Products
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : Y ⟶ X} {g : Z ⟶ X} (c : CategoryTheory.Limits.BinaryFan (CategoryTheory.Over.mk f) (CategoryTheory.Over.mk g)) : CategoryTheory.Limits.pullbackConeEquivBinaryFan.inverse.obj c = CategoryTheory.Limits.PullbackCone.mk (CategoryTheory.Over.Hom.left c.fst) (CategoryTheory.Over.Hom.left c.snd) ⋯ - CategoryTheory.Limits.IsLimit.pullbackConeEquivBinaryFanFunctor_lift_left 📋 Mathlib.CategoryTheory.Limits.Constructions.Over.Products
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : Y ⟶ X} {g : Z ⟶ X} {c : CategoryTheory.Limits.PullbackCone f g} (hc : CategoryTheory.Limits.IsLimit c) (s : CategoryTheory.Limits.BinaryFan (CategoryTheory.Over.mk f) (CategoryTheory.Over.mk g)) : (hc.pullbackConeEquivBinaryFanFunctor.lift s).left = hc.lift (CategoryTheory.Limits.PullbackCone.mk (CategoryTheory.Over.Hom.left s.fst) (CategoryTheory.Over.Hom.left s.snd) ⋯) - CategoryTheory.Limits.pullbackConeEquivBinaryFan_inverse_map_hom 📋 Mathlib.CategoryTheory.Limits.Constructions.Over.Products
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : Y ⟶ X} {g : Z ⟶ X} {c₁ c₂ : CategoryTheory.Limits.BinaryFan (CategoryTheory.Over.mk f) (CategoryTheory.Over.mk g)} (a : c₁ ⟶ c₂) : (CategoryTheory.Limits.pullbackConeEquivBinaryFan.inverse.map a).hom = CategoryTheory.Over.Hom.left a.hom - CategoryTheory.Limits.pullbackConeEquivBinaryFan_functor_map_hom 📋 Mathlib.CategoryTheory.Limits.Constructions.Over.Products
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : Y ⟶ X} {g : Z ⟶ X} {c₁ c₂ : CategoryTheory.Limits.PullbackCone f g} (a : c₁ ⟶ c₂) : (CategoryTheory.Limits.pullbackConeEquivBinaryFan.functor.map a).hom = CategoryTheory.Over.homMk a.hom ⋯ - CategoryTheory.Limits.pullbackConeEquivBinaryFan_unitIso 📋 Mathlib.CategoryTheory.Limits.Constructions.Over.Products
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : Y ⟶ X} {g : Z ⟶ X} : CategoryTheory.Limits.pullbackConeEquivBinaryFan.unitIso = CategoryTheory.NatIso.ofComponents (fun c => c.eta) ⋯ - CategoryTheory.Limits.pullbackConeEquivBinaryFan_counitIso 📋 Mathlib.CategoryTheory.Limits.Constructions.Over.Products
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : Y ⟶ X} {g : Z ⟶ X} : CategoryTheory.Limits.pullbackConeEquivBinaryFan.counitIso = CategoryTheory.NatIso.ofComponents (fun X_1 => CategoryTheory.Limits.BinaryFan.ext (CategoryTheory.Over.isoMk (CategoryTheory.Iso.refl (({ obj := fun c => CategoryTheory.Limits.PullbackCone.mk (CategoryTheory.Over.Hom.left c.fst) (CategoryTheory.Over.Hom.left c.snd) ⋯, map := fun {c₁ c₂} a => { hom := CategoryTheory.Over.Hom.left a.hom, w := ⋯ }, map_id := ⋯, map_comp := ⋯ }.comp { obj := fun c => CategoryTheory.Limits.BinaryFan.mk (CategoryTheory.Over.homMk c.fst ⋯) (CategoryTheory.Over.homMk c.snd ⋯), map := fun {c₁ c₂} a => { hom := CategoryTheory.Over.homMk a.hom ⋯, w := ⋯ }, map_id := ⋯, map_comp := ⋯ }).obj X_1).pt.left) ⋯) ⋯ ⋯) ⋯ - CategoryTheory.Square.pullbackCone 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.Square
{C : Type u} [CategoryTheory.Category.{v, u} C] (sq : CategoryTheory.Square C) : CategoryTheory.Limits.PullbackCone sq.f₂₄ sq.f₃₄ - AlgebraicGeometry.LocallyRingedSpace.IsOpenImmersion.pullbackConeOfLeft 📋 Mathlib.Geometry.RingedSpace.OpenImmersion
{X Y Z : AlgebraicGeometry.LocallyRingedSpace} (f : X ⟶ Z) (g : Y ⟶ Z) [H : AlgebraicGeometry.LocallyRingedSpace.IsOpenImmersion f] : CategoryTheory.Limits.PullbackCone f g - AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.pullbackConeOfLeft 📋 Mathlib.Geometry.RingedSpace.OpenImmersion
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : AlgebraicGeometry.PresheafedSpace C} (f : X ⟶ Z) [hf : AlgebraicGeometry.PresheafedSpace.IsOpenImmersion f] (g : Y ⟶ Z) : CategoryTheory.Limits.PullbackCone f g - AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.pullbackConeOfLeftLift 📋 Mathlib.Geometry.RingedSpace.OpenImmersion
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : AlgebraicGeometry.PresheafedSpace C} (f : X ⟶ Z) [hf : AlgebraicGeometry.PresheafedSpace.IsOpenImmersion f] (g : Y ⟶ Z) (s : CategoryTheory.Limits.PullbackCone f g) : s.pt ⟶ (AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.pullbackConeOfLeft f g).pt - AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.pullbackConeOfLeftLift_fst 📋 Mathlib.Geometry.RingedSpace.OpenImmersion
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : AlgebraicGeometry.PresheafedSpace C} (f : X ⟶ Z) [hf : AlgebraicGeometry.PresheafedSpace.IsOpenImmersion f] (g : Y ⟶ Z) (s : CategoryTheory.Limits.PullbackCone f g) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.pullbackConeOfLeftLift f g s) (AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.pullbackConeOfLeft f g).fst = s.fst - AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.pullbackConeOfLeftLift_snd 📋 Mathlib.Geometry.RingedSpace.OpenImmersion
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : AlgebraicGeometry.PresheafedSpace C} (f : X ⟶ Z) [hf : AlgebraicGeometry.PresheafedSpace.IsOpenImmersion f] (g : Y ⟶ Z) (s : CategoryTheory.Limits.PullbackCone f g) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.pullbackConeOfLeftLift f g s) (AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.pullbackConeOfLeft f g).snd = s.snd - CategoryTheory.GlueData.vPullbackCone 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (D : CategoryTheory.GlueData C) [CategoryTheory.Limits.HasMulticoequalizer D.diagram] (i j : D.J) : CategoryTheory.Limits.PullbackCone (D.ι i) (D.ι j) - AlgebraicGeometry.Scheme.GlueData.vPullbackCone 📋 Mathlib.AlgebraicGeometry.Gluing
(D : AlgebraicGeometry.Scheme.GlueData) (i j : D.J) : CategoryTheory.Limits.PullbackCone (D.ι i) (D.ι j) - AlgebraicGeometry.Scheme.Pullback.gluedLift 📋 Mathlib.AlgebraicGeometry.Pullbacks
{X Y Z : AlgebraicGeometry.Scheme} (𝒰 : X.OpenCover) (f : X ⟶ Z) (g : Y ⟶ Z) [∀ (i : 𝒰.I₀), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (𝒰.f i) f) g] (s : CategoryTheory.Limits.PullbackCone f g) : s.pt ⟶ (AlgebraicGeometry.Scheme.Pullback.gluing 𝒰 f g).glued - AlgebraicGeometry.Scheme.Pullback.gluedLift_p1 📋 Mathlib.AlgebraicGeometry.Pullbacks
{X Y Z : AlgebraicGeometry.Scheme} (𝒰 : X.OpenCover) (f : X ⟶ Z) (g : Y ⟶ Z) [∀ (i : 𝒰.I₀), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (𝒰.f i) f) g] (s : CategoryTheory.Limits.PullbackCone f g) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Pullback.gluedLift 𝒰 f g s) (AlgebraicGeometry.Scheme.Pullback.p1 𝒰 f g) = s.fst - AlgebraicGeometry.Scheme.Pullback.gluedLift_p2 📋 Mathlib.AlgebraicGeometry.Pullbacks
{X Y Z : AlgebraicGeometry.Scheme} (𝒰 : X.OpenCover) (f : X ⟶ Z) (g : Y ⟶ Z) [∀ (i : 𝒰.I₀), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (𝒰.f i) f) g] (s : CategoryTheory.Limits.PullbackCone f g) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Pullback.gluedLift 𝒰 f g s) (AlgebraicGeometry.Scheme.Pullback.p2 𝒰 f g) = s.snd - AlgebraicGeometry.Scheme.Pullback.gluedLiftPullbackMap 📋 Mathlib.AlgebraicGeometry.Pullbacks
{X Y Z : AlgebraicGeometry.Scheme} (𝒰 : X.OpenCover) (f : X ⟶ Z) (g : Y ⟶ Z) [∀ (i : 𝒰.I₀), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (𝒰.f i) f) g] (s : CategoryTheory.Limits.PullbackCone f g) (i j : 𝒰.I₀) : CategoryTheory.Limits.pullback ((CategoryTheory.Precoverage.ZeroHypercover.pullback₁ s.fst 𝒰).f i) ((CategoryTheory.Precoverage.ZeroHypercover.pullback₁ s.fst 𝒰).f j) ⟶ (AlgebraicGeometry.Scheme.Pullback.gluing 𝒰 f g).V (i, j) - AlgebraicGeometry.Scheme.Pullback.gluedLiftPullbackMap_snd 📋 Mathlib.AlgebraicGeometry.Pullbacks
{X Y Z : AlgebraicGeometry.Scheme} (𝒰 : X.OpenCover) (f : X ⟶ Z) (g : Y ⟶ Z) [∀ (i : 𝒰.I₀), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (𝒰.f i) f) g] (s : CategoryTheory.Limits.PullbackCone f g) (i j : 𝒰.I₀) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Pullback.gluedLiftPullbackMap 𝒰 f g s i j) (CategoryTheory.Limits.pullback.snd (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (CategoryTheory.CategoryStruct.comp (𝒰.f i) f) g) (𝒰.f i)) (𝒰.f j)) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.snd ((CategoryTheory.Precoverage.ZeroHypercover.pullback₁ s.fst 𝒰).f i) ((CategoryTheory.Precoverage.ZeroHypercover.pullback₁ s.fst 𝒰).f j)) (CategoryTheory.Limits.pullback.snd s.fst (𝒰.f j)) - AlgebraicGeometry.Scheme.Pullback.gluedLiftPullbackMap_snd_assoc 📋 Mathlib.AlgebraicGeometry.Pullbacks
{X Y Z : AlgebraicGeometry.Scheme} (𝒰 : X.OpenCover) (f : X ⟶ Z) (g : Y ⟶ Z) [∀ (i : 𝒰.I₀), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (𝒰.f i) f) g] (s : CategoryTheory.Limits.PullbackCone f g) (i j : 𝒰.I₀) {Z✝ : AlgebraicGeometry.Scheme} (h : 𝒰.X j ⟶ Z✝) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Pullback.gluedLiftPullbackMap 𝒰 f g s i j) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.snd (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (CategoryTheory.CategoryStruct.comp (𝒰.f i) f) g) (𝒰.f i)) (𝒰.f j)) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.snd ((CategoryTheory.Precoverage.ZeroHypercover.pullback₁ s.fst 𝒰).f i) ((CategoryTheory.Precoverage.ZeroHypercover.pullback₁ s.fst 𝒰).f j)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.snd s.fst (𝒰.f j)) h) - AlgebraicGeometry.Scheme.Pullback.gluedLiftPullbackMap_fst 📋 Mathlib.AlgebraicGeometry.Pullbacks
{X Y Z : AlgebraicGeometry.Scheme} (𝒰 : X.OpenCover) (f : X ⟶ Z) (g : Y ⟶ Z) [∀ (i : 𝒰.I₀), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (𝒰.f i) f) g] (s : CategoryTheory.Limits.PullbackCone f g) (i j : 𝒰.I₀) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Pullback.gluedLiftPullbackMap 𝒰 f g s i j) (CategoryTheory.Limits.pullback.fst (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (CategoryTheory.CategoryStruct.comp (𝒰.f i) f) g) (𝒰.f i)) (𝒰.f j)) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst ((CategoryTheory.Precoverage.ZeroHypercover.pullback₁ s.fst 𝒰).f i) ((CategoryTheory.Precoverage.ZeroHypercover.pullback₁ s.fst 𝒰).f j)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullbackSymmetry s.fst (𝒰.f i)).hom (CategoryTheory.Limits.pullback.map (𝒰.f i) s.fst (CategoryTheory.CategoryStruct.comp (𝒰.f i) f) g (CategoryTheory.CategoryStruct.id (𝒰.X i)) s.snd f ⋯ ⋯)) - AlgebraicGeometry.Scheme.Pullback.gluedLiftPullbackMap_fst_assoc 📋 Mathlib.AlgebraicGeometry.Pullbacks
{X Y Z : AlgebraicGeometry.Scheme} (𝒰 : X.OpenCover) (f : X ⟶ Z) (g : Y ⟶ Z) [∀ (i : 𝒰.I₀), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (𝒰.f i) f) g] (s : CategoryTheory.Limits.PullbackCone f g) (i j : 𝒰.I₀) {Z✝ : AlgebraicGeometry.Scheme} (h : CategoryTheory.Limits.pullback (CategoryTheory.CategoryStruct.comp (𝒰.f i) f) g ⟶ Z✝) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Pullback.gluedLiftPullbackMap 𝒰 f g s i j) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (CategoryTheory.CategoryStruct.comp (𝒰.f i) f) g) (𝒰.f i)) (𝒰.f j)) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst ((CategoryTheory.Precoverage.ZeroHypercover.pullback₁ s.fst 𝒰).f i) ((CategoryTheory.Precoverage.ZeroHypercover.pullback₁ s.fst 𝒰).f j)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullbackSymmetry s.fst (𝒰.f i)).hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.map (𝒰.f i) s.fst (CategoryTheory.CategoryStruct.comp (𝒰.f i) f) g (CategoryTheory.CategoryStruct.id (𝒰.X i)) s.snd f ⋯ ⋯) h)) - CategoryTheory.Functor.regularEpiOfPreserves 📋 Mathlib.CategoryTheory.EffectiveEpi.Preserves
{C : Type u_3} {D : Type u_4} [CategoryTheory.Category.{v_3, u_3} C] [CategoryTheory.Category.{v_4, u_4} D] {X Y : C} (f : X ⟶ Y) [CategoryTheory.EffectiveEpi f] (F : CategoryTheory.Functor C D) [F.PreservesEffectiveEpis] [CategoryTheory.Limits.PreservesLimitsOfShape CategoryTheory.Limits.WalkingCospan F] (c : CategoryTheory.Limits.PullbackCone f f) (hc : CategoryTheory.Limits.IsLimit c) : CategoryTheory.RegularEpi (F.map f) - CategoryTheory.Functor.regularEpiOfPreserves_W 📋 Mathlib.CategoryTheory.EffectiveEpi.Preserves
{C : Type u_3} {D : Type u_4} [CategoryTheory.Category.{v_3, u_3} C] [CategoryTheory.Category.{v_4, u_4} D] {X Y : C} (f : X ⟶ Y) [CategoryTheory.EffectiveEpi f] (F : CategoryTheory.Functor C D) [F.PreservesEffectiveEpis] [CategoryTheory.Limits.PreservesLimitsOfShape CategoryTheory.Limits.WalkingCospan F] (c : CategoryTheory.Limits.PullbackCone f f) (hc : CategoryTheory.Limits.IsLimit c) : (CategoryTheory.Functor.regularEpiOfPreserves f F c hc).W = F.obj c.pt - CategoryTheory.Functor.regularEpiOfPreserves_left 📋 Mathlib.CategoryTheory.EffectiveEpi.Preserves
{C : Type u_3} {D : Type u_4} [CategoryTheory.Category.{v_3, u_3} C] [CategoryTheory.Category.{v_4, u_4} D] {X Y : C} (f : X ⟶ Y) [CategoryTheory.EffectiveEpi f] (F : CategoryTheory.Functor C D) [F.PreservesEffectiveEpis] [CategoryTheory.Limits.PreservesLimitsOfShape CategoryTheory.Limits.WalkingCospan F] (c : CategoryTheory.Limits.PullbackCone f f) (hc : CategoryTheory.Limits.IsLimit c) : (CategoryTheory.Functor.regularEpiOfPreserves f F c hc).left = F.map c.fst - CategoryTheory.Functor.regularEpiOfPreserves_right 📋 Mathlib.CategoryTheory.EffectiveEpi.Preserves
{C : Type u_3} {D : Type u_4} [CategoryTheory.Category.{v_3, u_3} C] [CategoryTheory.Category.{v_4, u_4} D] {X Y : C} (f : X ⟶ Y) [CategoryTheory.EffectiveEpi f] (F : CategoryTheory.Functor C D) [F.PreservesEffectiveEpis] [CategoryTheory.Limits.PreservesLimitsOfShape CategoryTheory.Limits.WalkingCospan F] (c : CategoryTheory.Limits.PullbackCone f f) (hc : CategoryTheory.Limits.IsLimit c) : (CategoryTheory.Functor.regularEpiOfPreserves f F c hc).right = F.map c.snd - CategoryTheory.Functor.regularEpiOfPreserves_isColimit 📋 Mathlib.CategoryTheory.EffectiveEpi.Preserves
{C : Type u_3} {D : Type u_4} [CategoryTheory.Category.{v_3, u_3} C] [CategoryTheory.Category.{v_4, u_4} D] {X Y : C} (f : X ⟶ Y) [CategoryTheory.EffectiveEpi f] (F : CategoryTheory.Functor C D) [F.PreservesEffectiveEpis] [CategoryTheory.Limits.PreservesLimitsOfShape CategoryTheory.Limits.WalkingCospan F] (c : CategoryTheory.Limits.PullbackCone f f) (hc : CategoryTheory.Limits.IsLimit c) : (CategoryTheory.Functor.regularEpiOfPreserves f F c hc).isColimit = CategoryTheory.isColimitCoforkOfEffectiveEpi (F.map f) (CategoryTheory.Limits.PullbackCone.mk (F.map c.fst) (F.map c.snd) ⋯) ((CategoryTheory.Limits.IsLimit.equivOfNatIsoOfIso (CategoryTheory.Limits.cospanIsoMk (CategoryTheory.Iso.refl (((CategoryTheory.Limits.cospan f f).comp F).obj CategoryTheory.Limits.WalkingCospan.one)) (CategoryTheory.Iso.refl (((CategoryTheory.Limits.cospan f f).comp F).obj CategoryTheory.Limits.WalkingCospan.left)) (CategoryTheory.Iso.refl (((CategoryTheory.Limits.cospan f f).comp F).obj CategoryTheory.Limits.WalkingCospan.right)) ⋯ ⋯) (F.mapCone c) (CategoryTheory.Limits.PullbackCone.mk (F.map c.fst) (F.map c.snd) ⋯) (CategoryTheory.Limits.Cone.ext (CategoryTheory.Iso.refl ((CategoryTheory.Limits.Cone.postcompose (CategoryTheory.Limits.cospanIsoMk (CategoryTheory.Iso.refl (((CategoryTheory.Limits.cospan f f).comp F).obj CategoryTheory.Limits.WalkingCospan.one)) (CategoryTheory.Iso.refl (((CategoryTheory.Limits.cospan f f).comp F).obj CategoryTheory.Limits.WalkingCospan.left)) (CategoryTheory.Iso.refl (((CategoryTheory.Limits.cospan f f).comp F).obj CategoryTheory.Limits.WalkingCospan.right)) ⋯ ⋯).hom).obj (F.mapCone c)).pt) ⋯)) (CategoryTheory.Limits.isLimitOfPreserves F hc)) - CategoryTheory.mono_iff_isIso_fst 📋 Mathlib.CategoryTheory.Limits.EpiMono
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X Y : C} {f : X ⟶ Y} {c : CategoryTheory.Limits.PullbackCone f f} (hc : CategoryTheory.Limits.IsLimit c) : CategoryTheory.Mono f ↔ CategoryTheory.IsIso c.fst - CategoryTheory.mono_iff_isIso_snd 📋 Mathlib.CategoryTheory.Limits.EpiMono
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X Y : C} {f : X ⟶ Y} {c : CategoryTheory.Limits.PullbackCone f f} (hc : CategoryTheory.Limits.IsLimit c) : CategoryTheory.Mono f ↔ CategoryTheory.IsIso c.snd - CategoryTheory.mono_iff_fst_eq_snd 📋 Mathlib.CategoryTheory.Limits.EpiMono
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X Y : C} {f : X ⟶ Y} {c : CategoryTheory.Limits.PullbackCone f f} (hc : CategoryTheory.Limits.IsLimit c) : CategoryTheory.Mono f ↔ c.fst = c.snd - CategoryTheory.Limits.PullbackCone.combine 📋 Mathlib.CategoryTheory.Limits.FunctorCategory.Shapes.Pullbacks
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F G H : CategoryTheory.Functor D C} (f : F ⟶ H) (g : G ⟶ H) (c : (X : D) → CategoryTheory.Limits.PullbackCone (f.app X) (g.app X)) (hc : (X : D) → CategoryTheory.Limits.IsLimit (c X)) : CategoryTheory.Limits.PullbackCone f g - CategoryTheory.Limits.PullbackCone.combineIsLimit 📋 Mathlib.CategoryTheory.Limits.FunctorCategory.Shapes.Pullbacks
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F G H : CategoryTheory.Functor D C} (f : F ⟶ H) (g : G ⟶ H) (c : (X : D) → CategoryTheory.Limits.PullbackCone (f.app X) (g.app X)) (hc : (X : D) → CategoryTheory.Limits.IsLimit (c X)) : CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.PullbackCone.combine f g c hc) - CategoryTheory.Limits.PullbackCone.combine_pt_obj 📋 Mathlib.CategoryTheory.Limits.FunctorCategory.Shapes.Pullbacks
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F G H : CategoryTheory.Functor D C} (f : F ⟶ H) (g : G ⟶ H) (c : (X : D) → CategoryTheory.Limits.PullbackCone (f.app X) (g.app X)) (hc : (X : D) → CategoryTheory.Limits.IsLimit (c X)) (X : D) : (CategoryTheory.Limits.PullbackCone.combine f g c hc).pt.obj X = (c X).pt - CategoryTheory.Limits.PullbackCone.combine_pt_map 📋 Mathlib.CategoryTheory.Limits.FunctorCategory.Shapes.Pullbacks
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F G H : CategoryTheory.Functor D C} (f : F ⟶ H) (g : G ⟶ H) (c : (X : D) → CategoryTheory.Limits.PullbackCone (f.app X) (g.app X)) (hc : (X : D) → CategoryTheory.Limits.IsLimit (c X)) {X Y : D} (h : X ⟶ Y) : (CategoryTheory.Limits.PullbackCone.combine f g c hc).pt.map h = (hc Y).lift { pt := (c X).pt, π := CategoryTheory.CategoryStruct.comp (c X).π (CategoryTheory.Limits.cospanHomMk (H.map h) (F.map h) (G.map h) ⋯ ⋯) } - CategoryTheory.Limits.PullbackCone.combine_π_app 📋 Mathlib.CategoryTheory.Limits.FunctorCategory.Shapes.Pullbacks
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F G H : CategoryTheory.Functor D C} (f : F ⟶ H) (g : G ⟶ H) (c : (X : D) → CategoryTheory.Limits.PullbackCone (f.app X) (g.app X)) (hc : (X : D) → CategoryTheory.Limits.IsLimit (c X)) (j : CategoryTheory.Limits.WalkingCospan) : (CategoryTheory.Limits.PullbackCone.combine f g c hc).π.app j = Option.rec (CategoryTheory.CategoryStruct.comp { app := fun X => (c X).fst, naturality := ⋯ } f) (fun val => CategoryTheory.Limits.WalkingPair.rec { app := fun X => (c X).fst, naturality := ⋯ } { app := fun X => (c X).snd, naturality := ⋯ } val) j - 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.EquivalenceRelation.c 📋 Mathlib.CategoryTheory.EquivalenceRelation
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {R X : C} {p₁ p₂ : R ⟶ X} (self : CategoryTheory.EquivalenceRelation p₁ p₂) : CategoryTheory.Limits.PullbackCone p₂ p₁ - CategoryTheory.TransitiveRelation.c 📋 Mathlib.CategoryTheory.EquivalenceRelation
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {R X : C} {p₁ p₂ : R ⟶ X} (self : CategoryTheory.TransitiveRelation p₁ p₂) : CategoryTheory.Limits.PullbackCone p₂ p₁ - CategoryTheory.IsKernelPair.equivalenceRelation 📋 Mathlib.CategoryTheory.EquivalenceRelation
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X Y : C} (f : X ⟶ Y) {R : C} (p₁ p₂ : R ⟶ X) {t : CategoryTheory.Limits.PullbackCone p₂ p₁} (ht : CategoryTheory.Limits.IsLimit t) (h : CategoryTheory.IsKernelPair f p₁ p₂) : CategoryTheory.EquivalenceRelation p₁ p₂ - CategoryTheory.TransitiveRelation.mk 📋 Mathlib.CategoryTheory.EquivalenceRelation
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {R X : C} {p₁ p₂ : R ⟶ X} (toJointlyMono₂ : CategoryTheory.JointlyMono₂ p₁ p₂) (c : CategoryTheory.Limits.PullbackCone p₂ p₁) (isLimit : CategoryTheory.Limits.IsLimit c) (t : c.pt ⟶ R) (transitivity₁ : CategoryTheory.CategoryStruct.comp t p₁ = CategoryTheory.CategoryStruct.comp c.fst p₁ := by cat_disch) (transitivity₂ : CategoryTheory.CategoryStruct.comp t p₂ = CategoryTheory.CategoryStruct.comp c.snd p₂ := by cat_disch) : CategoryTheory.TransitiveRelation p₁ p₂ - CategoryTheory.EquivalenceRelation.mk 📋 Mathlib.CategoryTheory.EquivalenceRelation
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {R X : C} {p₁ p₂ : R ⟶ X} (toReflexiveRelation : CategoryTheory.ReflexiveRelation p₁ p₂) (s : R ⟶ R) (symmetry₁ : CategoryTheory.CategoryStruct.comp s p₁ = p₂ := by cat_disch) (symmetry₂ : CategoryTheory.CategoryStruct.comp s p₂ = p₁ := by cat_disch) (c : CategoryTheory.Limits.PullbackCone p₂ p₁) (isLimit : CategoryTheory.Limits.IsLimit c) (t : c.pt ⟶ R) (transitivity₁ : CategoryTheory.CategoryStruct.comp t p₁ = CategoryTheory.CategoryStruct.comp c.fst p₁ := by cat_disch) (transitivity₂ : CategoryTheory.CategoryStruct.comp t p₂ = CategoryTheory.CategoryStruct.comp c.snd p₂ := by cat_disch) : CategoryTheory.EquivalenceRelation p₁ p₂ - CategoryTheory.Limits.FormalCoproduct.pullbackCone 📋 Mathlib.CategoryTheory.Limits.FormalCoproducts.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : CategoryTheory.Limits.FormalCoproduct C} (f : X ⟶ Z) (g : Y ⟶ Z) (pb : (i : Function.Pullback f.f g.f) → CategoryTheory.Limits.PullbackCone (CategoryTheory.CategoryStruct.comp (f.φ (↑i).1) (CategoryTheory.eqToHom ⋯)) (g.φ (↑i).2)) : CategoryTheory.Limits.PullbackCone f g - CategoryTheory.Limits.FormalCoproduct.pullbackCone_fst_f 📋 Mathlib.CategoryTheory.Limits.FormalCoproducts.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : CategoryTheory.Limits.FormalCoproduct C} (f : X ⟶ Z) (g : Y ⟶ Z) (pb : (i : Function.Pullback f.f g.f) → CategoryTheory.Limits.PullbackCone (CategoryTheory.CategoryStruct.comp (f.φ (↑i).1) (CategoryTheory.eqToHom ⋯)) (g.φ (↑i).2)) (i : (CategoryTheory.Limits.FormalCoproduct.pullbackCone f g pb).pt.I) : (CategoryTheory.Limits.FormalCoproduct.pullbackCone f g pb).fst.f i = (↑i).1 - CategoryTheory.Limits.FormalCoproduct.pullbackCone_snd_f 📋 Mathlib.CategoryTheory.Limits.FormalCoproducts.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : CategoryTheory.Limits.FormalCoproduct C} (f : X ⟶ Z) (g : Y ⟶ Z) (pb : (i : Function.Pullback f.f g.f) → CategoryTheory.Limits.PullbackCone (CategoryTheory.CategoryStruct.comp (f.φ (↑i).1) (CategoryTheory.eqToHom ⋯)) (g.φ (↑i).2)) (i : (CategoryTheory.Limits.FormalCoproduct.pullbackCone f g pb).pt.I) : (CategoryTheory.Limits.FormalCoproduct.pullbackCone f g pb).snd.f i = (↑i).2 - CategoryTheory.Limits.FormalCoproduct.pullbackCone_condition 📋 Mathlib.CategoryTheory.Limits.FormalCoproducts.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : CategoryTheory.Limits.FormalCoproduct C} (f : X ⟶ Z) (g : Y ⟶ Z) (pb : (i : Function.Pullback f.f g.f) → CategoryTheory.Limits.PullbackCone (CategoryTheory.CategoryStruct.comp (f.φ (↑i).1) (CategoryTheory.eqToHom ⋯)) (g.φ (↑i).2)) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.FormalCoproduct.pullbackCone f g pb).fst f = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.FormalCoproduct.pullbackCone f g pb).snd g - CategoryTheory.Limits.FormalCoproduct.hasPullback_of_pullbackCone 📋 Mathlib.CategoryTheory.Limits.FormalCoproducts.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : CategoryTheory.Limits.FormalCoproduct C} (f : X ⟶ Z) (g : Y ⟶ Z) (pb : (i : Function.Pullback f.f g.f) → CategoryTheory.Limits.PullbackCone (CategoryTheory.CategoryStruct.comp (f.φ (↑i).1) (CategoryTheory.eqToHom ⋯)) (g.φ (↑i).2)) (hpb : (i : Function.Pullback f.f g.f) → CategoryTheory.Limits.IsLimit (pb i)) : CategoryTheory.Limits.HasPullback f g - CategoryTheory.Limits.FormalCoproduct.isLimitPullbackCone 📋 Mathlib.CategoryTheory.Limits.FormalCoproducts.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : CategoryTheory.Limits.FormalCoproduct C} (f : X ⟶ Z) (g : Y ⟶ Z) (pb : (i : Function.Pullback f.f g.f) → CategoryTheory.Limits.PullbackCone (CategoryTheory.CategoryStruct.comp (f.φ (↑i).1) (CategoryTheory.eqToHom ⋯)) (g.φ (↑i).2)) (hpb : (i : Function.Pullback f.f g.f) → CategoryTheory.Limits.IsLimit (pb i)) : CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.FormalCoproduct.pullbackCone f g pb) - CategoryTheory.Limits.FormalCoproduct.isPullback 📋 Mathlib.CategoryTheory.Limits.FormalCoproducts.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : CategoryTheory.Limits.FormalCoproduct C} (f : X ⟶ Z) (g : Y ⟶ Z) (pb : (i : Function.Pullback f.f g.f) → CategoryTheory.Limits.PullbackCone (CategoryTheory.CategoryStruct.comp (f.φ (↑i).1) (CategoryTheory.eqToHom ⋯)) (g.φ (↑i).2)) (hpb : (i : Function.Pullback f.f g.f) → CategoryTheory.Limits.IsLimit (pb i)) : CategoryTheory.IsPullback (CategoryTheory.Limits.FormalCoproduct.pullbackCone f g pb).fst (CategoryTheory.Limits.FormalCoproduct.pullbackCone f g pb).snd f g - CategoryTheory.Limits.FormalCoproduct.pullbackCone_fst_φ 📋 Mathlib.CategoryTheory.Limits.FormalCoproducts.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : CategoryTheory.Limits.FormalCoproduct C} (f : X ⟶ Z) (g : Y ⟶ Z) (pb : (i : Function.Pullback f.f g.f) → CategoryTheory.Limits.PullbackCone (CategoryTheory.CategoryStruct.comp (f.φ (↑i).1) (CategoryTheory.eqToHom ⋯)) (g.φ (↑i).2)) (i : (CategoryTheory.Limits.FormalCoproduct.pullbackCone f g pb).pt.I) : (CategoryTheory.Limits.FormalCoproduct.pullbackCone f g pb).fst.φ i = (pb i).fst - CategoryTheory.Limits.FormalCoproduct.pullbackCone_snd_φ 📋 Mathlib.CategoryTheory.Limits.FormalCoproducts.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : CategoryTheory.Limits.FormalCoproduct C} (f : X ⟶ Z) (g : Y ⟶ Z) (pb : (i : Function.Pullback f.f g.f) → CategoryTheory.Limits.PullbackCone (CategoryTheory.CategoryStruct.comp (f.φ (↑i).1) (CategoryTheory.eqToHom ⋯)) (g.φ (↑i).2)) (i : (CategoryTheory.Limits.FormalCoproduct.pullbackCone f g pb).pt.I) : (CategoryTheory.Limits.FormalCoproduct.pullbackCone f g pb).snd.φ i = (pb i).snd - CategoryTheory.Limits.FormalCoproduct.homPullbackEquiv 📋 Mathlib.CategoryTheory.Limits.FormalCoproducts.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : CategoryTheory.Limits.FormalCoproduct C} (f : X ⟶ Z) (g : Y ⟶ Z) (pb : (i : Function.Pullback f.f g.f) → CategoryTheory.Limits.PullbackCone (CategoryTheory.CategoryStruct.comp (f.φ (↑i).1) (CategoryTheory.eqToHom ⋯)) (g.φ (↑i).2)) (hpb : (i : Function.Pullback f.f g.f) → CategoryTheory.Limits.IsLimit (pb i)) (T : CategoryTheory.Limits.FormalCoproduct C) : (T ⟶ (CategoryTheory.Limits.FormalCoproduct.pullbackCone f g pb).pt) ≃ { p // CategoryTheory.CategoryStruct.comp p.1 f = CategoryTheory.CategoryStruct.comp p.2 g } - CategoryTheory.Limits.FormalCoproduct.homPullbackEquiv_apply_coe 📋 Mathlib.CategoryTheory.Limits.FormalCoproducts.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : CategoryTheory.Limits.FormalCoproduct C} (f : X ⟶ Z) (g : Y ⟶ Z) (pb : (i : Function.Pullback f.f g.f) → CategoryTheory.Limits.PullbackCone (CategoryTheory.CategoryStruct.comp (f.φ (↑i).1) (CategoryTheory.eqToHom ⋯)) (g.φ (↑i).2)) (hpb : (i : Function.Pullback f.f g.f) → CategoryTheory.Limits.IsLimit (pb i)) (T : CategoryTheory.Limits.FormalCoproduct C) (m : T ⟶ (CategoryTheory.Limits.FormalCoproduct.pullbackCone f g pb).pt) : ↑((CategoryTheory.Limits.FormalCoproduct.homPullbackEquiv f g pb hpb T) m) = (CategoryTheory.CategoryStruct.comp m (CategoryTheory.Limits.FormalCoproduct.pullbackCone f g pb).fst, CategoryTheory.CategoryStruct.comp m (CategoryTheory.Limits.FormalCoproduct.pullbackCone f g pb).snd) - CategoryTheory.Limits.FormalCoproduct.homPullbackEquiv_symm_apply_f_coe 📋 Mathlib.CategoryTheory.Limits.FormalCoproducts.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : CategoryTheory.Limits.FormalCoproduct C} (f : X ⟶ Z) (g : Y ⟶ Z) (pb : (i : Function.Pullback f.f g.f) → CategoryTheory.Limits.PullbackCone (CategoryTheory.CategoryStruct.comp (f.φ (↑i).1) (CategoryTheory.eqToHom ⋯)) (g.φ (↑i).2)) (hpb : (i : Function.Pullback f.f g.f) → CategoryTheory.Limits.IsLimit (pb i)) (T : CategoryTheory.Limits.FormalCoproduct C) (s : { p // CategoryTheory.CategoryStruct.comp p.1 f = CategoryTheory.CategoryStruct.comp p.2 g }) (i : T.I) : ↑(((CategoryTheory.Limits.FormalCoproduct.homPullbackEquiv f g pb hpb T).symm s).f i) = ((↑s).1.f i, (↑s).2.f i) - CategoryTheory.Limits.FormalCoproduct.homPullbackEquiv_symm_apply_φ 📋 Mathlib.CategoryTheory.Limits.FormalCoproducts.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : CategoryTheory.Limits.FormalCoproduct C} (f : X ⟶ Z) (g : Y ⟶ Z) (pb : (i : Function.Pullback f.f g.f) → CategoryTheory.Limits.PullbackCone (CategoryTheory.CategoryStruct.comp (f.φ (↑i).1) (CategoryTheory.eqToHom ⋯)) (g.φ (↑i).2)) (hpb : (i : Function.Pullback f.f g.f) → CategoryTheory.Limits.IsLimit (pb i)) (T : CategoryTheory.Limits.FormalCoproduct C) (s : { p // CategoryTheory.CategoryStruct.comp p.1 f = CategoryTheory.CategoryStruct.comp p.2 g }) (i : T.I) : ((CategoryTheory.Limits.FormalCoproduct.homPullbackEquiv f g pb hpb T).symm s).φ i = (hpb ⟨((↑s).1.f i, (↑s).2.f i), ⋯⟩).lift (CategoryTheory.Limits.PullbackCone.mk ((↑s).1.φ i) ((↑s).2.φ i) ⋯) - CategoryTheory.Limits.weakPullback.cone 📋 Mathlib.CategoryTheory.Limits.WeakLimits.WeakPullbacks
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) [CategoryTheory.Limits.HasWeakPullback f g] : CategoryTheory.Limits.PullbackCone f g - CategoryTheory.Limits.PullbackCone.mkSelfIsWeakLimit 📋 Mathlib.CategoryTheory.Limits.WeakLimits.WeakPullbacks
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} {t : CategoryTheory.Limits.PullbackCone f g} (ht : CategoryTheory.Limits.IsWeakLimit t) : CategoryTheory.Limits.IsWeakLimit (CategoryTheory.Limits.PullbackCone.mk t.fst t.snd ⋯) - CategoryTheory.Limits.PullbackCone.IsWeakLimit.lift 📋 Mathlib.CategoryTheory.Limits.WeakLimits.WeakPullbacks
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} {t : CategoryTheory.Limits.PullbackCone f g} (ht : CategoryTheory.Limits.IsWeakLimit t) {W : C} (h : W ⟶ X) (k : W ⟶ Y) (w : CategoryTheory.CategoryStruct.comp h f = CategoryTheory.CategoryStruct.comp k g) : W ⟶ t.pt - CategoryTheory.Limits.PullbackCone.IsWeakLimit.lift_fst 📋 Mathlib.CategoryTheory.Limits.WeakLimits.WeakPullbacks
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} {t : CategoryTheory.Limits.PullbackCone f g} (ht : CategoryTheory.Limits.IsWeakLimit t) {W : C} (h : W ⟶ X) (k : W ⟶ Y) (w : CategoryTheory.CategoryStruct.comp h f = CategoryTheory.CategoryStruct.comp k g) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.PullbackCone.IsWeakLimit.lift ht h k w) t.fst = h - CategoryTheory.Limits.PullbackCone.IsWeakLimit.lift_snd 📋 Mathlib.CategoryTheory.Limits.WeakLimits.WeakPullbacks
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} {t : CategoryTheory.Limits.PullbackCone f g} (ht : CategoryTheory.Limits.IsWeakLimit t) {W : C} (h : W ⟶ X) (k : W ⟶ Y) (w : CategoryTheory.CategoryStruct.comp h f = CategoryTheory.CategoryStruct.comp k g) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.PullbackCone.IsWeakLimit.lift ht h k w) t.snd = k - CategoryTheory.Limits.PullbackCone.IsWeakLimit.lift_fst_assoc 📋 Mathlib.CategoryTheory.Limits.WeakLimits.WeakPullbacks
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} {t : CategoryTheory.Limits.PullbackCone f g} (ht : CategoryTheory.Limits.IsWeakLimit t) {W : C} (h : W ⟶ X) (k : W ⟶ Y) (w : CategoryTheory.CategoryStruct.comp h f = CategoryTheory.CategoryStruct.comp k g) {Z✝ : C} (h✝ : X ⟶ Z✝) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.PullbackCone.IsWeakLimit.lift ht h k w) (CategoryTheory.CategoryStruct.comp t.fst h✝) = CategoryTheory.CategoryStruct.comp h h✝ - CategoryTheory.Limits.PullbackCone.IsWeakLimit.lift_snd_assoc 📋 Mathlib.CategoryTheory.Limits.WeakLimits.WeakPullbacks
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} {t : CategoryTheory.Limits.PullbackCone f g} (ht : CategoryTheory.Limits.IsWeakLimit t) {W : C} (h : W ⟶ X) (k : W ⟶ Y) (w : CategoryTheory.CategoryStruct.comp h f = CategoryTheory.CategoryStruct.comp k g) {Z✝ : C} (h✝ : Y ⟶ Z✝) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.PullbackCone.IsWeakLimit.lift ht h k w) (CategoryTheory.CategoryStruct.comp t.snd h✝) = CategoryTheory.CategoryStruct.comp k h✝ - CategoryTheory.Limits.PullbackCone.IsWeakLimit.lift' 📋 Mathlib.CategoryTheory.Limits.WeakLimits.WeakPullbacks
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} {t : CategoryTheory.Limits.PullbackCone f g} (ht : CategoryTheory.Limits.IsWeakLimit t) {W : C} (h : W ⟶ X) (k : W ⟶ Y) (w : CategoryTheory.CategoryStruct.comp h f = CategoryTheory.CategoryStruct.comp k g) : { l // CategoryTheory.CategoryStruct.comp l t.fst = h ∧ CategoryTheory.CategoryStruct.comp l t.snd = k } - CategoryTheory.Limits.PullbackCone.IsWeakLimit.mk 📋 Mathlib.CategoryTheory.Limits.WeakLimits.WeakPullbacks
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} {W : C} {fst : W ⟶ X} {snd : W ⟶ Y} (eq : CategoryTheory.CategoryStruct.comp fst f = CategoryTheory.CategoryStruct.comp snd g) (lift : (s : CategoryTheory.Limits.PullbackCone f g) → s.pt ⟶ W) (fac_left : ∀ (s : CategoryTheory.Limits.PullbackCone f g), CategoryTheory.CategoryStruct.comp (lift s) fst = s.fst) (fac_right : ∀ (s : CategoryTheory.Limits.PullbackCone f g), CategoryTheory.CategoryStruct.comp (lift s) snd = s.snd) : CategoryTheory.Limits.IsWeakLimit (CategoryTheory.Limits.PullbackCone.mk fst snd eq) - CategoryTheory.Limits.PullbackCone.isWeakLimitAux 📋 Mathlib.CategoryTheory.Limits.WeakLimits.WeakPullbacks
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} (t : CategoryTheory.Limits.PullbackCone f g) (lift : (s : CategoryTheory.Limits.PullbackCone f g) → s.pt ⟶ t.pt) (fac_left : ∀ (s : CategoryTheory.Limits.PullbackCone f g), CategoryTheory.CategoryStruct.comp (lift s) t.fst = s.fst) (fac_right : ∀ (s : CategoryTheory.Limits.PullbackCone f g), CategoryTheory.CategoryStruct.comp (lift s) t.snd = s.snd) : CategoryTheory.Limits.IsWeakLimit t - CategoryTheory.Limits.PullbackCone.isWeakLimitAux' 📋 Mathlib.CategoryTheory.Limits.WeakLimits.WeakPullbacks
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} (t : CategoryTheory.Limits.PullbackCone f g) (create : (s : CategoryTheory.Limits.PullbackCone f g) → { l // CategoryTheory.CategoryStruct.comp l t.fst = s.fst ∧ CategoryTheory.CategoryStruct.comp l t.snd = s.snd }) : CategoryTheory.Limits.IsWeakLimit t - CategoryTheory.ChosenPullbacksAlong.pullbackCone 📋 Mathlib.CategoryTheory.LocallyCartesianClosed.ChosenPullbacksAlong
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {Y Z X : C} (f : Y ⟶ X) (g : Z ⟶ X) [CategoryTheory.ChosenPullbacksAlong g] : CategoryTheory.Limits.PullbackCone f g - CategoryTheory.regularTopology.equalizerCondition_w 📋 Mathlib.CategoryTheory.Sites.Coherent.RegularSheaves
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] (P : CategoryTheory.Functor Cᵒᵖ D) {X B : C} {π : X ⟶ B} (c : CategoryTheory.Limits.PullbackCone π π) : CategoryTheory.CategoryStruct.comp (P.map π.op) (P.map c.fst.op) = CategoryTheory.CategoryStruct.comp (P.map π.op) (P.map c.snd.op) - CategoryTheory.regularTopology.isLimit_forkOfι_equiv 📋 Mathlib.CategoryTheory.Sites.Coherent.RegularSheaves
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] (P : CategoryTheory.Functor Cᵒᵖ D) {X B : C} (π : X ⟶ B) (c : CategoryTheory.Limits.PullbackCone π π) (hc : CategoryTheory.Limits.IsLimit c) : CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.Fork.ofι (P.map π.op) ⋯) ≃ CategoryTheory.Limits.IsLimit (P.mapCone (CategoryTheory.Sieve.ofArrows (fun x => X) fun x => π).arrows.cocone.op) - CategoryTheory.regularTopology.EqualizerCondition.bijective_mapToEqualizer_pullback' 📋 Mathlib.CategoryTheory.Sites.Coherent.RegularSheaves
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {P : CategoryTheory.Functor Cᵒᵖ (Type u_4)} (hP : CategoryTheory.regularTopology.EqualizerCondition P) {X B : C} {π : X ⟶ B} [CategoryTheory.EffectiveEpi π] (c : CategoryTheory.Limits.PullbackCone π π) (hc : CategoryTheory.Limits.IsLimit c) : Function.Bijective ⇑(CategoryTheory.ConcreteCategory.hom (CategoryTheory.regularTopology.mapToEqualizer P π c.fst c.snd ⋯)) - CategoryTheory.regularTopology.EqualizerCondition.mk' 📋 Mathlib.CategoryTheory.Sites.Coherent.RegularSheaves
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (P : CategoryTheory.Functor Cᵒᵖ (Type u_4)) (hP : ∀ (X B : C) (π : X ⟶ B) [CategoryTheory.EffectiveEpi π] (c : CategoryTheory.Limits.PullbackCone π π) (x : CategoryTheory.Limits.IsLimit c), Function.Bijective ⇑(CategoryTheory.ConcreteCategory.hom (CategoryTheory.regularTopology.mapToEqualizer P π c.fst c.snd ⋯))) : CategoryTheory.regularTopology.EqualizerCondition P - CategoryTheory.regularTopology.parallelPair_pullback_initial 📋 Mathlib.CategoryTheory.Sites.Coherent.RegularSheaves
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X B : C} (π : X ⟶ B) (c : CategoryTheory.Limits.PullbackCone π π) (hc : CategoryTheory.Limits.IsLimit c) : (CategoryTheory.Limits.parallelPair (CategoryTheory.ObjectProperty.homMk (CategoryTheory.Over.homMk c.fst ⋯)).op (CategoryTheory.ObjectProperty.homMk (CategoryTheory.Over.homMk c.snd ⋯)).op).Initial - CompHausLike.pullback.cone 📋 Mathlib.Topology.Category.CompHausLike.Limits
{P : TopCat → Prop} {X Y B : CompHausLike P} (f : X ⟶ B) (g : Y ⟶ B) [CompHausLike.HasExplicitPullback f g] : CategoryTheory.Limits.PullbackCone f g - CompHausLike.pullback.isLimit_lift 📋 Mathlib.Topology.Category.CompHausLike.Limits
{P : TopCat → Prop} {X Y B : CompHausLike P} (f : X ⟶ B) (g : Y ⟶ B) [CompHausLike.HasExplicitPullback f g] (s : CategoryTheory.Limits.PullbackCone f g) : (CompHausLike.pullback.isLimit f g).lift s = CompHausLike.pullback.lift f g s.fst s.snd ⋯
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 ce5dd8c