Loogle!
Result
Found 57 declarations mentioning Order.le_succ.
- Order.le_succ 📋 Mathlib.Order.SuccPred.Basic
{α : Type u_1} [Preorder α] [SuccOrder α] (a : α) : a ≤ Order.succ a - Succ.rec 📋 Mathlib.Order.SuccPred.Archimedean
{α : Type u_1} [Preorder α] [SuccOrder α] [IsSuccArchimedean α] {m : α} {P : (n : α) → m ≤ n → Prop} (rfl : P m ⋯) (succ : ∀ (n : α) (hmn : m ≤ n), P n hmn → P (Order.succ n) ⋯) ⦃n : α⦄ (hmn : m ≤ n) : P n hmn - InverseSystem.pEquivOnSucc 📋 Mathlib.Order.DirectedInverseSystem
{ι : Type u_6} {F : ι → Type u_7} {X : ι → Type u_8} {i : ι} [LinearOrder ι] {f : ⦃i j : ι⦄ → i ≤ j → F j → F i} [SuccOrder ι] {equivSucc : ⦃i : ι⦄ → ¬IsMax i → F (Order.succ i) ≃ F i × X i} [InverseSystem f] (hi : ¬IsMax i) (e : InverseSystem.PEquivOn f equivSucc (Set.Iic i)) (H : ∀ ⦃i : ι⦄ (hi : ¬IsMax i) (x : F (Order.succ i)), ((equivSucc hi) x).1 = f ⋯ x) : InverseSystem.PEquivOn f equivSucc (Set.Iic (Order.succ i)) - InverseSystem.isNatEquiv_piEquivSucc 📋 Mathlib.Order.DirectedInverseSystem
{ι : Type u_6} {F : ι → Type u_7} {X : ι → Type u_8} {i : ι} [LinearOrder ι] {f : ⦃i j : ι⦄ → i ≤ j → F j → F i} [SuccOrder ι] {equiv : (j : ↑(Set.Iic i)) → F ↑j ≃ InverseSystem.piLT X ↑j} {e : F (Order.succ i) ≃ F i × X i} (hi : ¬IsMax i) [InverseSystem f] (H : ∀ (x : F (Order.succ i)), (e x).1 = f ⋯ x) (nat : InverseSystem.IsNatEquiv f equiv) : InverseSystem.IsNatEquiv f (InverseSystem.piEquivSucc equiv e hi) - InverseSystem.globalEquiv 📋 Mathlib.Order.DirectedInverseSystem
{ι : Type u_6} {F : ι → Type u_7} {X : ι → Type u_8} [LinearOrder ι] {f : ⦃i j : ι⦄ → i ≤ j → F j → F i} [WellFoundedLT ι] [SuccOrder ι] [InverseSystem f] (equivSucc : (i : ι) → ¬IsMax i → { e // ∀ (x : F (Order.succ i)), (e x).1 = f ⋯ x }) (equivLim : (i : ι) → Order.IsSuccPrelimit i → { e // ∀ (x : F i) (l : ↑(Set.Iio i)), ↑(e x) l = f ⋯ x }) (i : ι) : F i ≃ InverseSystem.piLT X i - InverseSystem.globalEquiv_naturality 📋 Mathlib.Order.DirectedInverseSystem
{ι : Type u_6} {F : ι → Type u_7} {X : ι → Type u_8} [LinearOrder ι] {f : ⦃i j : ι⦄ → i ≤ j → F j → F i} [WellFoundedLT ι] [SuccOrder ι] [InverseSystem f] (equivSucc : (i : ι) → ¬IsMax i → { e // ∀ (x : F (Order.succ i)), (e x).1 = f ⋯ x }) (equivLim : (i : ι) → Order.IsSuccPrelimit i → { e // ∀ (x : F i) (l : ↑(Set.Iio i)), ↑(e x) l = f ⋯ x }) ⦃i j : ι⦄ (h : i ≤ j) (x : F j) : (InverseSystem.globalEquiv equivSucc equivLim i) (f h x) = InverseSystem.piLTProj h ((InverseSystem.globalEquiv equivSucc equivLim j) x) - InverseSystem.globalEquiv_compatibility 📋 Mathlib.Order.DirectedInverseSystem
{ι : Type u_6} {F : ι → Type u_7} {X : ι → Type u_8} [LinearOrder ι] {f : ⦃i j : ι⦄ → i ≤ j → F j → F i} [WellFoundedLT ι] [SuccOrder ι] [InverseSystem f] (equivSucc : (i : ι) → ¬IsMax i → { e // ∀ (x : F (Order.succ i)), (e x).1 = f ⋯ x }) (equivLim : (i : ι) → Order.IsSuccPrelimit i → { e // ∀ (x : F i) (l : ↑(Set.Iio i)), ↑(e x) l = f ⋯ x }) ⦃i : ι⦄ (hi : ¬IsMax i) (x : F (Order.succ i)) : (InverseSystem.globalEquiv equivSucc equivLim (Order.succ i)) x ⟨i, ⋯⟩ = (↑(equivSucc i hi) x).2 - CategoryTheory.MorphismProperty.TransfiniteCompositionOfShape.mk 📋 Mathlib.CategoryTheory.MorphismProperty.TransfiniteComposition
{C : Type u} [CategoryTheory.Category.{v, u} C] {W : CategoryTheory.MorphismProperty C} {J : Type w} [LinearOrder J] [SuccOrder J] [OrderBot J] [WellFoundedLT J] {X Y : C} {f : X ⟶ Y} (toTransfiniteCompositionOfShape : CategoryTheory.TransfiniteCompositionOfShape J f) (map_mem : ∀ (j : J), ¬IsMax j → W (toTransfiniteCompositionOfShape.F.map (CategoryTheory.homOfLE ⋯))) : W.TransfiniteCompositionOfShape J f - CategoryTheory.MorphismProperty.TransfiniteCompositionOfShape.map_mem 📋 Mathlib.CategoryTheory.MorphismProperty.TransfiniteComposition
{C : Type u} [CategoryTheory.Category.{v, u} C] {W : CategoryTheory.MorphismProperty C} {J : Type w} [LinearOrder J] [SuccOrder J] [OrderBot J] [WellFoundedLT J] {X Y : C} {f : X ⟶ Y} (self : W.TransfiniteCompositionOfShape J f) (j : J) (hj : ¬IsMax j) : W (self.F.map (CategoryTheory.homOfLE ⋯)) - CategoryTheory.SmallObject.SuccStruct.arrowSucc_def 📋 Mathlib.CategoryTheory.SmallObject.Iteration.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [LinearOrder J] [SuccOrder J] {j : J} (F : CategoryTheory.Functor (↑(Set.Iic j)) C) (i : J) (hi : i < j) : CategoryTheory.SmallObject.SuccStruct.arrowSucc F i hi = CategoryTheory.SmallObject.SuccStruct.arrowMap F i (Order.succ i) ⋯ ⋯ - CategoryTheory.SmallObject.SuccStruct.Iteration.prop_map_succ 📋 Mathlib.CategoryTheory.SmallObject.Iteration.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} {Φ : CategoryTheory.SmallObject.SuccStruct C} [LinearOrder J] [SuccOrder J] [OrderBot J] [CategoryTheory.Limits.HasIterationOfShape J C] [WellFoundedLT J] {j : J} (iter : Φ.Iteration j) (i : J) (hi : i < j) : Φ.prop (iter.F.map (CategoryTheory.homOfLE ⋯)) - CategoryTheory.SmallObject.SuccStruct.arrowMap_extendToSucc 📋 Mathlib.CategoryTheory.SmallObject.Iteration.ExtendToSucc
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] [SuccOrder J] {j : J} (hj : ¬IsMax j) (F : CategoryTheory.Functor (↑(Set.Iic j)) C) {X : C} (τ : F.obj ⟨j, ⋯⟩ ⟶ X) (i₁ i₂ : J) (hi : i₁ ≤ i₂) (hi₂ : i₂ ≤ j) : CategoryTheory.SmallObject.SuccStruct.arrowMap (CategoryTheory.SmallObject.SuccStruct.extendToSucc hj F τ) i₁ i₂ hi ⋯ = CategoryTheory.SmallObject.SuccStruct.arrowMap F i₁ i₂ hi hi₂ - CategoryTheory.SmallObject.SuccStruct.extendToSucc.obj_eq 📋 Mathlib.CategoryTheory.SmallObject.Iteration.ExtendToSucc
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] [SuccOrder J] {j : J} (F : CategoryTheory.Functor (↑(Set.Iic j)) C) (X : C) (i : ↑(Set.Iic j)) : CategoryTheory.SmallObject.SuccStruct.extendToSucc.obj F X ⟨↑i, ⋯⟩ = F.obj i - CategoryTheory.SmallObject.SuccStruct.extendToSucc.objIso 📋 Mathlib.CategoryTheory.SmallObject.Iteration.ExtendToSucc
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] [SuccOrder J] {j : J} (F : CategoryTheory.Functor (↑(Set.Iic j)) C) (X : C) (i : ↑(Set.Iic j)) : CategoryTheory.SmallObject.SuccStruct.extendToSucc.obj F X ⟨↑i, ⋯⟩ ≅ F.obj i - CategoryTheory.SmallObject.SuccStruct.extendToSuccRestrictionLEIso 📋 Mathlib.CategoryTheory.SmallObject.Iteration.ExtendToSucc
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] [SuccOrder J] {j : J} (hj : ¬IsMax j) (F : CategoryTheory.Functor (↑(Set.Iic j)) C) {X : C} (τ : F.obj ⟨j, ⋯⟩ ⟶ X) : CategoryTheory.SmallObject.restrictionLE (CategoryTheory.SmallObject.SuccStruct.extendToSucc hj F τ) ⋯ ≅ F - CategoryTheory.SmallObject.SuccStruct.extendToSucc_obj_eq 📋 Mathlib.CategoryTheory.SmallObject.Iteration.ExtendToSucc
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] [SuccOrder J] {j : J} (hj : ¬IsMax j) (F : CategoryTheory.Functor (↑(Set.Iic j)) C) {X : C} (τ : F.obj ⟨j, ⋯⟩ ⟶ X) (i : J) (hi : i ≤ j) : (CategoryTheory.SmallObject.SuccStruct.extendToSucc hj F τ).obj ⟨i, ⋯⟩ = F.obj ⟨i, hi⟩ - CategoryTheory.SmallObject.SuccStruct.extendToSuccObjIso 📋 Mathlib.CategoryTheory.SmallObject.Iteration.ExtendToSucc
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] [SuccOrder J] {j : J} (hj : ¬IsMax j) (F : CategoryTheory.Functor (↑(Set.Iic j)) C) {X : C} (τ : F.obj ⟨j, ⋯⟩ ⟶ X) (i : J) (hi : i ≤ j) : (CategoryTheory.SmallObject.SuccStruct.extendToSucc hj F τ).obj ⟨i, ⋯⟩ ≅ F.obj ⟨i, hi⟩ - CategoryTheory.SmallObject.SuccStruct.extendToSuccRestrictionLEIso_hom_app 📋 Mathlib.CategoryTheory.SmallObject.Iteration.ExtendToSucc
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] [SuccOrder J] {j : J} (hj : ¬IsMax j) (F : CategoryTheory.Functor (↑(Set.Iic j)) C) {X : C} (τ : F.obj ⟨j, ⋯⟩ ⟶ X) (X✝ : ↑(Set.Iic j)) : (CategoryTheory.SmallObject.SuccStruct.extendToSuccRestrictionLEIso hj F τ).hom.app X✝ = (CategoryTheory.SmallObject.SuccStruct.extendToSuccObjIso hj F τ ↑X✝ ⋯).hom - CategoryTheory.SmallObject.SuccStruct.extendToSuccRestrictionLEIso_inv_app 📋 Mathlib.CategoryTheory.SmallObject.Iteration.ExtendToSucc
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] [SuccOrder J] {j : J} (hj : ¬IsMax j) (F : CategoryTheory.Functor (↑(Set.Iic j)) C) {X : C} (τ : F.obj ⟨j, ⋯⟩ ⟶ X) (X✝ : ↑(Set.Iic j)) : (CategoryTheory.SmallObject.SuccStruct.extendToSuccRestrictionLEIso hj F τ).inv.app X✝ = (CategoryTheory.SmallObject.SuccStruct.extendToSuccObjIso hj F τ ↑X✝ ⋯).inv - CategoryTheory.SmallObject.SuccStruct.extendToSucc.map_self_succ 📋 Mathlib.CategoryTheory.SmallObject.Iteration.ExtendToSucc
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] [SuccOrder J] {j : J} (hj : ¬IsMax j) (F : CategoryTheory.Functor (↑(Set.Iic j)) C) {X : C} (τ : F.obj ⟨j, ⋯⟩ ⟶ X) : CategoryTheory.SmallObject.SuccStruct.extendToSucc.map hj F τ j (Order.succ j) ⋯ ⋯ = CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.SuccStruct.extendToSucc.objIso F X ⟨j, ⋯⟩).hom (CategoryTheory.CategoryStruct.comp τ (CategoryTheory.SmallObject.SuccStruct.extendToSucc.objSuccIso hj F X).inv) - CategoryTheory.SmallObject.SuccStruct.extendToSucc_map_le_succ 📋 Mathlib.CategoryTheory.SmallObject.Iteration.ExtendToSucc
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] [SuccOrder J] {j : J} (hj : ¬IsMax j) (F : CategoryTheory.Functor (↑(Set.Iic j)) C) {X : C} (τ : F.obj ⟨j, ⋯⟩ ⟶ X) : (CategoryTheory.SmallObject.SuccStruct.extendToSucc hj F τ).map (CategoryTheory.homOfLE ⋯) = CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.SuccStruct.extendToSuccObjIso hj F τ j ⋯).hom (CategoryTheory.CategoryStruct.comp τ (CategoryTheory.SmallObject.SuccStruct.extendToSuccObjSuccIso hj F τ).inv) - CategoryTheory.SmallObject.SuccStruct.extendToSucc.map_eq 📋 Mathlib.CategoryTheory.SmallObject.Iteration.ExtendToSucc
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] [SuccOrder J] {j : J} (hj : ¬IsMax j) (F : CategoryTheory.Functor (↑(Set.Iic j)) C) {X : C} (τ : F.obj ⟨j, ⋯⟩ ⟶ X) (i₁ i₂ : J) (hi : i₁ ≤ i₂) (hi₂ : i₂ ≤ j) : CategoryTheory.SmallObject.SuccStruct.extendToSucc.map hj F τ i₁ i₂ hi ⋯ = CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.SuccStruct.extendToSucc.objIso F X ⟨i₁, ⋯⟩).hom (CategoryTheory.CategoryStruct.comp (F.map (CategoryTheory.homOfLE hi)) (CategoryTheory.SmallObject.SuccStruct.extendToSucc.objIso F X ⟨i₂, hi₂⟩).inv) - CategoryTheory.SmallObject.SuccStruct.extendToSuccObjIso_hom_naturality 📋 Mathlib.CategoryTheory.SmallObject.Iteration.ExtendToSucc
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] [SuccOrder J] {j : J} (hj : ¬IsMax j) (F : CategoryTheory.Functor (↑(Set.Iic j)) C) {X : C} (τ : F.obj ⟨j, ⋯⟩ ⟶ X) (i₁ i₂ : J) (hi : i₁ ≤ i₂) (hi₂ : i₂ ≤ j) : CategoryTheory.CategoryStruct.comp ((CategoryTheory.SmallObject.SuccStruct.extendToSucc hj F τ).map (CategoryTheory.homOfLE hi)) (CategoryTheory.SmallObject.SuccStruct.extendToSuccObjIso hj F τ i₂ hi₂).hom = CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.SuccStruct.extendToSuccObjIso hj F τ i₁ ⋯).hom (F.map (CategoryTheory.homOfLE hi)) - CategoryTheory.SmallObject.SuccStruct.extendToSucc_map 📋 Mathlib.CategoryTheory.SmallObject.Iteration.ExtendToSucc
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] [SuccOrder J] {j : J} (hj : ¬IsMax j) (F : CategoryTheory.Functor (↑(Set.Iic j)) C) {X : C} (τ : F.obj ⟨j, ⋯⟩ ⟶ X) (i₁ i₂ : J) (hi : i₁ ≤ i₂) (hi₂ : i₂ ≤ j) : (CategoryTheory.SmallObject.SuccStruct.extendToSucc hj F τ).map (CategoryTheory.homOfLE hi) = CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.SuccStruct.extendToSuccObjIso hj F τ i₁ ⋯).hom (CategoryTheory.CategoryStruct.comp (F.map (CategoryTheory.homOfLE hi)) (CategoryTheory.SmallObject.SuccStruct.extendToSuccObjIso hj F τ i₂ hi₂).inv) - CategoryTheory.SmallObject.SuccStruct.extendToSuccObjIso_hom_naturality_assoc 📋 Mathlib.CategoryTheory.SmallObject.Iteration.ExtendToSucc
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] [SuccOrder J] {j : J} (hj : ¬IsMax j) (F : CategoryTheory.Functor (↑(Set.Iic j)) C) {X : C} (τ : F.obj ⟨j, ⋯⟩ ⟶ X) (i₁ i₂ : J) (hi : i₁ ≤ i₂) (hi₂ : i₂ ≤ j) {Z : C} (h : F.obj ⟨i₂, hi₂⟩ ⟶ Z) : CategoryTheory.CategoryStruct.comp ((CategoryTheory.SmallObject.SuccStruct.extendToSucc hj F τ).map (CategoryTheory.homOfLE hi)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.SuccStruct.extendToSuccObjIso hj F τ i₂ hi₂).hom h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.SuccStruct.extendToSuccObjIso hj F τ i₁ ⋯).hom (CategoryTheory.CategoryStruct.comp (F.map (CategoryTheory.homOfLE hi)) h) - CategoryTheory.SmallObject.SuccStruct.prop_iterationFunctor_map_succ 📋 Mathlib.CategoryTheory.SmallObject.TransfiniteIteration
{C : Type u} [CategoryTheory.Category.{v, u} C] (Φ : CategoryTheory.SmallObject.SuccStruct C) {J : Type w} [LinearOrder J] [OrderBot J] [SuccOrder J] [WellFoundedLT J] [CategoryTheory.Limits.HasIterationOfShape J C] (j : J) (hj : ¬IsMax j) : Φ.prop ((Φ.iterationFunctor J).map (CategoryTheory.homOfLE ⋯)) - CategoryTheory.SmallObject.SuccStruct.iterationFunctor_map_succ 📋 Mathlib.CategoryTheory.SmallObject.TransfiniteIteration
{C : Type u} [CategoryTheory.Category.{v, u} C] (Φ : CategoryTheory.SmallObject.SuccStruct C) {J : Type w} [LinearOrder J] [OrderBot J] [SuccOrder J] [WellFoundedLT J] [CategoryTheory.Limits.HasIterationOfShape J C] (j : J) (hj : ¬IsMax j) : (Φ.iterationFunctor J).map (CategoryTheory.homOfLE ⋯) = CategoryTheory.CategoryStruct.comp (Φ.toSucc ((Φ.iterationFunctor J).obj j)) (Φ.iterationFunctorObjSuccIso j hj).inv - CategoryTheory.SmallObject.SuccStruct.iterationFunctor_map_succ_assoc 📋 Mathlib.CategoryTheory.SmallObject.TransfiniteIteration
{C : Type u} [CategoryTheory.Category.{v, u} C] (Φ : CategoryTheory.SmallObject.SuccStruct C) {J : Type w} [LinearOrder J] [OrderBot J] [SuccOrder J] [WellFoundedLT J] [CategoryTheory.Limits.HasIterationOfShape J C] (j : J) (hj : ¬IsMax j) {Z : C} (h : (Φ.iterationFunctor J).obj (Order.succ j) ⟶ Z) : CategoryTheory.CategoryStruct.comp ((Φ.iterationFunctor J).map (CategoryTheory.homOfLE ⋯)) h = CategoryTheory.CategoryStruct.comp (Φ.toSucc ((Φ.iterationFunctor J).obj j)) (CategoryTheory.CategoryStruct.comp (Φ.iterationFunctorObjSuccIso j hj).inv h) - CategoryTheory.Functor.WellOrderInductionData.map_succ 📋 Mathlib.CategoryTheory.SmallObject.WellOrderInductionData
{J : Type u} [LinearOrder J] [SuccOrder J] {F : CategoryTheory.Functor Jᵒᵖ (Type v)} (self : F.WellOrderInductionData) (j : J) (hj : ¬IsMax j) (x : F.obj (Opposite.op j)) : (CategoryTheory.ConcreteCategory.hom (F.map (CategoryTheory.homOfLE ⋯).op)) (self.succ j hj x) = x - CategoryTheory.Functor.WellOrderInductionData.ofExists 📋 Mathlib.CategoryTheory.SmallObject.WellOrderInductionData
{J : Type u} [LinearOrder J] [SuccOrder J] {F : CategoryTheory.Functor Jᵒᵖ (Type v)} (h₁ : ∀ (j : J), ¬IsMax j → Function.Surjective ⇑(CategoryTheory.ConcreteCategory.hom (F.map (CategoryTheory.homOfLE ⋯).op))) (h₂ : ∀ (j : J), Order.IsSuccLimit j → ∀ (x : ↑(⋯.functor.op.comp F).sections), ∃ y, ∀ (i : J) (hi : i < j), (CategoryTheory.ConcreteCategory.hom (F.map (CategoryTheory.homOfLE ⋯).op)) y = ↑x (Opposite.op ⟨i, hi⟩)) : F.WellOrderInductionData - CategoryTheory.Functor.WellOrderInductionData.mk 📋 Mathlib.CategoryTheory.SmallObject.WellOrderInductionData
{J : Type u} [LinearOrder J] [SuccOrder J] {F : CategoryTheory.Functor Jᵒᵖ (Type v)} (succ : (j : J) → ¬IsMax j → F.obj (Opposite.op j) → F.obj (Opposite.op (Order.succ j))) (map_succ : ∀ (j : J) (hj : ¬IsMax j) (x : F.obj (Opposite.op j)), (CategoryTheory.ConcreteCategory.hom (F.map (CategoryTheory.homOfLE ⋯).op)) (succ j hj x) = x) (lift : (j : J) → Order.IsSuccLimit j → ↑(⋯.functor.op.comp F).sections → F.obj (Opposite.op j)) (map_lift : ∀ (j : J) (hj : Order.IsSuccLimit j) (x : ↑(⋯.functor.op.comp F).sections) (i : J) (hi : i < j), (CategoryTheory.ConcreteCategory.hom (F.map (CategoryTheory.homOfLE ⋯).op)) (lift j hj x) = ↑x (Opposite.op ⟨i, hi⟩)) : F.WellOrderInductionData - 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.HasLiftingProperty.transfiniteComposition.SqStruct.sq 📋 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} {X Y : C} {p : X ⟶ Y} {f : F.obj ⊥ ⟶ X} {g : c.pt ⟶ Y} {j : J} (sq' : CategoryTheory.HasLiftingProperty.transfiniteComposition.SqStruct c p f g j) [SuccOrder J] : CategoryTheory.CommSq sq'.f' (F.map (CategoryTheory.homOfLE ⋯)) p (CategoryTheory.CategoryStruct.comp (c.ι.app (Order.succ j)) g) - CategoryTheory.HasLiftingProperty.transfiniteComposition.wellOrderInductionData 📋 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) {X Y : C} {p : X ⟶ Y} (f : F.obj ⊥ ⟶ X) (g : c.pt ⟶ Y) [F.IsWellOrderContinuous] [SuccOrder J] (hF : ∀ (j : J), ¬IsMax j → CategoryTheory.HasLiftingPropertyFixedBot (F.map (CategoryTheory.homOfLE ⋯)) p (CategoryTheory.CategoryStruct.comp (c.ι.app (Order.succ j)) g)) : (CategoryTheory.HasLiftingProperty.transfiniteComposition.sqFunctor c p f g).WellOrderInductionData - CategoryTheory.HasLiftingProperty.transfiniteComposition.hasLiftingPropertyFixedBot_ι_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} {g : c.pt ⟶ Y} [F.IsWellOrderContinuous] [SuccOrder J] [WellFoundedLT J] (hF : ∀ (j : J), ¬IsMax j → CategoryTheory.HasLiftingPropertyFixedBot (F.map (CategoryTheory.homOfLE ⋯)) p (CategoryTheory.CategoryStruct.comp (c.ι.app (Order.succ j)) g)) : CategoryTheory.HasLiftingPropertyFixedBot (c.ι.app ⊥) p g - CategoryTheory.HasLiftingProperty.transfiniteComposition.hasLift 📋 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 : F.obj ⊥ ⟶ X} {g : c.pt ⟶ Y} [F.IsWellOrderContinuous] [SuccOrder J] [WellFoundedLT J] (hF : ∀ (j : J), ¬IsMax j → CategoryTheory.HasLiftingPropertyFixedBot (F.map (CategoryTheory.homOfLE ⋯)) p (CategoryTheory.CategoryStruct.comp (c.ι.app (Order.succ j)) g)) (sq : CategoryTheory.CommSq f (c.ι.app ⊥) p g) : sq.HasLift - HomotopicalAlgebra.RelativeCellComplex.mk 📋 Mathlib.AlgebraicTopology.RelativeCellComplex.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w'} [LinearOrder J] [OrderBot J] [SuccOrder J] [WellFoundedLT J] {α : J → Type t} {A B : (j : J) → α j → C} {basicCell : (j : J) → (i : α j) → A j i ⟶ B j i} {X Y : C} {f : X ⟶ Y} (toTransfiniteCompositionOfShape : CategoryTheory.TransfiniteCompositionOfShape J f) (attachCells : (j : J) → ¬IsMax j → HomotopicalAlgebra.AttachCells (basicCell j) (toTransfiniteCompositionOfShape.F.map (CategoryTheory.homOfLE ⋯))) : HomotopicalAlgebra.RelativeCellComplex basicCell f - HomotopicalAlgebra.RelativeCellComplex.attachCells 📋 Mathlib.AlgebraicTopology.RelativeCellComplex.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w'} [LinearOrder J] [OrderBot J] [SuccOrder J] [WellFoundedLT J] {α : J → Type t} {A B : (j : J) → α j → C} {basicCell : (j : J) → (i : α j) → A j i ⟶ B j i} {X Y : C} {f : X ⟶ Y} (self : HomotopicalAlgebra.RelativeCellComplex basicCell f) (j : J) (hj : ¬IsMax j) : HomotopicalAlgebra.AttachCells (basicCell j) (self.F.map (CategoryTheory.homOfLE ⋯)) - HomotopicalAlgebra.RelativeCellComplex.Cells.mk 📋 Mathlib.AlgebraicTopology.RelativeCellComplex.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w'} [LinearOrder J] [OrderBot J] [SuccOrder J] [WellFoundedLT J] {α : J → Type t} {A B : (j : J) → α j → C} {basicCell : (j : J) → (i : α j) → A j i ⟶ B j i} {X Y : C} {f : X ⟶ Y} {c : HomotopicalAlgebra.RelativeCellComplex basicCell f} (j : J) (hj : ¬IsMax j) (k : (c.attachCells j hj).ι) : c.Cells - HomotopicalAlgebra.RelativeCellComplex.Cells.k 📋 Mathlib.AlgebraicTopology.RelativeCellComplex.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w'} [LinearOrder J] [OrderBot J] [SuccOrder J] [WellFoundedLT J] {α : J → Type t} {A B : (j : J) → α j → C} {basicCell : (j : J) → (i : α j) → A j i ⟶ B j i} {X Y : C} {f : X ⟶ Y} {c : HomotopicalAlgebra.RelativeCellComplex basicCell f} (self : c.Cells) : (c.attachCells self.j ⋯).ι - CategoryTheory.SmallObject.prop_iterationFunctor_map_succ 📋 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 κ] (j : κ.ord.ToType) : (CategoryTheory.SmallObject.succStruct I κ).prop ((CategoryTheory.SmallObject.iterationFunctor I κ).map (CategoryTheory.homOfLE ⋯)) - CategoryTheory.SmallObject.iterationFunctorMapSuccAppArrowIso 📋 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 κ] (f : CategoryTheory.Arrow C) (j : κ.ord.ToType) : CategoryTheory.Arrow.mk (((CategoryTheory.SmallObject.iterationFunctor I κ).map (CategoryTheory.homOfLE ⋯)).app f) ≅ CategoryTheory.Arrow.mk ((CategoryTheory.SmallObject.ε I.homFamily).app (((CategoryTheory.SmallObject.iterationFunctor I κ).obj j).obj f)) - CategoryTheory.SmallObject.iterationFunctorMapSuccAppArrowIso_hom_left 📋 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 κ] (f : CategoryTheory.Arrow C) (j : κ.ord.ToType) : CategoryTheory.Arrow.Hom.left (CategoryTheory.SmallObject.iterationFunctorMapSuccAppArrowIso I κ f j).hom = CategoryTheory.CategoryStruct.id (CategoryTheory.Arrow.mk (((CategoryTheory.SmallObject.iterationFunctor I κ).map (CategoryTheory.homOfLE ⋯)).app f)).left - CategoryTheory.SmallObject.iterationFunctorMapSuccAppArrowIso_hom_right_right_comp_assoc 📋 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 κ] (f : CategoryTheory.Arrow C) (j : κ.ord.ToType) {Z : C} (h : (((CategoryTheory.SmallObject.iterationFunctor I κ).obj (Order.succ j)).obj f).right ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Arrow.Hom.right (CategoryTheory.Arrow.Hom.right (CategoryTheory.SmallObject.iterationFunctorMapSuccAppArrowIso I κ f j).hom)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Arrow.Hom.right (((CategoryTheory.SmallObject.iterationFunctor I κ).map (CategoryTheory.homOfLE ⋯)).app f)) h) = h - CategoryTheory.SmallObject.iterationFunctorMapSuccAppArrowIso_hom_right_right_comp 📋 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 κ] (f : CategoryTheory.Arrow C) (j : κ.ord.ToType) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Arrow.Hom.right (CategoryTheory.Arrow.Hom.right (CategoryTheory.SmallObject.iterationFunctorMapSuccAppArrowIso I κ f j).hom)) (CategoryTheory.Arrow.Hom.right (((CategoryTheory.SmallObject.iterationFunctor I κ).map (CategoryTheory.homOfLE ⋯)).app f)) = CategoryTheory.CategoryStruct.id (CategoryTheory.Arrow.mk (((CategoryTheory.SmallObject.iterationFunctor I κ).map (CategoryTheory.homOfLE ⋯)).app f)).right.right - CategoryTheory.SmallObject.ιFunctorObj_eq 📋 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 : C} (f : X ⟶ Y) (j : κ.ord.ToType) : CategoryTheory.SmallObject.ιFunctorObj I.homFamily (((CategoryTheory.SmallObject.iterationFunctor I κ).obj j).obj (CategoryTheory.Arrow.mk f)).hom = CategoryTheory.CategoryStruct.comp ((CategoryTheory.SmallObject.relativeCellComplexιObj I κ f).F.map (CategoryTheory.homOfLE ⋯)) (CategoryTheory.SmallObject.relativeCellComplexιObjFObjSuccIso I κ f j).hom - SSet.Subcomplex.Pairing.RankFunction.isPullback 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] [SuccOrder ι] [NoMaxOrder ι] (j : ι) : CategoryTheory.IsPullback (f.t j) (f.m j) (SSet.Subcomplex.homOfLE ⋯) (f.b j) - SSet.Subcomplex.Pairing.RankFunction.isPushout 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] [SuccOrder ι] [NoMaxOrder ι] (j : ι) : CategoryTheory.IsPushout (f.t j) (f.m j) (SSet.Subcomplex.homOfLE ⋯) (f.b j) - SSet.Subcomplex.Pairing.RankFunction.w 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] [SuccOrder ι] [NoMaxOrder ι] (j : ι) : CategoryTheory.CategoryStruct.comp (f.t j) (SSet.Subcomplex.homOfLE ⋯) = CategoryTheory.CategoryStruct.comp (f.m j) (f.b j) - SSet.Subcomplex.Pairing.RankFunction.w_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] [SuccOrder ι] [NoMaxOrder ι] (j : ι) {Z : SSet} (h : (f.filtration (Order.succ j)).toSSet ⟶ Z) : CategoryTheory.CategoryStruct.comp (f.t j) (CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.homOfLE ⋯) h) = CategoryTheory.CategoryStruct.comp (f.m j) (CategoryTheory.CategoryStruct.comp (f.b j) h) - SSet.Subcomplex.Pairing.RankFunction.range_homOfLE_app_union_range_b_app 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] [SuccOrder ι] [NoMaxOrder ι] (j : ι) (d : SimplexCategoryᵒᵖ) : Set.range ⇑(CategoryTheory.ConcreteCategory.hom ((SSet.Subcomplex.homOfLE ⋯).app d)) ⊔ Set.range ⇑(CategoryTheory.ConcreteCategory.hom ((f.b j).app d)) = Set.univ - CategoryTheory.OrthogonalReflection.iteration_map_succ_surjectivity 📋 Mathlib.CategoryTheory.Presentable.OrthogonalReflection
{C : Type u} [CategoryTheory.Category.{v, u} C] {W : CategoryTheory.MorphismProperty C} {Z : C} [CategoryTheory.Limits.HasPushouts C] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₁] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₂] [∀ (Z : C), CategoryTheory.Limits.HasMulticoequalizer (CategoryTheory.OrthogonalReflection.D₂.multispanIndex W Z)] {κ : Cardinal.{w}} [OrderBot κ.ord.ToType] [CategoryTheory.Limits.HasIterationOfShape κ.ord.ToType C] [Fact κ.IsRegular] {X Y : C} (f : X ⟶ Y) (hf : W f) {j : κ.ord.ToType} (g : X ⟶ (CategoryTheory.OrthogonalReflection.iteration W Z κ).obj j) : ∃ g', CategoryTheory.CategoryStruct.comp f g' = CategoryTheory.CategoryStruct.comp g ((CategoryTheory.OrthogonalReflection.iteration W Z κ).map (CategoryTheory.homOfLE ⋯)) - CategoryTheory.OrthogonalReflection.iteration_map_succ_injectivity 📋 Mathlib.CategoryTheory.Presentable.OrthogonalReflection
{C : Type u} [CategoryTheory.Category.{v, u} C] {W : CategoryTheory.MorphismProperty C} {Z : C} [CategoryTheory.Limits.HasPushouts C] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₁] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₂] [∀ (Z : C), CategoryTheory.Limits.HasMulticoequalizer (CategoryTheory.OrthogonalReflection.D₂.multispanIndex W Z)] {κ : Cardinal.{w}} [OrderBot κ.ord.ToType] [CategoryTheory.Limits.HasIterationOfShape κ.ord.ToType C] [Fact κ.IsRegular] {X Y : C} (f : X ⟶ Y) (hf : W f) {j : κ.ord.ToType} (g₁ g₂ : Y ⟶ (CategoryTheory.OrthogonalReflection.iteration W Z κ).obj j) (hg : CategoryTheory.CategoryStruct.comp f g₁ = CategoryTheory.CategoryStruct.comp f g₂) : CategoryTheory.CategoryStruct.comp g₁ ((CategoryTheory.OrthogonalReflection.iteration W Z κ).map (CategoryTheory.homOfLE ⋯)) = CategoryTheory.CategoryStruct.comp g₂ ((CategoryTheory.OrthogonalReflection.iteration W Z κ).map (CategoryTheory.homOfLE ⋯)) - CategoryTheory.OrthogonalReflection.iteration_map_succ 📋 Mathlib.CategoryTheory.Presentable.OrthogonalReflection
{C : Type u} [CategoryTheory.Category.{v, u} C] (W : CategoryTheory.MorphismProperty C) (Z : C) [CategoryTheory.Limits.HasPushouts C] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₁] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₂] [∀ (Z : C), CategoryTheory.Limits.HasMulticoequalizer (CategoryTheory.OrthogonalReflection.D₂.multispanIndex W Z)] (κ : Cardinal.{w}) [OrderBot κ.ord.ToType] [CategoryTheory.Limits.HasIterationOfShape κ.ord.ToType C] [Fact κ.IsRegular] (j : κ.ord.ToType) : (CategoryTheory.OrthogonalReflection.iteration W Z κ).map (CategoryTheory.homOfLE ⋯) = CategoryTheory.CategoryStruct.comp (CategoryTheory.OrthogonalReflection.toSucc W ((CategoryTheory.OrthogonalReflection.iteration W Z κ).obj j)) (CategoryTheory.OrthogonalReflection.iterationObjSuccIso W Z κ j).inv - CategoryTheory.OrthogonalReflection.iteration_map_succ_assoc 📋 Mathlib.CategoryTheory.Presentable.OrthogonalReflection
{C : Type u} [CategoryTheory.Category.{v, u} C] (W : CategoryTheory.MorphismProperty C) (Z : C) [CategoryTheory.Limits.HasPushouts C] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₁] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₂] [∀ (Z : C), CategoryTheory.Limits.HasMulticoequalizer (CategoryTheory.OrthogonalReflection.D₂.multispanIndex W Z)] (κ : Cardinal.{w}) [OrderBot κ.ord.ToType] [CategoryTheory.Limits.HasIterationOfShape κ.ord.ToType C] [Fact κ.IsRegular] (j : κ.ord.ToType) {Z✝ : C} (h : (CategoryTheory.OrthogonalReflection.iteration W Z κ).obj (Order.succ j) ⟶ Z✝) : CategoryTheory.CategoryStruct.comp ((CategoryTheory.OrthogonalReflection.iteration W Z κ).map (CategoryTheory.homOfLE ⋯)) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.OrthogonalReflection.toStep W ((CategoryTheory.OrthogonalReflection.iteration W Z κ).obj j)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.OrthogonalReflection.fromStep W ((CategoryTheory.OrthogonalReflection.iteration W Z κ).obj j)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.OrthogonalReflection.iterationObjSuccIso W Z κ j).inv h)) - Field.Emb.Cardinal.equivSucc_coherence 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] (i : WithTop (Module.rank F E).ord.ToType) (f : ↥(Field.Emb.Cardinal.filtration (Order.succ i)) →ₐ[F] AlgebraicClosure E) : ((Field.Emb.Cardinal.equivSucc i) f).1 = Field.Emb.Cardinal.embFunctor F E ⋯ f - Field.Emb.Cardinal.succEquiv_coherence 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] (i : (Module.rank F E).ord.ToType) (f : ↥(IntermediateField.adjoin F (⇑(Field.Emb.Cardinal.wellOrderedBasis F E) ∘ Field.Emb.Cardinal.leastExt F E '' Set.Iio (Order.succ i))) →ₐ[F] AlgebraicClosure E) : ((Field.Emb.Cardinal.succEquiv i) f).1 = f.comp (Subalgebra.inclusion ⋯)
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
🔍_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
🔍Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
🔍(?a -> ?b) -> List ?a -> List ?b
🔍List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
🔍|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of all→and∀) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
🔍|- _ < _ → tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
⊢ (_ : Type _)finds all definitions which provide data while⊢ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision 69fae59