Loogle!
Result
Found 53 declarations mentioning CategoryTheory.Limits.pullback.lift.
- CategoryTheory.Limits.pullback.lift π Mathlib.CategoryTheory.Limits.Shapes.Pullback.HasPullback
{C : Type u} [CategoryTheory.Category.{v, u} C] {W X Y Z : C} {f : X βΆ Z} {g : Y βΆ Z} [CategoryTheory.Limits.HasPullback f g] (h : W βΆ X) (k : W βΆ Y) (w : CategoryTheory.CategoryStruct.comp h f = CategoryTheory.CategoryStruct.comp k g := by cat_disch) : W βΆ CategoryTheory.Limits.pullback f g - CategoryTheory.Limits.pullback.lift_fst_snd π 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.pullback.lift (CategoryTheory.Limits.pullback.fst f g) (CategoryTheory.Limits.pullback.snd f g) β― = CategoryTheory.CategoryStruct.id (CategoryTheory.Limits.pullback f g) - CategoryTheory.Limits.pullback.lift_fst π Mathlib.CategoryTheory.Limits.Shapes.Pullback.HasPullback
{C : Type u} [CategoryTheory.Category.{v, u} C] {W X Y Z : C} {f : X βΆ Z} {g : Y βΆ Z} [CategoryTheory.Limits.HasPullback f g] (h : W βΆ X) (k : W βΆ Y) (w : CategoryTheory.CategoryStruct.comp h f = CategoryTheory.CategoryStruct.comp k g) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.lift h k w) (CategoryTheory.Limits.pullback.fst f g) = h - CategoryTheory.Limits.pullback.lift_snd π Mathlib.CategoryTheory.Limits.Shapes.Pullback.HasPullback
{C : Type u} [CategoryTheory.Category.{v, u} C] {W X Y Z : C} {f : X βΆ Z} {g : Y βΆ Z} [CategoryTheory.Limits.HasPullback f g] (h : W βΆ X) (k : W βΆ Y) (w : CategoryTheory.CategoryStruct.comp h f = CategoryTheory.CategoryStruct.comp k g) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.lift h k w) (CategoryTheory.Limits.pullback.snd f g) = k - CategoryTheory.Limits.pullback.lift_fst_assoc π Mathlib.CategoryTheory.Limits.Shapes.Pullback.HasPullback
{C : Type u} [CategoryTheory.Category.{v, u} C] {W X Y Z : C} {f : X βΆ Z} {g : Y βΆ Z} [CategoryTheory.Limits.HasPullback f g] (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.pullback.lift h k w) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst f g) hβ) = CategoryTheory.CategoryStruct.comp h hβ - CategoryTheory.Limits.pullback.lift_snd_assoc π Mathlib.CategoryTheory.Limits.Shapes.Pullback.HasPullback
{C : Type u} [CategoryTheory.Category.{v, u} C] {W X Y Z : C} {f : X βΆ Z} {g : Y βΆ Z} [CategoryTheory.Limits.HasPullback f g] (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.pullback.lift h k w) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.snd f g) hβ) = CategoryTheory.CategoryStruct.comp k hβ - CategoryTheory.Limits.map_lift_pullbackComparison π Mathlib.CategoryTheory.Limits.Shapes.Pullback.HasPullback
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (G : CategoryTheory.Functor C D) (f : X βΆ Z) (g : Y βΆ Z) [CategoryTheory.Limits.HasPullback f g] [CategoryTheory.Limits.HasPullback (G.map f) (G.map g)] {W : C} {h : W βΆ X} {k : W βΆ Y} (w : CategoryTheory.CategoryStruct.comp h f = CategoryTheory.CategoryStruct.comp k g) : CategoryTheory.CategoryStruct.comp (G.map (CategoryTheory.Limits.pullback.lift h k w)) (CategoryTheory.Limits.pullbackComparison G f g) = CategoryTheory.Limits.pullback.lift (G.map h) (G.map k) β― - CategoryTheory.Limits.map_lift_pullbackComparison_assoc π Mathlib.CategoryTheory.Limits.Shapes.Pullback.HasPullback
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (G : CategoryTheory.Functor C D) (f : X βΆ Z) (g : Y βΆ Z) [CategoryTheory.Limits.HasPullback f g] [CategoryTheory.Limits.HasPullback (G.map f) (G.map g)] {W : C} {h : W βΆ X} {k : W βΆ Y} (w : CategoryTheory.CategoryStruct.comp h f = CategoryTheory.CategoryStruct.comp k g) {Zβ : D} (hβ : CategoryTheory.Limits.pullback (G.map f) (G.map g) βΆ Zβ) : CategoryTheory.CategoryStruct.comp (G.map (CategoryTheory.Limits.pullback.lift h k w)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullbackComparison G f g) hβ) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.lift (G.map h) (G.map k) β―) hβ - CategoryTheory.Over.pullback_map_left π Mathlib.CategoryTheory.Comma.Over.Pullback
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y : C} (f : X βΆ Y) [CategoryTheory.Limits.HasPullbacksAlong f] (g : CategoryTheory.Over Y) {h : CategoryTheory.Over Y} {k : g βΆ h} : ((CategoryTheory.Over.pullback f).map k).left = CategoryTheory.Limits.pullback.lift (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst g.hom f) (CategoryTheory.Over.Hom.left k)) (CategoryTheory.Limits.pullback.snd g.hom f) β― - CategoryTheory.Over.mapPullbackAdj_unit_app π Mathlib.CategoryTheory.Comma.Over.Pullback
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y : C} (f : X βΆ Y) [CategoryTheory.Limits.HasPullbacksAlong f] (Xβ : CategoryTheory.Over X) : (CategoryTheory.Over.mapPullbackAdj f).unit.app Xβ = CategoryTheory.Over.homMk (CategoryTheory.Limits.pullback.lift (CategoryTheory.CategoryStruct.id Xβ.left) Xβ.hom β―) β― - CategoryTheory.Over.postAdjunctionLeft_unit_app_left π Mathlib.CategoryTheory.Comma.Over.Pullback
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] [CategoryTheory.Limits.HasPullbacks C] {X : C} {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (a : F β£ G) (Xβ : CategoryTheory.Over ((CategoryTheory.Functor.id C).obj X)) : ((CategoryTheory.Over.postAdjunctionLeft a).unit.app Xβ).left = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.lift (CategoryTheory.CategoryStruct.id Xβ.left) Xβ.hom β―) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.lift (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (CategoryTheory.CategoryStruct.comp Xβ.hom (a.unit.app X)) (a.unit.app X)) (a.unit.app Xβ.left)) (CategoryTheory.Limits.pullback.snd (CategoryTheory.CategoryStruct.comp Xβ.hom (a.unit.app X)) (a.unit.app X)) β―) (((CategoryTheory.Over.post G).comp (CategoryTheory.Over.pullback (a.unit.app X))).map ((CategoryTheory.NatIso.ofComponents (fun Y => CategoryTheory.Over.isoMk (CategoryTheory.Iso.refl (F.obj Y.left)) β―) β―).hom.app Xβ)).left) - CategoryTheory.Limits.pullbackAssocIsPullback π Mathlib.CategoryTheory.Limits.Shapes.Pullback.Assoc
{C : Type u} [CategoryTheory.Category.{v, u} C] {Xβ Xβ Xβ Yβ Yβ : C} (fβ : Xβ βΆ Yβ) (fβ : Xβ βΆ Yβ) (fβ : Xβ βΆ Yβ) (fβ : Xβ βΆ Yβ) [CategoryTheory.Limits.HasPullback fβ fβ] [CategoryTheory.Limits.HasPullback fβ fβ] [CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.snd fβ fβ) fβ) fβ] : CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.PullbackCone.mk (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.snd fβ fβ) fβ) fβ) (CategoryTheory.Limits.pullback.fst fβ fβ)) (CategoryTheory.Limits.pullback.lift (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.snd fβ fβ) fβ) fβ) (CategoryTheory.Limits.pullback.snd fβ fβ)) (CategoryTheory.Limits.pullback.snd (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.snd fβ fβ) fβ) fβ) β―) β―) - CategoryTheory.Limits.pullbackAssocSymmIsPullback π Mathlib.CategoryTheory.Limits.Shapes.Pullback.Assoc
{C : Type u} [CategoryTheory.Category.{v, u} C] {Xβ Xβ Xβ Yβ Yβ : C} (fβ : Xβ βΆ Yβ) (fβ : Xβ βΆ Yβ) (fβ : Xβ βΆ Yβ) (fβ : Xβ βΆ Yβ) [CategoryTheory.Limits.HasPullback fβ fβ] [CategoryTheory.Limits.HasPullback fβ fβ] [CategoryTheory.Limits.HasPullback fβ (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst fβ fβ) fβ)] : CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.PullbackCone.mk (CategoryTheory.Limits.pullback.lift (CategoryTheory.Limits.pullback.fst fβ (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst fβ fβ) fβ)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.snd fβ (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst fβ fβ) fβ)) (CategoryTheory.Limits.pullback.fst fβ fβ)) β―) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.snd fβ (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst fβ fβ) fβ)) (CategoryTheory.Limits.pullback.snd fβ fβ)) β―) - CategoryTheory.Limits.pullbackPullbackLeftIsPullback π Mathlib.CategoryTheory.Limits.Shapes.Pullback.Assoc
{C : Type u} [CategoryTheory.Category.{v, u} C] {Xβ Xβ Xβ Yβ Yβ : C} (fβ : Xβ βΆ Yβ) (fβ : Xβ βΆ Yβ) (fβ : Xβ βΆ Yβ) (fβ : Xβ βΆ Yβ) [CategoryTheory.Limits.HasPullback fβ fβ] [CategoryTheory.Limits.HasPullback fβ fβ] [CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.snd fβ fβ) fβ) fβ] : CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.PullbackCone.mk (CategoryTheory.Limits.pullback.fst (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.snd fβ fβ) fβ) fβ) (CategoryTheory.Limits.pullback.lift (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.snd fβ fβ) fβ) fβ) (CategoryTheory.Limits.pullback.snd fβ fβ)) (CategoryTheory.Limits.pullback.snd (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.snd fβ fβ) fβ) fβ) β―) β―) - CategoryTheory.Limits.pullbackPullbackRightIsPullback π Mathlib.CategoryTheory.Limits.Shapes.Pullback.Assoc
{C : Type u} [CategoryTheory.Category.{v, u} C] {Xβ Xβ Xβ Yβ Yβ : C} (fβ : Xβ βΆ Yβ) (fβ : Xβ βΆ Yβ) (fβ : Xβ βΆ Yβ) (fβ : Xβ βΆ Yβ) [CategoryTheory.Limits.HasPullback fβ fβ] [CategoryTheory.Limits.HasPullback fβ fβ] [CategoryTheory.Limits.HasPullback fβ (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst fβ fβ) fβ)] : CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.PullbackCone.mk (CategoryTheory.Limits.pullback.lift (CategoryTheory.Limits.pullback.fst fβ (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst fβ fβ) fβ)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.snd fβ (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst fβ fβ) fβ)) (CategoryTheory.Limits.pullback.fst fβ fβ)) β―) (CategoryTheory.Limits.pullback.snd fβ (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst fβ fβ) fβ)) β―) - CategoryTheory.Limits.pullback_lift_diagonal_isPullback π Mathlib.CategoryTheory.Limits.Shapes.Diagonal
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X Y : C} [CategoryTheory.Limits.HasPullbacks C] {S : C} (g : Y βΆ X) (f : X βΆ S) : CategoryTheory.IsPullback g (CategoryTheory.Limits.pullback.lift (CategoryTheory.CategoryStruct.id Y) g β―) (CategoryTheory.Limits.pullback.diagonal f) (CategoryTheory.Limits.pullback.map (CategoryTheory.CategoryStruct.comp g f) f f f g (CategoryTheory.CategoryStruct.id X) (CategoryTheory.CategoryStruct.id S) β― β―) - CategoryTheory.Limits.pullback_lift_map_isPullback π Mathlib.CategoryTheory.Limits.Shapes.Diagonal
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasPullbacks C] {X Y S X' Y' S' : C} (f : X βΆ S) (g : Y βΆ S) (f' : X' βΆ S') (g' : Y' βΆ S') (iβ : X βΆ X') (iβ : Y βΆ Y') (iβ : S βΆ S') (eβ : CategoryTheory.CategoryStruct.comp f iβ = CategoryTheory.CategoryStruct.comp iβ f') (eβ : CategoryTheory.CategoryStruct.comp g iβ = CategoryTheory.CategoryStruct.comp iβ g') [CategoryTheory.Mono iβ] : CategoryTheory.IsPullback (CategoryTheory.Limits.pullback.lift (CategoryTheory.Limits.pullback.map f g f' g' iβ iβ iβ eβ eβ) (CategoryTheory.Limits.pullback.fst f g) β―) (CategoryTheory.Limits.pullback.lift (CategoryTheory.Limits.pullback.map f g f' g' iβ iβ iβ eβ eβ) (CategoryTheory.Limits.pullback.snd f g) β―) (CategoryTheory.Limits.pullback.fst (CategoryTheory.Limits.pullback.fst f' g') iβ) (CategoryTheory.Limits.pullback.fst (CategoryTheory.Limits.pullback.snd f' g') iβ) - CategoryTheory.Limits.pullbackFstFstIso_inv π Mathlib.CategoryTheory.Limits.Shapes.Diagonal
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasPullbacks C] {X Y S X' Y' S' : C} (f : X βΆ S) (g : Y βΆ S) (f' : X' βΆ S') (g' : Y' βΆ S') (iβ : X βΆ X') (iβ : Y βΆ Y') (iβ : S βΆ S') (eβ : CategoryTheory.CategoryStruct.comp f iβ = CategoryTheory.CategoryStruct.comp iβ f') (eβ : CategoryTheory.CategoryStruct.comp g iβ = CategoryTheory.CategoryStruct.comp iβ g') [CategoryTheory.Mono iβ] : (CategoryTheory.Limits.pullbackFstFstIso f g f' g' iβ iβ iβ eβ eβ).inv = CategoryTheory.Limits.pullback.lift (CategoryTheory.Limits.pullback.lift (CategoryTheory.Limits.pullback.map f g f' g' iβ iβ iβ eβ eβ) (CategoryTheory.Limits.pullback.fst f g) β―) (CategoryTheory.Limits.pullback.lift (CategoryTheory.Limits.pullback.map f g f' g' iβ iβ iβ eβ eβ) (CategoryTheory.Limits.pullback.snd f g) β―) β― - CategoryTheory.Limits.pullbackFstFstIso_hom π Mathlib.CategoryTheory.Limits.Shapes.Diagonal
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasPullbacks C] {X Y S X' Y' S' : C} (f : X βΆ S) (g : Y βΆ S) (f' : X' βΆ S') (g' : Y' βΆ S') (iβ : X βΆ X') (iβ : Y βΆ Y') (iβ : S βΆ S') (eβ : CategoryTheory.CategoryStruct.comp f iβ = CategoryTheory.CategoryStruct.comp iβ f') (eβ : CategoryTheory.CategoryStruct.comp g iβ = CategoryTheory.CategoryStruct.comp iβ g') [CategoryTheory.Mono iβ] : (CategoryTheory.Limits.pullbackFstFstIso f g f' g' iβ iβ iβ eβ eβ).hom = CategoryTheory.Limits.pullback.lift (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (CategoryTheory.Limits.pullback.fst (CategoryTheory.Limits.pullback.fst f' g') iβ) (CategoryTheory.Limits.pullback.fst (CategoryTheory.Limits.pullback.snd f' g') iβ)) (CategoryTheory.Limits.pullback.snd (CategoryTheory.Limits.pullback.fst f' g') iβ)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.snd (CategoryTheory.Limits.pullback.fst (CategoryTheory.Limits.pullback.fst f' g') iβ) (CategoryTheory.Limits.pullback.fst (CategoryTheory.Limits.pullback.snd f' g') iβ)) (CategoryTheory.Limits.pullback.snd (CategoryTheory.Limits.pullback.snd f' g') iβ)) β― - CategoryTheory.MorphismProperty.baseChange_map' π Mathlib.CategoryTheory.MorphismProperty.Limits
{C : Type u} [CategoryTheory.Category.{v, u} C] {P : CategoryTheory.MorphismProperty C} [P.IsStableUnderBaseChange] {S S' X Y : C} (f : S' βΆ S) {vββ : X βΆ S} {vββ : Y βΆ S} {g : X βΆ Y} (hvββ : vββ = CategoryTheory.CategoryStruct.comp g vββ) [CategoryTheory.Limits.HasPullback vββ f] [CategoryTheory.Limits.HasPullback vββ f] (H : P g) : P (CategoryTheory.Limits.pullback.lift (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst vββ f) g) (CategoryTheory.Limits.pullback.snd vββ f) β―) - CategoryTheory.MorphismProperty.pullbackLift_fst_snd π Mathlib.CategoryTheory.MorphismProperty.Limits
{C : Type u} [CategoryTheory.Category.{v, u} C] {P : CategoryTheory.MorphismProperty C} [P.IsStableUnderBaseChange] {S S' X Y : C} (f : S' βΆ S) {vββ : X βΆ S} {vββ : Y βΆ S} {g : X βΆ Y} (hvββ : vββ = CategoryTheory.CategoryStruct.comp g vββ) [CategoryTheory.Limits.HasPullback vββ f] [CategoryTheory.Limits.HasPullback vββ f] (H : P g) : P (CategoryTheory.Limits.pullback.lift (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst vββ f) g) (CategoryTheory.Limits.pullback.snd vββ f) β―) - CategoryTheory.MonoOver.inf_map_app π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasPullbacks C] {A : C} {Xβ Yβ : CategoryTheory.MonoOver A} (k : Xβ βΆ Yβ) (g : CategoryTheory.MonoOver A) : (CategoryTheory.MonoOver.inf.map k).app g = CategoryTheory.MonoOver.homMk (CategoryTheory.Limits.pullback.lift (CategoryTheory.Limits.pullback.fst ((CategoryTheory.MonoOver.forget A).obj g).hom Xβ.arrow) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.snd ((CategoryTheory.MonoOver.forget A).obj g).hom Xβ.arrow) (CategoryTheory.Over.Hom.left k.hom)) β―) β― - CategoryTheory.ShortComplex.SnakeInput.lift_Οβ π Mathlib.Algebra.Homology.ShortComplex.SnakeLemma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] (S : CategoryTheory.ShortComplex.SnakeInput C) {A : C} (a : A βΆ S.Lβ.Xβ) (b : A βΆ S.Lβ.Xβ) (h : CategoryTheory.CategoryStruct.comp a S.Lβ.g = CategoryTheory.CategoryStruct.comp b S.vββ.Οβ) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.lift a b h) S.Οβ = CategoryTheory.CategoryStruct.comp a S.vββ.Οβ - CategoryTheory.ShortComplex.SnakeInput.lift_Οβ_assoc π Mathlib.Algebra.Homology.ShortComplex.SnakeLemma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] (S : CategoryTheory.ShortComplex.SnakeInput C) {A : C} (a : A βΆ S.Lβ.Xβ) (b : A βΆ S.Lβ.Xβ) (h : CategoryTheory.CategoryStruct.comp a S.Lβ.g = CategoryTheory.CategoryStruct.comp b S.vββ.Οβ) {Z : C} (hβ : S.Lβ.Xβ βΆ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.lift a b h) (CategoryTheory.CategoryStruct.comp S.Οβ hβ) = CategoryTheory.CategoryStruct.comp a (CategoryTheory.CategoryStruct.comp S.vββ.Οβ hβ) - CategoryTheory.PreZeroHypercover.interLift_hβ π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreZeroHypercover S} {F : CategoryTheory.PreZeroHypercover S} {G : CategoryTheory.PreZeroHypercover S} [β (i : E.Iβ) (j : F.Iβ), CategoryTheory.Limits.HasPullback (E.f i) (F.f j)] (f : G.Hom E) (g : G.Hom F) (i : G.Iβ) : (CategoryTheory.PreZeroHypercover.interLift f g).hβ i = CategoryTheory.Limits.pullback.lift (f.hβ i) (g.hβ i) β― - CategoryTheory.PreOneHypercover.sieveβ_eq_pullback_sieveβ' π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) {iβ iβ : E.Iβ} [CategoryTheory.Limits.HasPullback (E.f iβ) (E.f iβ)] {W : C} (pβ : W βΆ E.X iβ) (pβ : W βΆ E.X iβ) (w : CategoryTheory.CategoryStruct.comp pβ (E.f iβ) = CategoryTheory.CategoryStruct.comp pβ (E.f iβ)) : E.sieveβ pβ pβ = CategoryTheory.Sieve.pullback (CategoryTheory.Limits.pullback.lift pβ pβ w) (E.sieveβ' iβ iβ) - CategoryTheory.MorphismProperty.Over.mapPullbackAdj_unit_app π Mathlib.CategoryTheory.MorphismProperty.OverAdjunction
{T : Type u_1} [CategoryTheory.Category.{v_1, u_1} T] (P Q : CategoryTheory.MorphismProperty T) [Q.IsMultiplicative] {X Y : T} [P.IsStableUnderComposition] [Q.IsStableUnderBaseChange] (f : X βΆ Y) [P.HasPullbacksAlong f] [P.IsStableUnderBaseChangeAlong f] [Q.HasOfPostcompProperty Q] (hPf : P f) (hQf : Q f) (A : P.Over Q X) : (CategoryTheory.MorphismProperty.Over.mapPullbackAdj P Q f hPf hQf).unit.app A = CategoryTheory.MorphismProperty.Over.homMk (CategoryTheory.Limits.pullback.lift (CategoryTheory.CategoryStruct.id A.left) A.hom β―) β― β― - CategoryTheory.MorphismProperty.Over.pullback_map_left π Mathlib.CategoryTheory.MorphismProperty.OverAdjunction
{T : Type u_1} [CategoryTheory.Category.{v_1, u_1} T] (P Q : CategoryTheory.MorphismProperty T) [Q.IsMultiplicative] {X Y : T} (f : X βΆ Y) [P.HasPullbacksAlong f] [P.IsStableUnderBaseChangeAlong f] [Q.IsStableUnderBaseChange] {A B : P.Over Q Y} (g : A βΆ B) : ((CategoryTheory.MorphismProperty.Over.pullback P Q f).map g).left = CategoryTheory.Limits.pullback.lift (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst A.hom f) g.left) (CategoryTheory.Limits.pullback.snd A.hom f) β― - HomotopicalAlgebra.PrepathObject.trans_ΞΉ π Mathlib.AlgebraicTopology.ModelCategory.PathObject
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : C} (P P' : HomotopicalAlgebra.PrepathObject A) [CategoryTheory.Limits.HasPullback P.pβ P'.pβ] : (P.trans P').ΞΉ = CategoryTheory.Limits.pullback.lift P.ΞΉ P'.ΞΉ β― - HomotopicalAlgebra.PathObject.trans_ΞΉ π Mathlib.AlgebraicTopology.ModelCategory.PathObject
{C : Type u} [CategoryTheory.Category.{v, u} C] [HomotopicalAlgebra.ModelCategory C] {A : C} [HomotopicalAlgebra.IsFibrant A] (P P' : HomotopicalAlgebra.PathObject A) [P'.IsGood] : (P.trans P').ΞΉ = CategoryTheory.Limits.pullback.lift P.ΞΉ P'.ΞΉ β― - HomotopicalAlgebra.PrepathObject.RightHomotopy.trans_h π Mathlib.AlgebraicTopology.ModelCategory.RightHomotopy
{C : Type u} [CategoryTheory.Category.{v, u} C] {Y : C} {P : HomotopicalAlgebra.PrepathObject Y} {X : C} {fβ fβ fβ : X βΆ Y} (h : P.RightHomotopy fβ fβ) {P' : HomotopicalAlgebra.PrepathObject Y} (h' : P'.RightHomotopy fβ fβ) [CategoryTheory.Limits.HasPullback P.pβ P'.pβ] : (h.trans h').h = CategoryTheory.Limits.pullback.lift h.h h'.h β― - CategoryTheory.Over.lift_left π Mathlib.CategoryTheory.Monoidal.Cartesian.Over
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasPullbacks C] {X : C} {R S T : CategoryTheory.Over X} (f : R βΆ S) (g : R βΆ T) : CategoryTheory.Over.Hom.left (CategoryTheory.CartesianMonoidalCategory.lift f g) = CategoryTheory.Limits.pullback.lift (CategoryTheory.Over.Hom.left f) (CategoryTheory.Over.Hom.left g) β― - AlgebraicGeometry.Scheme.Pullback.lift_comp_ΞΉ π 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] (i : π°.Iβ) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.lift (CategoryTheory.Limits.pullback.snd (AlgebraicGeometry.Scheme.Pullback.p1 π° f g) (π°.f i)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (AlgebraicGeometry.Scheme.Pullback.p1 π° f g) (π°.f i)) (AlgebraicGeometry.Scheme.Pullback.p2 π° f g)) β―) ((AlgebraicGeometry.Scheme.Pullback.gluing π° f g).ΞΉ i) = CategoryTheory.Limits.pullback.fst (AlgebraicGeometry.Scheme.Pullback.p1 π° f g) (π°.f i) - AlgebraicGeometry.Scheme.IdealSheafData.glueData_t' π Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (i j k : βX.affineOpens) : I.glueData.t' i j k = CategoryTheory.Limits.pullback.lift (I.glueDataT'Aux (i, j).1 (i, j).2 (i, k).2 (j, k).2 β―) (I.glueDataT'Aux (i, j).1 (i, j).2 (i, k).2 (j, i).2 β―) β― - AlgebraicGeometry.IsSeparated.instIsClosedImmersionLiftSchemeId π Mathlib.AlgebraicGeometry.Morphisms.Separated
{X Y Z : AlgebraicGeometry.Scheme} (f : X βΆ Y) (g : Y βΆ Z) [AlgebraicGeometry.IsSeparated g] : AlgebraicGeometry.IsClosedImmersion (CategoryTheory.Limits.pullback.lift (CategoryTheory.CategoryStruct.id X) f β―) - AlgebraicGeometry.ExistsHomHomCompEqCompAux.exists_index π Mathlib.AlgebraicGeometry.AffineTransitionLimit
{I : Type u} [CategoryTheory.Category.{u, u} I] {S X : AlgebraicGeometry.Scheme} {D : CategoryTheory.Functor I AlgebraicGeometry.Scheme} {t : D βΆ (CategoryTheory.Functor.const I).obj S} {f : X βΆ S} [β (i : I), CompactSpace β₯(D.obj i)] [CategoryTheory.IsCofiltered I] [β {i j : I} (f : i βΆ j), AlgebraicGeometry.IsAffineHom (D.map f)] (A : AlgebraicGeometry.ExistsHomHomCompEqCompAux D t f) : β i' hii', β(CategoryTheory.CategoryStruct.comp (D.map hii') (CategoryTheory.Limits.pullback.lift A.a A.b β―)) β»ΒΉ' (β(AlgebraicGeometry.Scheme.Pullback.diagonalCoverDiagonalRange f A.π°S A.π°X))αΆ = β - AlgebraicGeometry.Scheme.Cover.exists_lift_trans_eq π Mathlib.AlgebraicGeometry.Cover.Directed
{P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} {X : AlgebraicGeometry.Scheme} (π° : AlgebraicGeometry.Scheme.Cover (AlgebraicGeometry.Scheme.precoverage P) X) [CategoryTheory.Category.{v_1, u_1} π°.Iβ] [π°.LocallyDirected] {i j : π°.Iβ} (x : β₯(CategoryTheory.Limits.pullback (π°.f i) (π°.f j))) : β k hki hkj y, (CategoryTheory.Limits.pullback.lift (π°.trans hki) (π°.trans hkj) β―) y = x - AlgebraicGeometry.Scheme.Cover.LocallyDirected.directed π Mathlib.AlgebraicGeometry.Cover.Directed
{P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} {X : AlgebraicGeometry.Scheme} {π° : AlgebraicGeometry.Scheme.Cover (AlgebraicGeometry.Scheme.precoverage P) X} {instβ : CategoryTheory.Category.{v_1, u_1} π°.Iβ} [self : π°.LocallyDirected] {i j : π°.Iβ} (x : β₯(CategoryTheory.Limits.pullback (π°.f i) (π°.f j))) : β k hki hkj y, (CategoryTheory.Limits.pullback.lift (AlgebraicGeometry.Scheme.Cover.LocallyDirected.trans hki) (AlgebraicGeometry.Scheme.Cover.LocallyDirected.trans hkj) β―) y = x - AlgebraicGeometry.Scheme.Cover.intersectionOfLocallyDirected_f π Mathlib.AlgebraicGeometry.Cover.Directed
{P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} {X : AlgebraicGeometry.Scheme} (π° : AlgebraicGeometry.Scheme.Cover (AlgebraicGeometry.Scheme.precoverage P) X) [CategoryTheory.Category.{v_1, u_1} π°.Iβ] [π°.LocallyDirected] [P.IsStableUnderBaseChange] [P.HasOfPostcompProperty P] (i j : π°.Iβ) (k : (k : π°.Iβ) Γ (k βΆ i) Γ (k βΆ j)) : (π°.intersectionOfLocallyDirected i j).f k = CategoryTheory.Limits.pullback.lift (π°.trans k.snd.1) (π°.trans k.snd.2) β― - AlgebraicGeometry.Scheme.Cover.LocallyDirected.mk π Mathlib.AlgebraicGeometry.Cover.Directed
{P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} {X : AlgebraicGeometry.Scheme} {π° : AlgebraicGeometry.Scheme.Cover (AlgebraicGeometry.Scheme.precoverage P) X} [CategoryTheory.Category.{v_1, u_1} π°.Iβ] (trans : {i j : π°.Iβ} β (i βΆ j) β (π°.X i βΆ π°.X j)) (trans_id : β (i : π°.Iβ), trans (CategoryTheory.CategoryStruct.id i) = CategoryTheory.CategoryStruct.id (π°.X i) := by cat_disch) (trans_comp : β {i j k : π°.Iβ} (hij : i βΆ j) (hjk : j βΆ k), trans (CategoryTheory.CategoryStruct.comp hij hjk) = CategoryTheory.CategoryStruct.comp (trans hij) (trans hjk) := by cat_disch) (w : β {i j : π°.Iβ} (hij : i βΆ j), CategoryTheory.CategoryStruct.comp (trans hij) (π°.f j) = π°.f i := by cat_disch) (directed : β {i j : π°.Iβ} (x : β₯(CategoryTheory.Limits.pullback (π°.f i) (π°.f j))), β k hki hkj y, (CategoryTheory.Limits.pullback.lift (trans hki) (trans hkj) β―) y = x) (property_trans : β {i j : π°.Iβ} (hij : i βΆ j), P (trans hij) := by infer_instance) : π°.LocallyDirected - CategoryTheory.Functor.relativelyRepresentable.toPullbackTerminal π Mathlib.CategoryTheory.MorphismProperty.Representable
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {F : CategoryTheory.Functor C D} [CategoryTheory.Limits.HasBinaryProducts C] [CategoryTheory.Limits.HasPullbacks D] [CategoryTheory.Limits.HasBinaryProducts D] [CategoryTheory.Limits.HasTerminal D] [F.Full] [CategoryTheory.Limits.PreservesLimitsOfShape (CategoryTheory.Discrete CategoryTheory.Limits.WalkingPair) F] {X : D} {a : C} [CategoryTheory.Limits.HasPullbacks C] [CategoryTheory.Limits.PreservesLimitsOfShape CategoryTheory.Limits.WalkingCospan F] (g : F.obj a βΆ CategoryTheory.Limits.pullback (CategoryTheory.Limits.terminal.from X) (CategoryTheory.Limits.terminal.from X)) : F.relativelyRepresentable (CategoryTheory.Limits.pullback.lift (CategoryTheory.CategoryStruct.id (F.obj a)) (CategoryTheory.CategoryStruct.id (F.obj a)) β―) - CategoryTheory.Functor.PullbackObjObj.ofHasPullback_Ο π Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackObjObj
{Cβ : Type uβ} {Cβ : Type uβ} {Cβ : Type uβ} [CategoryTheory.Category.{vβ, uβ} Cβ] [CategoryTheory.Category.{vβ, uβ} Cβ] [CategoryTheory.Category.{vβ, uβ} Cβ] (G : CategoryTheory.Functor Cβα΅α΅ (CategoryTheory.Functor Cβ Cβ)) {Xβ Yβ : Cβ} (fβ : Xβ βΆ Yβ) {Xβ Yβ : Cβ} (fβ : Xβ βΆ Yβ) [CategoryTheory.Limits.HasPullback ((G.obj (Opposite.op Xβ)).map fβ) ((G.map fβ.op).app Yβ)] : (CategoryTheory.Functor.PullbackObjObj.ofHasPullback G fβ fβ).Ο = CategoryTheory.Limits.pullback.lift ((G.map fβ.op).app Xβ) ((G.obj (Opposite.op Yβ)).map fβ) β― - CategoryTheory.Functor.LeibnizAdjunction.adj_unit_app_right π Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackObjObj
{Cβ : Type uβ} {Cβ : Type uβ} {Cβ : Type uβ} [CategoryTheory.Category.{vβ, uβ} Cβ] [CategoryTheory.Category.{vβ, uβ} Cβ] [CategoryTheory.Category.{vβ, uβ} Cβ] (F : CategoryTheory.Functor Cβ (CategoryTheory.Functor Cβ Cβ)) (G : CategoryTheory.Functor Cβα΅α΅ (CategoryTheory.Functor Cβ Cβ)) (adjβ : F β£β G) (Xβ : CategoryTheory.Arrow Cβ) [CategoryTheory.Limits.HasPullbacks Cβ] [CategoryTheory.Limits.HasPushouts Cβ] (Xβ : CategoryTheory.Arrow Cβ) : ((CategoryTheory.Functor.LeibnizAdjunction.adj F G adjβ Xβ).unit.app Xβ).right = CategoryTheory.Limits.pullback.lift (adjβ.homEquiv (CategoryTheory.Limits.pushout.inr ((F.map Xβ.hom).app Xβ.left) ((F.obj Xβ.left).map Xβ.hom))) (adjβ.homEquiv (CategoryTheory.CategoryStruct.id ((F.obj Xβ.right).obj Xβ.right))) β― - CategoryTheory.Functor.LeibnizAdjunction.adj_counit_app_left π Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackObjObj
{Cβ : Type uβ} {Cβ : Type uβ} {Cβ : Type uβ} [CategoryTheory.Category.{vβ, uβ} Cβ] [CategoryTheory.Category.{vβ, uβ} Cβ] [CategoryTheory.Category.{vβ, uβ} Cβ] (F : CategoryTheory.Functor Cβ (CategoryTheory.Functor Cβ Cβ)) (G : CategoryTheory.Functor Cβα΅α΅ (CategoryTheory.Functor Cβ Cβ)) (adjβ : F β£β G) (Xβ : CategoryTheory.Arrow Cβ) [CategoryTheory.Limits.HasPullbacks Cβ] [CategoryTheory.Limits.HasPushouts Cβ] (Xβ : CategoryTheory.Arrow Cβ) : ((CategoryTheory.Functor.LeibnizAdjunction.adj F G adjβ Xβ).counit.app Xβ).left = CategoryTheory.Limits.pushout.desc (adjβ.homEquiv.symm (CategoryTheory.CategoryStruct.id ((G.obj (Opposite.op Xβ.right)).obj Xβ.left))) (adjβ.homEquiv.symm (CategoryTheory.Limits.pullback.fst ((G.obj (Opposite.op Xβ.left)).map Xβ.hom) ((G.map Xβ.hom.op).app Xβ.right))) β― - CategoryTheory.PreOneHypercover.sieveβ_cylinder π Mathlib.CategoryTheory.Sites.Hypercover.Homotopy
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} [CategoryTheory.Limits.HasPullbacks C] (f g : E.Hom F) : (CategoryTheory.PreOneHypercover.cylinder f g).sieveβ = CategoryTheory.Sieve.generate (CategoryTheory.Presieve.bindOfArrows E.X E.f fun i => (CategoryTheory.Sieve.pullback (CategoryTheory.Limits.pullback.lift (f.hβ i) (g.hβ i) β―) (F.sieveβ' (f.sβ i) (g.sβ i))).arrows) - CategoryTheory.PreOneHypercover.cylinderHom_hβ π Mathlib.CategoryTheory.Sites.Hypercover.Homotopy
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} [CategoryTheory.Limits.HasPullbacks C] (f g : E.Hom F) (p : (CategoryTheory.PreOneHypercover.cylinder f g).Iβ) : (CategoryTheory.PreOneHypercover.cylinderHom f g).hβ p = CategoryTheory.Limits.pullback.fst (CategoryTheory.Limits.pullback.lift (f.hβ p.fst) (g.hβ p.fst) β―) (F.toPullback p.snd) - CategoryTheory.PreOneHypercover.cylinder_Y π Mathlib.CategoryTheory.Sites.Hypercover.Homotopy
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} [CategoryTheory.Limits.HasPullbacks C] (f g : E.Hom F) {p q : (i : E.Iβ) Γ F.Iβ (f.sβ i) (g.sβ i)} (k : ULift.{max w w', w} (E.Iβ p.fst q.fst)) : (CategoryTheory.PreOneHypercover.cylinder f g).Y k = CategoryTheory.Limits.pullback (CategoryTheory.Limits.pullback.map (CategoryTheory.PreOneHypercover.cylinderf f g p.snd) (CategoryTheory.PreOneHypercover.cylinderf f g q.snd) (E.f p.fst) (E.f q.fst) (CategoryTheory.Limits.pullback.fst (CategoryTheory.Limits.pullback.lift (f.hβ p.fst) (g.hβ p.fst) β―) (F.toPullback p.snd)) (CategoryTheory.Limits.pullback.fst (CategoryTheory.Limits.pullback.lift (f.hβ q.fst) (g.hβ q.fst) β―) (F.toPullback q.snd)) (CategoryTheory.CategoryStruct.id S) β― β―) (CategoryTheory.Limits.pullback.lift (E.pβ k.down) (E.pβ k.down) β―) - CategoryTheory.PreOneHypercover.toPullback_cylinder π Mathlib.CategoryTheory.Sites.Hypercover.Homotopy
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} [CategoryTheory.Limits.HasPullbacks C] (f g : E.Hom F) {i j : (CategoryTheory.PreOneHypercover.cylinder f g).Iβ} (k : (CategoryTheory.PreOneHypercover.cylinder f g).Iβ i j) : (CategoryTheory.PreOneHypercover.cylinder f g).toPullback k = CategoryTheory.Limits.pullback.fst (CategoryTheory.Limits.pullback.map (CategoryTheory.PreOneHypercover.cylinderf f g i.snd) (CategoryTheory.PreOneHypercover.cylinderf f g j.snd) (E.f i.fst) (E.f j.fst) (CategoryTheory.Limits.pullback.fst (CategoryTheory.Limits.pullback.lift (f.hβ i.fst) (g.hβ i.fst) β―) (F.toPullback i.snd)) (CategoryTheory.Limits.pullback.fst (CategoryTheory.Limits.pullback.lift (f.hβ j.fst) (g.hβ j.fst) β―) (F.toPullback j.snd)) (CategoryTheory.CategoryStruct.id S) β― β―) (CategoryTheory.Limits.pullback.lift (E.pβ k.down) (E.pβ k.down) β―) - CategoryTheory.PreOneHypercover.cylinderHom_hβ π Mathlib.CategoryTheory.Sites.Hypercover.Homotopy
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} [CategoryTheory.Limits.HasPullbacks C] (f g : E.Hom F) {p q : (CategoryTheory.PreOneHypercover.cylinder f g).Iβ} (k : (CategoryTheory.PreOneHypercover.cylinder f g).Iβ p q) : (CategoryTheory.PreOneHypercover.cylinderHom f g).hβ k = CategoryTheory.Limits.pullback.snd (CategoryTheory.Limits.pullback.map (CategoryTheory.PreOneHypercover.cylinderf f g p.snd) (CategoryTheory.PreOneHypercover.cylinderf f g q.snd) (E.f p.fst) (E.f q.fst) (CategoryTheory.Limits.pullback.fst (CategoryTheory.Limits.pullback.lift (f.hβ p.fst) (g.hβ p.fst) β―) (F.toPullback p.snd)) (CategoryTheory.Limits.pullback.fst (CategoryTheory.Limits.pullback.lift (f.hβ q.fst) (g.hβ q.fst) β―) (F.toPullback q.snd)) (CategoryTheory.CategoryStruct.id S) β― β―) (CategoryTheory.Limits.pullback.lift (E.pβ k.down) (E.pβ k.down) β―) - CategoryTheory.PreOneHypercover.sieveβ'_cylinder π Mathlib.CategoryTheory.Sites.Hypercover.Homotopy
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} [CategoryTheory.Limits.HasPullbacks C] (f g : E.Hom F) (i j : (i : E.Iβ) Γ F.Iβ (f.sβ i) (g.sβ i)) : (CategoryTheory.PreOneHypercover.cylinder f g).sieveβ' i j = CategoryTheory.Sieve.pullback (CategoryTheory.Limits.pullback.map ((CategoryTheory.PreOneHypercover.cylinder f g).f i) ((CategoryTheory.PreOneHypercover.cylinder f g).f j) (E.f i.fst) (E.f j.fst) (CategoryTheory.Limits.pullback.fst (CategoryTheory.Limits.pullback.lift (f.hβ i.fst) (g.hβ i.fst) β―) (F.toPullback i.snd)) (CategoryTheory.Limits.pullback.fst (CategoryTheory.Limits.pullback.lift (f.hβ j.fst) (g.hβ j.fst) β―) (F.toPullback j.snd)) (CategoryTheory.CategoryStruct.id S) β― β―) (E.sieveβ' i.fst j.fst) - CategoryTheory.PreOneHypercover.cylinder_pβ π Mathlib.CategoryTheory.Sites.Hypercover.Homotopy
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} [CategoryTheory.Limits.HasPullbacks C] (f g : E.Hom F) {p q : (i : E.Iβ) Γ F.Iβ (f.sβ i) (g.sβ i)} (k : ULift.{max w w', w} (E.Iβ p.fst q.fst)) : (CategoryTheory.PreOneHypercover.cylinder f g).pβ k = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (CategoryTheory.Limits.pullback.map (CategoryTheory.PreOneHypercover.cylinderf f g p.snd) (CategoryTheory.PreOneHypercover.cylinderf f g q.snd) (E.f p.fst) (E.f q.fst) (CategoryTheory.Limits.pullback.fst (CategoryTheory.Limits.pullback.lift (f.hβ p.fst) (g.hβ p.fst) β―) (F.toPullback p.snd)) (CategoryTheory.Limits.pullback.fst (CategoryTheory.Limits.pullback.lift (f.hβ q.fst) (g.hβ q.fst) β―) (F.toPullback q.snd)) (CategoryTheory.CategoryStruct.id S) β― β―) (CategoryTheory.Limits.pullback.lift (E.pβ k.down) (E.pβ k.down) β―)) (CategoryTheory.Limits.pullback.fst (CategoryTheory.PreOneHypercover.cylinderf f g p.snd) (CategoryTheory.PreOneHypercover.cylinderf f g q.snd)) - CategoryTheory.PreOneHypercover.cylinder_pβ π Mathlib.CategoryTheory.Sites.Hypercover.Homotopy
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} [CategoryTheory.Limits.HasPullbacks C] (f g : E.Hom F) {p q : (i : E.Iβ) Γ F.Iβ (f.sβ i) (g.sβ i)} (k : ULift.{max w w', w} (E.Iβ p.fst q.fst)) : (CategoryTheory.PreOneHypercover.cylinder f g).pβ k = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (CategoryTheory.Limits.pullback.map (CategoryTheory.PreOneHypercover.cylinderf f g p.snd) (CategoryTheory.PreOneHypercover.cylinderf f g q.snd) (E.f p.fst) (E.f q.fst) (CategoryTheory.Limits.pullback.fst (CategoryTheory.Limits.pullback.lift (f.hβ p.fst) (g.hβ p.fst) β―) (F.toPullback p.snd)) (CategoryTheory.Limits.pullback.fst (CategoryTheory.Limits.pullback.lift (f.hβ q.fst) (g.hβ q.fst) β―) (F.toPullback q.snd)) (CategoryTheory.CategoryStruct.id S) β― β―) (CategoryTheory.Limits.pullback.lift (E.pβ k.down) (E.pβ k.down) β―)) (CategoryTheory.Limits.pullback.snd (CategoryTheory.PreOneHypercover.cylinderf f g p.snd) (CategoryTheory.PreOneHypercover.cylinderf f g q.snd)) - CategoryTheory.PreZeroHypercover.fromSaturateOfHasPullbacks_hβ π Mathlib.CategoryTheory.Sites.Hypercover.Saturate
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {S : C} (E : CategoryTheory.PreZeroHypercover S) [E.HasPullbacks] {i j : E.saturate.Iβ} (k : E.saturate.Iβ i j) : E.fromSaturateOfHasPullbacks.hβ k = CategoryTheory.Limits.pullback.lift k.fst k.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