Loogle!
Result
Found 68 declarations mentioning CategoryTheory.HasLiftingProperty.
- CategoryTheory.HasLiftingProperty 📋 Mathlib.CategoryTheory.LiftingProperties.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {A B X Y : C} (i : A ⟶ B) (p : X ⟶ Y) : Prop - CategoryTheory.HasLiftingProperty.of_left_iso 📋 Mathlib.CategoryTheory.LiftingProperties.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {A B X Y : C} (i : A ⟶ B) (p : X ⟶ Y) [CategoryTheory.IsIso i] : CategoryTheory.HasLiftingProperty i p - CategoryTheory.HasLiftingProperty.of_right_iso 📋 Mathlib.CategoryTheory.LiftingProperties.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Y X B A : C} (p : X ⟶ Y) (i : A ⟶ B) [CategoryTheory.IsIso p] : CategoryTheory.HasLiftingProperty i p - CategoryTheory.RetractArrow.leftLiftingProperty 📋 Mathlib.CategoryTheory.LiftingProperties.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {B A Z W B' A' : C} {f : A ⟶ B} {f' : A' ⟶ B'} (h : CategoryTheory.RetractArrow f' f) (g : W ⟶ Z) [CategoryTheory.HasLiftingProperty f g] : CategoryTheory.HasLiftingProperty f' g - CategoryTheory.RetractArrow.rightLiftingProperty 📋 Mathlib.CategoryTheory.LiftingProperties.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X Y Z W X' Y' : C} {f : X ⟶ Y} {f' : X' ⟶ Y'} (h : CategoryTheory.RetractArrow f' f) (g : Z ⟶ W) [CategoryTheory.HasLiftingProperty g f] : CategoryTheory.HasLiftingProperty g f' - CategoryTheory.Arrow.hasLiftingProperty_iff 📋 Mathlib.CategoryTheory.LiftingProperties.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {A B X Y : C} (i : A ⟶ B) (p : X ⟶ Y) : CategoryTheory.HasLiftingProperty i p ↔ ∀ (φ : CategoryTheory.Arrow.mk i ⟶ CategoryTheory.Arrow.mk p), Nonempty (CategoryTheory.Arrow.LiftStruct φ) - CategoryTheory.HasLiftingProperty.of_comp_left 📋 Mathlib.CategoryTheory.LiftingProperties.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {A B B' X Y : C} (i : A ⟶ B) (i' : B ⟶ B') (p : X ⟶ Y) [CategoryTheory.HasLiftingProperty i p] [CategoryTheory.HasLiftingProperty i' p] : CategoryTheory.HasLiftingProperty (CategoryTheory.CategoryStruct.comp i i') p - CategoryTheory.HasLiftingProperty.of_comp_right 📋 Mathlib.CategoryTheory.LiftingProperties.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Y X X' B A : C} (p : X ⟶ Y) (p' : X' ⟶ X) (i : A ⟶ B) [CategoryTheory.HasLiftingProperty i p] [CategoryTheory.HasLiftingProperty i p'] : CategoryTheory.HasLiftingProperty i (CategoryTheory.CategoryStruct.comp p' p) - CategoryTheory.HasLiftingProperty.op 📋 Mathlib.CategoryTheory.LiftingProperties.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {A B X Y : C} {i : A ⟶ B} {p : X ⟶ Y} (h : CategoryTheory.HasLiftingProperty i p) : CategoryTheory.HasLiftingProperty p.op i.op - CategoryTheory.HasLiftingProperty.iff_op 📋 Mathlib.CategoryTheory.LiftingProperties.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {A B X Y : C} {i : A ⟶ B} {p : X ⟶ Y} : CategoryTheory.HasLiftingProperty i p ↔ CategoryTheory.HasLiftingProperty p.op i.op - CategoryTheory.HasLiftingProperty.of_arrow_iso_left 📋 Mathlib.CategoryTheory.LiftingProperties.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {A B A' B' X Y : C} {i : A ⟶ B} {i' : A' ⟶ B'} (e : CategoryTheory.Arrow.mk i ≅ CategoryTheory.Arrow.mk i') (p : X ⟶ Y) [hip : CategoryTheory.HasLiftingProperty i p] : CategoryTheory.HasLiftingProperty i' p - CategoryTheory.HasLiftingProperty.of_arrow_iso_right 📋 Mathlib.CategoryTheory.LiftingProperties.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Y X Y' X' B A : C} (i : A ⟶ B) {p : X ⟶ Y} {p' : X' ⟶ Y'} (e : CategoryTheory.Arrow.mk p ≅ CategoryTheory.Arrow.mk p') [hip : CategoryTheory.HasLiftingProperty i p] : CategoryTheory.HasLiftingProperty i p' - CategoryTheory.HasLiftingProperty.iff_of_arrow_iso_left 📋 Mathlib.CategoryTheory.LiftingProperties.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {A B A' B' X Y : C} {i : A ⟶ B} {i' : A' ⟶ B'} (e : CategoryTheory.Arrow.mk i ≅ CategoryTheory.Arrow.mk i') (p : X ⟶ Y) : CategoryTheory.HasLiftingProperty i p ↔ CategoryTheory.HasLiftingProperty i' p - CategoryTheory.HasLiftingProperty.iff_of_arrow_iso_right 📋 Mathlib.CategoryTheory.LiftingProperties.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Y X Y' X' B A : C} (i : A ⟶ B) {p : X ⟶ Y} {p' : X' ⟶ Y'} (e : CategoryTheory.Arrow.mk p ≅ CategoryTheory.Arrow.mk p') : CategoryTheory.HasLiftingProperty i p ↔ CategoryTheory.HasLiftingProperty i p' - CategoryTheory.sq_hasLift_of_hasLiftingProperty 📋 Mathlib.CategoryTheory.LiftingProperties.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {A B X Y : C} (i : A ⟶ B) (p : X ⟶ Y) {f : A ⟶ X} {g : B ⟶ Y} (sq : CategoryTheory.CommSq f i p g) [hip : CategoryTheory.HasLiftingProperty i p] : sq.HasLift - CategoryTheory.HasLiftingProperty.mk 📋 Mathlib.CategoryTheory.LiftingProperties.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {A B X Y : C} {i : A ⟶ B} {p : X ⟶ Y} (sq_hasLift : ∀ {f : A ⟶ X} {g : B ⟶ Y} (sq : CategoryTheory.CommSq f i p g), sq.HasLift) : CategoryTheory.HasLiftingProperty i p - CategoryTheory.HasLiftingProperty.sq_hasLift 📋 Mathlib.CategoryTheory.LiftingProperties.Basic
{C : Type u_1} {inst✝ : CategoryTheory.Category.{v_1, u_1} C} {A B X Y : C} {i : A ⟶ B} {p : X ⟶ Y} [self : CategoryTheory.HasLiftingProperty i p] {f : A ⟶ X} {g : B ⟶ Y} (sq : CategoryTheory.CommSq f i p g) : sq.HasLift - CategoryTheory.HasLiftingProperty.unop 📋 Mathlib.CategoryTheory.LiftingProperties.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {A B X Y : Cᵒᵖ} {i : A ⟶ B} {p : X ⟶ Y} (h : CategoryTheory.HasLiftingProperty i p) : CategoryTheory.HasLiftingProperty p.unop i.unop - CategoryTheory.HasLiftingProperty.iff_unop 📋 Mathlib.CategoryTheory.LiftingProperties.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {A B X Y : Cᵒᵖ} (i : A ⟶ B) (p : X ⟶ Y) : CategoryTheory.HasLiftingProperty i p ↔ CategoryTheory.HasLiftingProperty p.unop i.unop - CategoryTheory.StrongEpi.llp 📋 Mathlib.CategoryTheory.Limits.Shapes.StrongEpi
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} {P Q : C} {f : P ⟶ Q} [self : CategoryTheory.StrongEpi f] ⦃X Y : C⦄ (z : X ⟶ Y) [CategoryTheory.Mono z] : CategoryTheory.HasLiftingProperty f z - CategoryTheory.StrongMono.rlp 📋 Mathlib.CategoryTheory.Limits.Shapes.StrongEpi
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} {P Q : C} {f : P ⟶ Q} [self : CategoryTheory.StrongMono f] ⦃X Y : C⦄ (z : X ⟶ Y) [CategoryTheory.Epi z] : CategoryTheory.HasLiftingProperty z f - CategoryTheory.StrongEpi.mk 📋 Mathlib.CategoryTheory.Limits.Shapes.StrongEpi
{C : Type u} [CategoryTheory.Category.{v, u} C] {P Q : C} {f : P ⟶ Q} (epi : CategoryTheory.Epi f) (llp : ∀ ⦃X Y : C⦄ (z : X ⟶ Y) [CategoryTheory.Mono z], CategoryTheory.HasLiftingProperty f z) : CategoryTheory.StrongEpi f - CategoryTheory.StrongMono.mk 📋 Mathlib.CategoryTheory.Limits.Shapes.StrongEpi
{C : Type u} [CategoryTheory.Category.{v, u} C] {P Q : C} {f : P ⟶ Q} (mono : CategoryTheory.Mono f) (rlp : ∀ ⦃X Y : C⦄ (z : X ⟶ Y) [CategoryTheory.Epi z], CategoryTheory.HasLiftingProperty z f) : CategoryTheory.StrongMono f - CategoryTheory.Adjunction.hasLiftingProperty_iff 📋 Mathlib.CategoryTheory.LiftingProperties.Adjunction
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {G : CategoryTheory.Functor C D} {F : CategoryTheory.Functor D C} (adj : G ⊣ F) {A B : C} {X Y : D} (i : A ⟶ B) (p : X ⟶ Y) : CategoryTheory.HasLiftingProperty (G.map i) p ↔ CategoryTheory.HasLiftingProperty i (F.map p) - CategoryTheory.instHasLiftingPropertyFst 📋 Mathlib.CategoryTheory.LiftingProperties.Limits
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Y Z W : C} {g : Z ⟶ W} {t : Y ⟶ W} [CategoryTheory.Limits.HasPullback g t] {T₁ T₂ : C} (p : T₁ ⟶ T₂) [CategoryTheory.HasLiftingProperty p t] : CategoryTheory.HasLiftingProperty p (CategoryTheory.Limits.pullback.fst g t) - CategoryTheory.instHasLiftingPropertyInl 📋 Mathlib.CategoryTheory.LiftingProperties.Limits
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X Y Z : C} {f : X ⟶ Y} {s : X ⟶ Z} [CategoryTheory.Limits.HasPushout s f] {T₁ T₂ : C} (p : T₁ ⟶ T₂) [CategoryTheory.HasLiftingProperty f p] : CategoryTheory.HasLiftingProperty (CategoryTheory.Limits.pushout.inl s f) p - CategoryTheory.instHasLiftingPropertyInr 📋 Mathlib.CategoryTheory.LiftingProperties.Limits
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X Y Z : C} {f : X ⟶ Y} {s : X ⟶ Z} [CategoryTheory.Limits.HasPushout s f] {T₁ T₂ : C} (p : T₁ ⟶ T₂) [CategoryTheory.HasLiftingProperty s p] : CategoryTheory.HasLiftingProperty (CategoryTheory.Limits.pushout.inr s f) p - CategoryTheory.instHasLiftingPropertySnd 📋 Mathlib.CategoryTheory.LiftingProperties.Limits
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Y Z W : C} {g : Z ⟶ W} {t : Y ⟶ W} [CategoryTheory.Limits.HasPullback g t] {T₁ T₂ : C} (p : T₁ ⟶ T₂) [CategoryTheory.HasLiftingProperty p g] : CategoryTheory.HasLiftingProperty p (CategoryTheory.Limits.pullback.snd g t) - CategoryTheory.instHasLiftingPropertyMap 📋 Mathlib.CategoryTheory.LiftingProperties.Limits
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u_2} {A B : J → C} [CategoryTheory.Limits.HasProduct A] [CategoryTheory.Limits.HasProduct B] (f : (j : J) → A j ⟶ B j) {X Y : C} (p : X ⟶ Y) [∀ (j : J), CategoryTheory.HasLiftingProperty p (f j)] : CategoryTheory.HasLiftingProperty p (CategoryTheory.Limits.Pi.map f) - CategoryTheory.instHasLiftingPropertyMap_1 📋 Mathlib.CategoryTheory.LiftingProperties.Limits
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u_2} {A B : J → C} [CategoryTheory.Limits.HasCoproduct A] [CategoryTheory.Limits.HasCoproduct B] (f : (j : J) → A j ⟶ B j) {X Y : C} (p : X ⟶ Y) [∀ (j : J), CategoryTheory.HasLiftingProperty (f j) p] : CategoryTheory.HasLiftingProperty (CategoryTheory.Limits.Sigma.map f) p - CategoryTheory.IsPullback.hasLiftingProperty 📋 Mathlib.CategoryTheory.LiftingProperties.Limits
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X Y Z W : C} {f : X ⟶ Y} {s : X ⟶ Z} {g : Z ⟶ W} {t : Y ⟶ W} (h : CategoryTheory.IsPullback s f g t) {X' Y' : C} (f' : X' ⟶ Y') [CategoryTheory.HasLiftingProperty f' g] : CategoryTheory.HasLiftingProperty f' f - CategoryTheory.IsPushout.hasLiftingProperty 📋 Mathlib.CategoryTheory.LiftingProperties.Limits
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X Y Z W : C} {f : X ⟶ Y} {s : X ⟶ Z} {g : Z ⟶ W} {t : Y ⟶ W} (h : CategoryTheory.IsPushout s f g t) {Z' W' : C} (g' : Z' ⟶ W') [CategoryTheory.HasLiftingProperty f g'] : CategoryTheory.HasLiftingProperty g g' - CategoryTheory.MorphismProperty.llp_ofHoms_iff_hasLiftingProperty 📋 Mathlib.CategoryTheory.MorphismProperty.LiftingProperty
{C : Type u} [CategoryTheory.Category.{v, u} C] (ι : Type u_1) [Nonempty ι] {A B X Y : C} (i : A ⟶ B) (p : X ⟶ Y) : (CategoryTheory.MorphismProperty.ofHoms fun x => p).llp i ↔ CategoryTheory.HasLiftingProperty i p - CategoryTheory.MorphismProperty.rlp_ofHoms_iff_hasLiftingProperty 📋 Mathlib.CategoryTheory.MorphismProperty.LiftingProperty
{C : Type u} [CategoryTheory.Category.{v, u} C] (ι : Type u_1) [Nonempty ι] {A B X Y : C} (i : A ⟶ B) (p : X ⟶ Y) : (CategoryTheory.MorphismProperty.ofHoms fun x => i).rlp p ↔ CategoryTheory.HasLiftingProperty i p - CategoryTheory.Functor.hasLiftingProperty_iff_of_isEquivalence 📋 Mathlib.CategoryTheory.MorphismProperty.LiftingProperty
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u_1} [CategoryTheory.Category.{v_1, u_1} D] (G : CategoryTheory.Functor C D) [G.IsEquivalence] {A B X Y : C} (i : A ⟶ B) (p : X ⟶ Y) : CategoryTheory.HasLiftingProperty (G.map i) (G.map p) ↔ CategoryTheory.HasLiftingProperty i p - CategoryTheory.RetractArrow.ofLeftLiftingProperty 📋 Mathlib.CategoryTheory.MorphismProperty.RetractArgument
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X Y Z : C} {f : X ⟶ Z} {i : X ⟶ Y} {p : Y ⟶ Z} (h : CategoryTheory.CategoryStruct.comp i p = f) [CategoryTheory.HasLiftingProperty f p] : CategoryTheory.RetractArrow f i - CategoryTheory.RetractArrow.ofRightLiftingProperty 📋 Mathlib.CategoryTheory.MorphismProperty.RetractArgument
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X Y Z : C} {f : X ⟶ Z} {i : X ⟶ Y} {p : Y ⟶ Z} (h : CategoryTheory.CategoryStruct.comp i p = f) [CategoryTheory.HasLiftingProperty i f] : CategoryTheory.RetractArrow f p - CategoryTheory.MorphismProperty.hasLiftingProperty_of_wfs 📋 Mathlib.CategoryTheory.MorphismProperty.WeakFactorizationSystem
{C : Type u} [CategoryTheory.Category.{v, u} C] {W₁ W₂ : CategoryTheory.MorphismProperty C} [W₁.IsWeakFactorizationSystem W₂] {A B X Y : C} (i : A ⟶ B) (p : X ⟶ Y) (hi : W₁ i) (hp : W₂ p) : CategoryTheory.HasLiftingProperty i p - CategoryTheory.MorphismProperty.IsWeakFactorizationSystem.mk' 📋 Mathlib.CategoryTheory.MorphismProperty.WeakFactorizationSystem
{C : Type u} [CategoryTheory.Category.{v, u} C] (W₁ W₂ : CategoryTheory.MorphismProperty C) [W₁.HasFactorization W₂] [W₁.IsStableUnderRetracts] [W₂.IsStableUnderRetracts] (h : ∀ {A B X Y : C} (i : A ⟶ B) (p : X ⟶ Y), W₁ i → W₂ p → CategoryTheory.HasLiftingProperty i p) : W₁.IsWeakFactorizationSystem W₂ - HomotopicalAlgebra.ModelCategory.cm4a 📋 Mathlib.AlgebraicTopology.ModelCategory.Basic
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} [self : HomotopicalAlgebra.ModelCategory C] {A B X Y : C} (i : A ⟶ B) (p : X ⟶ Y) [HomotopicalAlgebra.Cofibration i] [HomotopicalAlgebra.WeakEquivalence i] [HomotopicalAlgebra.Fibration p] : CategoryTheory.HasLiftingProperty i p - HomotopicalAlgebra.ModelCategory.cm4b 📋 Mathlib.AlgebraicTopology.ModelCategory.Basic
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} [self : HomotopicalAlgebra.ModelCategory C] {A B X Y : C} (i : A ⟶ B) (p : X ⟶ Y) [HomotopicalAlgebra.Cofibration i] [HomotopicalAlgebra.Fibration p] [HomotopicalAlgebra.WeakEquivalence p] : CategoryTheory.HasLiftingProperty i p - HomotopicalAlgebra.ModelCategory.mk 📋 Mathlib.AlgebraicTopology.ModelCategory.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (categoryWithFibrations : HomotopicalAlgebra.CategoryWithFibrations C := by infer_instance) (categoryWithCofibrations : HomotopicalAlgebra.CategoryWithCofibrations C := by infer_instance) (categoryWithWeakEquivalences : HomotopicalAlgebra.CategoryWithWeakEquivalences C := by infer_instance) (cm1a : CategoryTheory.Limits.HasFiniteLimits C := by infer_instance) (cm1b : CategoryTheory.Limits.HasFiniteColimits C := by infer_instance) (cm2 : (HomotopicalAlgebra.weakEquivalences C).HasTwoOutOfThreeProperty := by infer_instance) (cm3a : (HomotopicalAlgebra.weakEquivalences C).IsStableUnderRetracts := by infer_instance) (cm3b : (HomotopicalAlgebra.fibrations C).IsStableUnderRetracts := by infer_instance) (cm3c : (HomotopicalAlgebra.cofibrations C).IsStableUnderRetracts := by infer_instance) (cm4a : ∀ {A B X Y : C} (i : A ⟶ B) (p : X ⟶ Y) [HomotopicalAlgebra.Cofibration i] [HomotopicalAlgebra.WeakEquivalence i] [HomotopicalAlgebra.Fibration p], CategoryTheory.HasLiftingProperty i p := by intros; infer_instance) (cm4b : ∀ {A B X Y : C} (i : A ⟶ B) (p : X ⟶ Y) [HomotopicalAlgebra.Cofibration i] [HomotopicalAlgebra.Fibration p] [HomotopicalAlgebra.WeakEquivalence p], CategoryTheory.HasLiftingProperty i p := by intros; infer_instance) (cm5a : (HomotopicalAlgebra.trivialCofibrations C).HasFactorization (HomotopicalAlgebra.fibrations C) := by infer_instance) (cm5b : (HomotopicalAlgebra.cofibrations C).HasFactorization (HomotopicalAlgebra.trivialFibrations C) := by infer_instance) : HomotopicalAlgebra.ModelCategory C - CategoryTheory.Injective.hasLiftingProperty_of_isZero 📋 Mathlib.CategoryTheory.Preadditive.Injective.LiftingProperties
{C : Type u} [CategoryTheory.Category.{v, u} C] {A B I Z : C} (i : A ⟶ B) [CategoryTheory.Mono i] [CategoryTheory.Injective I] (p : I ⟶ Z) (hZ : CategoryTheory.Limits.IsZero Z) : CategoryTheory.HasLiftingProperty i p - CategoryTheory.Injective.instHasLiftingPropertyOfMono 📋 Mathlib.CategoryTheory.Preadditive.Injective.LiftingProperties
{C : Type u} [CategoryTheory.Category.{v, u} C] {A B I : C} (i : A ⟶ B) [CategoryTheory.Mono i] [CategoryTheory.Injective I] [CategoryTheory.Limits.HasZeroObject C] (p : I ⟶ 0) : CategoryTheory.HasLiftingProperty i p - CategoryTheory.Abelian.epiWithInjectiveKernel.hasLiftingProperty 📋 Mathlib.CategoryTheory.Abelian.EpiWithInjectiveKernel
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] {X Y : C} {p : X ⟶ Y} (hp : CategoryTheory.Abelian.epiWithInjectiveKernel p) {A B : C} (i : A ⟶ B) [CategoryTheory.Mono i] : CategoryTheory.HasLiftingProperty i p - CochainComplex.Plus.modelCategoryQuillen.instHasLiftingPropertyOfMonoOfFibrationOfWeakEquivalence 📋 Mathlib.Algebra.Homology.ModelCategory.Injective
{C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.Abelian C] {A B X Y : CochainComplex.Plus C} (i : A ⟶ B) (p : X ⟶ Y) [CategoryTheory.Mono i] [HomotopicalAlgebra.Fibration p] [HomotopicalAlgebra.WeakEquivalence p] : CategoryTheory.HasLiftingProperty i p - CochainComplex.Plus.modelCategoryQuillen.instHasLiftingPropertyOfMonoOfWeakEquivalenceOfFibration 📋 Mathlib.Algebra.Homology.ModelCategory.Injective
{C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.Abelian C] {A B X Y : CochainComplex.Plus C} (i : A ⟶ B) (p : X ⟶ Y) [CategoryTheory.Mono i] [HomotopicalAlgebra.WeakEquivalence i] [HomotopicalAlgebra.Fibration p] : CategoryTheory.HasLiftingProperty i p - CategoryTheory.HasLiftingProperty.transfiniteComposition.hasLiftingProperty_ι_app_bot 📋 Mathlib.CategoryTheory.SmallObject.TransfiniteCompositionLifting
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [LinearOrder J] [OrderBot J] {F : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.Cocone F} (hc : CategoryTheory.Limits.IsColimit c) {X Y : C} {p : X ⟶ Y} [F.IsWellOrderContinuous] [SuccOrder J] [WellFoundedLT J] (hF : ∀ (j : J), ¬IsMax j → CategoryTheory.HasLiftingProperty (F.map (CategoryTheory.homOfLE ⋯)) p) : CategoryTheory.HasLiftingProperty (c.ι.app ⊥) p - CategoryTheory.SmallObject.hasRightLiftingProperty_πObj 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {X Y A B : C} (i : A ⟶ B) (hi : I i) (f : X ⟶ Y) : CategoryTheory.HasLiftingProperty i (CategoryTheory.SmallObject.πObj I κ f) - HomotopicalAlgebra.ModelCategory.hasLiftingProperty_of_joyalTrick 📋 Mathlib.AlgebraicTopology.ModelCategory.JoyalTrick
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [HomotopicalAlgebra.CategoryWithCofibrations C] [HomotopicalAlgebra.CategoryWithFibrations C] [HomotopicalAlgebra.CategoryWithWeakEquivalences C] [(HomotopicalAlgebra.weakEquivalences C).HasTwoOutOfThreeProperty] [(HomotopicalAlgebra.cofibrations C).HasFactorization (HomotopicalAlgebra.trivialFibrations C)] [CategoryTheory.Limits.HasPushouts C] [(HomotopicalAlgebra.cofibrations C).IsStableUnderComposition] [(HomotopicalAlgebra.cofibrations C).IsStableUnderCobaseChange] (h : ∀ {A B X Y : C} (i : A ⟶ B) (p : X ⟶ Y) [HomotopicalAlgebra.Cofibration i] [HomotopicalAlgebra.WeakEquivalence i] [HomotopicalAlgebra.Fibration p], CategoryTheory.HasLiftingProperty i p) {A B X Y : C} (i : A ⟶ B) (p : X ⟶ Y) [HomotopicalAlgebra.Cofibration i] [HomotopicalAlgebra.Fibration p] [HomotopicalAlgebra.WeakEquivalence p] : CategoryTheory.HasLiftingProperty i p - HomotopicalAlgebra.ModelCategory.hasLiftingProperty_of_joyalTrickDual 📋 Mathlib.AlgebraicTopology.ModelCategory.JoyalTrick
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [HomotopicalAlgebra.CategoryWithCofibrations C] [HomotopicalAlgebra.CategoryWithFibrations C] [HomotopicalAlgebra.CategoryWithWeakEquivalences C] [(HomotopicalAlgebra.weakEquivalences C).HasTwoOutOfThreeProperty] [(HomotopicalAlgebra.trivialCofibrations C).HasFactorization (HomotopicalAlgebra.fibrations C)] [CategoryTheory.Limits.HasPullbacks C] [(HomotopicalAlgebra.fibrations C).IsStableUnderComposition] [(HomotopicalAlgebra.fibrations C).IsStableUnderBaseChange] (h : ∀ {A B X Y : C} (i : A ⟶ B) (p : X ⟶ Y) [HomotopicalAlgebra.Cofibration i] [HomotopicalAlgebra.WeakEquivalence p] [HomotopicalAlgebra.Fibration p], CategoryTheory.HasLiftingProperty i p) {A B X Y : C} (i : A ⟶ B) (p : X ⟶ Y) [HomotopicalAlgebra.Cofibration i] [HomotopicalAlgebra.Fibration p] [HomotopicalAlgebra.WeakEquivalence i] : CategoryTheory.HasLiftingProperty i p - CategoryTheory.HasLiftingProperty.over 📋 Mathlib.CategoryTheory.LiftingProperties.Over
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {A B X Y : CategoryTheory.Over S} (i : A ⟶ B) (p : X ⟶ Y) [CategoryTheory.HasLiftingProperty (CategoryTheory.Over.Hom.left i) (CategoryTheory.Over.Hom.left p)] : CategoryTheory.HasLiftingProperty i p - SSet.modelCategoryQuillen.instHasLiftingPropertyιHornHAddNatOfNatOfFibration 📋 Mathlib.AlgebraicTopology.SimplicialSet.CategoryWithFibrations
{X Y : SSet} (f : X ⟶ Y) [hf : HomotopicalAlgebra.Fibration f] {n : ℕ} (i : Fin (n + 2)) : CategoryTheory.HasLiftingProperty (SSet.horn (n + 1) i).ι f - SSet.quasicategory_of_hasLiftingProperty 📋 Mathlib.AlgebraicTopology.Quasicategory.Basic
(S : SSet) {X : SSet} (t : CategoryTheory.Limits.IsTerminal X) (h : ∀ {n : ℕ} {i : Fin (n + 1)}, 0 < i → i < Fin.last n → CategoryTheory.HasLiftingProperty (SSet.horn n i).ι (t.from S)) : S.Quasicategory - SSet.Quasicategory.hasLiftingProperty 📋 Mathlib.AlgebraicTopology.Quasicategory.Basic
(S : SSet) [S.Quasicategory] {X : SSet} (t : CategoryTheory.Limits.IsTerminal X) {n : ℕ} {i : Fin (n + 1)} (h0 : 0 < i) (hn : i < Fin.last n) : CategoryTheory.HasLiftingProperty (SSet.horn n i).ι (t.from S) - SSet.quasicategory_iff_hasLiftingProperty 📋 Mathlib.AlgebraicTopology.Quasicategory.Basic
(S : SSet) {X : SSet} (t : CategoryTheory.Limits.IsTerminal X) : S.Quasicategory ↔ ∀ {n : ℕ} {i : Fin (n + 1)}, 0 < i → i < Fin.last n → CategoryTheory.HasLiftingProperty (SSet.horn n i).ι (t.from S) - CategoryTheory.ParametrizedAdjunction.hasLiftingProperty_iff 📋 Mathlib.CategoryTheory.LiftingProperties.ParametrizedAdjunction
{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₁ Y₁ : C₁} {f₁ : X₁ ⟶ Y₁} {X₂ Y₂ : C₂} {f₂ : X₂ ⟶ Y₂} {X₃ Y₃ : C₃} {f₃ : X₃ ⟶ Y₃} (sq₁₂ : F.PushoutObjObj f₁ f₂) (sq₁₃ : G.PullbackObjObj f₁ f₃) : CategoryTheory.HasLiftingProperty sq₁₂.ι f₃ ↔ CategoryTheory.HasLiftingProperty f₂ sq₁₃.π - CategoryTheory.MonoidalCategory.Arrow.PushoutProduct.hasLiftingProperty_mk_isTerminal_iff 📋 Mathlib.CategoryTheory.LiftingProperties.PushoutProduct
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPushouts C] [CategoryTheory.Limits.HasPullbacks C] [CategoryTheory.MonoidalCategory C] [CategoryTheory.MonoidalClosed C] {A B K L X Y : C} {f : A ⟶ B} {g : K ⟶ L} (t : CategoryTheory.Limits.IsTerminal Y) : CategoryTheory.HasLiftingProperty (CategoryTheory.Arrow.mk f □ CategoryTheory.Arrow.mk g).hom (t.from X) ↔ CategoryTheory.HasLiftingProperty g ((CategoryTheory.MonoidalClosed.pre f).app X) - CategoryTheory.MonoidalCategory.Arrow.PushoutProduct.hasLiftingProperty_mk_isInitial_isTerminal_iff 📋 Mathlib.CategoryTheory.LiftingProperties.PushoutProduct
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPushouts C] [CategoryTheory.CartesianMonoidalCategory C] [CategoryTheory.MonoidalClosed C] [CategoryTheory.BraidedCategory C] {A B K L X Y : C} {g : K ⟶ L} (i : CategoryTheory.Limits.IsInitial A) (t : CategoryTheory.Limits.IsTerminal Y) : CategoryTheory.HasLiftingProperty (CategoryTheory.Arrow.mk (i.to B) □ CategoryTheory.Arrow.mk g).hom (t.from X) ↔ CategoryTheory.HasLiftingProperty g (t.from (B ⟹ X)) - CategoryTheory.MonoidalCategory.Arrow.PushoutProduct.hasLiftingProperty_mk_isInitial_isTerminal_iff' 📋 Mathlib.CategoryTheory.LiftingProperties.PushoutProduct
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPushouts C] [CategoryTheory.CartesianMonoidalCategory C] [CategoryTheory.MonoidalClosed C] [CategoryTheory.BraidedCategory C] {A B K L X Y : C} {f : A ⟶ B} (i : CategoryTheory.Limits.IsInitial K) (t : CategoryTheory.Limits.IsTerminal Y) : CategoryTheory.HasLiftingProperty (CategoryTheory.Arrow.mk f □ CategoryTheory.Arrow.mk (i.to L)).hom (t.from X) ↔ CategoryTheory.HasLiftingProperty f (t.from (L ⟹ X)) - CategoryTheory.MonoidalCategory.Arrow.PushoutProduct.hasLiftingProperty_mk_isInitial_iff 📋 Mathlib.CategoryTheory.LiftingProperties.PushoutProduct
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPushouts C] [CategoryTheory.CartesianMonoidalCategory C] [CategoryTheory.MonoidalClosed C] [CategoryTheory.BraidedCategory C] {A B K L X Y : C} {g : K ⟶ L} {h : X ⟶ Y} (i : CategoryTheory.Limits.IsInitial A) : CategoryTheory.HasLiftingProperty (CategoryTheory.Arrow.mk (i.to B) □ CategoryTheory.Arrow.mk g).hom h ↔ CategoryTheory.HasLiftingProperty g ((CategoryTheory.ihom B).map h) - CategoryTheory.MonoidalCategory.Arrow.PushoutProduct.hasLiftingProperty_mk_isInitial_iff' 📋 Mathlib.CategoryTheory.LiftingProperties.PushoutProduct
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPushouts C] [CategoryTheory.CartesianMonoidalCategory C] [CategoryTheory.MonoidalClosed C] [CategoryTheory.BraidedCategory C] {A B K L X Y : C} {f : A ⟶ B} {h : X ⟶ Y} (i : CategoryTheory.Limits.IsInitial K) : CategoryTheory.HasLiftingProperty (CategoryTheory.Arrow.mk f □ CategoryTheory.Arrow.mk (i.to L)).hom h ↔ CategoryTheory.HasLiftingProperty f ((CategoryTheory.ihom L).map h) - CategoryTheory.MonoidalCategory.Arrow.PushoutProduct.hasLiftingProperty_iff 📋 Mathlib.CategoryTheory.LiftingProperties.PushoutProduct
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPushouts C] [CategoryTheory.Limits.HasPullbacks C] [CategoryTheory.MonoidalCategory C] [CategoryTheory.MonoidalClosed C] {X Y Z : CategoryTheory.Arrow C} : CategoryTheory.HasLiftingProperty (X □ Y).hom Z.hom ↔ CategoryTheory.HasLiftingProperty Y.hom (Opposite.op X ⋔ Z).hom - CategoryTheory.MonoidalCategory.Arrow.PushoutProduct.hasLiftingProperty_iff' 📋 Mathlib.CategoryTheory.LiftingProperties.PushoutProduct
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPushouts C] [CategoryTheory.Limits.HasPullbacks C] [CategoryTheory.MonoidalCategory C] [CategoryTheory.MonoidalClosed C] [CategoryTheory.BraidedCategory C] {X Y Z : CategoryTheory.Arrow C} : CategoryTheory.HasLiftingProperty (X □ Y).hom Z.hom ↔ CategoryTheory.HasLiftingProperty X.hom (Opposite.op Y ⋔ Z).hom - CategoryTheory.MonoidalCategory.Arrow.PushoutProduct.hasLiftingProperty_mk_iff 📋 Mathlib.CategoryTheory.LiftingProperties.PushoutProduct
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPushouts C] [CategoryTheory.Limits.HasPullbacks C] [CategoryTheory.MonoidalCategory C] [CategoryTheory.MonoidalClosed C] {A B K L X Y : C} {f : A ⟶ B} {g : K ⟶ L} {h : X ⟶ Y} : CategoryTheory.HasLiftingProperty (CategoryTheory.Arrow.mk f □ CategoryTheory.Arrow.mk g).hom h ↔ CategoryTheory.HasLiftingProperty g (Opposite.op (CategoryTheory.Arrow.mk f) ⋔ CategoryTheory.Arrow.mk h).hom - CategoryTheory.MonoidalCategory.Arrow.PushoutProduct.hasLiftingProperty_mk_iff' 📋 Mathlib.CategoryTheory.LiftingProperties.PushoutProduct
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPushouts C] [CategoryTheory.Limits.HasPullbacks C] [CategoryTheory.MonoidalCategory C] [CategoryTheory.MonoidalClosed C] [CategoryTheory.BraidedCategory C] {A B K L X Y : C} {f : A ⟶ B} {g : K ⟶ L} {h : X ⟶ Y} : CategoryTheory.HasLiftingProperty (CategoryTheory.Arrow.mk f □ CategoryTheory.Arrow.mk g).hom h ↔ CategoryTheory.HasLiftingProperty f (Opposite.op (CategoryTheory.Arrow.mk g) ⋔ CategoryTheory.Arrow.mk h).hom - CategoryTheory.Projective.hasLiftingProperty_of_isZero 📋 Mathlib.CategoryTheory.Preadditive.Projective.LiftingProperties
{C : Type u} [CategoryTheory.Category.{v, u} C] {Z P X Y : C} (i : Z ⟶ P) (p : X ⟶ Y) [CategoryTheory.Epi p] [CategoryTheory.Projective P] (hZ : CategoryTheory.Limits.IsZero Z) : CategoryTheory.HasLiftingProperty i p - CategoryTheory.Projective.instHasLiftingPropertyOfEpi 📋 Mathlib.CategoryTheory.Preadditive.Projective.LiftingProperties
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y P : C} (p : X ⟶ Y) [CategoryTheory.Epi p] [CategoryTheory.Projective P] [CategoryTheory.Limits.HasZeroObject C] (i : 0 ⟶ P) : CategoryTheory.HasLiftingProperty i p
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