Loogle!
Result
Found 34 declarations mentioning SSet.Truncated.Edge.CompStruct.
- SSet.Truncated.Edge.CompStruct.idCompId 📋 Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} (x : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })) : (SSet.Truncated.Edge.id x).CompStruct (SSet.Truncated.Edge.id x) (SSet.Truncated.Edge.id x) - SSet.Truncated.Edge.CompStruct.compId 📋 Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} {x y : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} (e : SSet.Truncated.Edge x y) : e.CompStruct (SSet.Truncated.Edge.id y) e - SSet.Truncated.Edge.CompStruct.idComp 📋 Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} {x y : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} (e : SSet.Truncated.Edge x y) : (SSet.Truncated.Edge.id x).CompStruct e e - SSet.Truncated.Edge.CompStruct 📋 Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} {x₀ x₁ x₂ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} (e₀₁ : SSet.Truncated.Edge x₀ x₁) (e₁₂ : SSet.Truncated.Edge x₁ x₂) (e₀₂ : SSet.Truncated.Edge x₀ x₂) : Type u - SSet.Truncated.Edge.CompStruct.simplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} {x₀ x₁ x₂ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} {e₀₁ : SSet.Truncated.Edge x₀ x₁} {e₁₂ : SSet.Truncated.Edge x₁ x₂} {e₀₂ : SSet.Truncated.Edge x₀ x₂} (self : e₀₁.CompStruct e₁₂ e₀₂) : X.obj (Opposite.op { obj := { len := 2 }, property := SSet.Truncated.Edge.CompStruct._proof_1 }) - SSet.Truncated.Edge.CompStruct.ext 📋 Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} {x₀ x₁ x₂ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} {e₀₁ : SSet.Truncated.Edge x₀ x₁} {e₁₂ : SSet.Truncated.Edge x₁ x₂} {e₀₂ : SSet.Truncated.Edge x₀ x₂} {x y : e₀₁.CompStruct e₁₂ e₀₂} (simplex : x.simplex = y.simplex) : x = y - SSet.Truncated.Edge.CompStruct.ext_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} {x₀ x₁ x₂ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} {e₀₁ : SSet.Truncated.Edge x₀ x₁} {e₁₂ : SSet.Truncated.Edge x₁ x₂} {e₀₂ : SSet.Truncated.Edge x₀ x₂} {x y : e₀₁.CompStruct e₁₂ e₀₂} : x = y ↔ x.simplex = y.simplex - SSet.Truncated.Edge.CompStruct.exists_of_simplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} (s : X.obj (Opposite.op { obj := { len := 2 }, property := SSet.Truncated.Edge.CompStruct._proof_1 })) : ∃ x₀ x₁ x₂ e₀₁ e₁₂ e₀₂ h, h.simplex = s - SSet.Truncated.Edge.CompStruct.d₀ 📋 Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} {x₀ x₁ x₂ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} {e₀₁ : SSet.Truncated.Edge x₀ x₁} {e₁₂ : SSet.Truncated.Edge x₁ x₂} {e₀₂ : SSet.Truncated.Edge x₀ x₂} (self : e₀₁.CompStruct e₁₂ e₀₂) : (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.δ₂ 0 SSet.Truncated.Edge._proof_2 SSet.Truncated.Edge.CompStruct._proof_2).op)) self.simplex = e₁₂.edge - SSet.Truncated.Edge.CompStruct.d₁ 📋 Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} {x₀ x₁ x₂ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} {e₀₁ : SSet.Truncated.Edge x₀ x₁} {e₁₂ : SSet.Truncated.Edge x₁ x₂} {e₀₂ : SSet.Truncated.Edge x₀ x₂} (self : e₀₁.CompStruct e₁₂ e₀₂) : (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.δ₂ 1 SSet.Truncated.Edge._proof_2 SSet.Truncated.Edge.CompStruct._proof_2).op)) self.simplex = e₀₂.edge - SSet.Truncated.Edge.CompStruct.d₂ 📋 Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} {x₀ x₁ x₂ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} {e₀₁ : SSet.Truncated.Edge x₀ x₁} {e₁₂ : SSet.Truncated.Edge x₁ x₂} {e₀₂ : SSet.Truncated.Edge x₀ x₂} (self : e₀₁.CompStruct e₁₂ e₀₂) : (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.δ₂ 2 SSet.Truncated.Edge._proof_2 SSet.Truncated.Edge.CompStruct._proof_2).op)) self.simplex = e₀₁.edge - SSet.Truncated.Edge.CompStruct.map 📋 Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X Y : SSet.Truncated 2} {x₀ x₁ x₂ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} {e₀₁ : SSet.Truncated.Edge x₀ x₁} {e₁₂ : SSet.Truncated.Edge x₁ x₂} {e₀₂ : SSet.Truncated.Edge x₀ x₂} (h : e₀₁.CompStruct e₁₂ e₀₂) (f : X ⟶ Y) : (e₀₁.map f).CompStruct (e₁₂.map f) (e₀₂.map f) - SSet.Truncated.Edge.CompStruct.map_simplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X Y : SSet.Truncated 2} {x₀ x₁ x₂ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} {e₀₁ : SSet.Truncated.Edge x₀ x₁} {e₁₂ : SSet.Truncated.Edge x₁ x₂} {e₀₂ : SSet.Truncated.Edge x₀ x₂} (h : e₀₁.CompStruct e₁₂ e₀₂) (f : X ⟶ Y) : (h.map f).simplex = (CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op { obj := { len := 2 }, property := SSet.Truncated.Edge.CompStruct._proof_1 }))) h.simplex - SSet.Truncated.Edge.CompStruct.mk 📋 Mathlib.AlgebraicTopology.SimplicialSet.CompStructTruncated
{X : SSet.Truncated 2} {x₀ x₁ x₂ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })} {e₀₁ : SSet.Truncated.Edge x₀ x₁} {e₁₂ : SSet.Truncated.Edge x₁ x₂} {e₀₂ : SSet.Truncated.Edge x₀ x₂} (simplex : X.obj (Opposite.op { obj := { len := 2 }, property := SSet.Truncated.Edge.CompStruct._proof_1 })) (d₂ : (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.δ₂ 2 SSet.Truncated.Edge._proof_2 SSet.Truncated.Edge.CompStruct._proof_2).op)) simplex = e₀₁.edge := by cat_disch) (d₀ : (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.δ₂ 0 SSet.Truncated.Edge._proof_2 SSet.Truncated.Edge.CompStruct._proof_2).op)) simplex = e₁₂.edge := by cat_disch) (d₁ : (CategoryTheory.ConcreteCategory.hom (X.map (SimplexCategory.Truncated.δ₂ 1 SSet.Truncated.Edge._proof_2 SSet.Truncated.Edge.CompStruct._proof_2).op)) simplex = e₀₂.edge := by cat_disch) : e₀₁.CompStruct e₁₂ e₀₂ - SSet.Edge.CompStruct.ofTruncated 📋 Mathlib.AlgebraicTopology.SimplicialSet.CompStruct
{X : SSet} {x₀ x₁ x₂ : X.obj (Opposite.op { len := 0 })} {e₀₁ : SSet.Edge x₀ x₁} {e₁₂ : SSet.Edge x₁ x₂} {e₀₂ : SSet.Edge x₀ x₂} (h : e₀₁.toTruncated.CompStruct e₁₂.toTruncated e₀₂.toTruncated) : e₀₁.CompStruct e₁₂ e₀₂ - SSet.Edge.CompStruct.toTruncated 📋 Mathlib.AlgebraicTopology.SimplicialSet.CompStruct
{X : SSet} {x₀ x₁ x₂ : X.obj (Opposite.op { len := 0 })} {e₀₁ : SSet.Edge x₀ x₁} {e₁₂ : SSet.Edge x₁ x₂} {e₀₂ : SSet.Edge x₀ x₂} (h : e₀₁.CompStruct e₁₂ e₀₂) : e₀₁.toTruncated.CompStruct e₁₂.toTruncated e₀₂.toTruncated - SSet.Truncated.HomotopyCategory.homMk_comp_homMk 📋 Mathlib.AlgebraicTopology.SimplicialSet.HomotopyCat
{V : SSet.Truncated 2} {x₀ x₁ x₂ : V.obj (Opposite.op { obj := { len := 0 }, property := SSet.OneTruncation₂._proof_1 })} {e₀₁ : SSet.Truncated.Edge x₀ x₁} {e₁₂ : SSet.Truncated.Edge x₁ x₂} {e₀₂ : SSet.Truncated.Edge x₀ x₂} (h : e₀₁.CompStruct e₁₂ e₀₂) : CategoryTheory.CategoryStruct.comp (SSet.Truncated.HomotopyCategory.homMk e₀₁) (SSet.Truncated.HomotopyCategory.homMk e₁₂) = SSet.Truncated.HomotopyCategory.homMk e₀₂ - SSet.Truncated.HomotopyCategory.homMk_comp_homMk_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HomotopyCat
{V : SSet.Truncated 2} {x₀ x₁ x₂ : V.obj (Opposite.op { obj := { len := 0 }, property := SSet.OneTruncation₂._proof_1 })} {e₀₁ : SSet.Truncated.Edge x₀ x₁} {e₁₂ : SSet.Truncated.Edge x₁ x₂} {e₀₂ : SSet.Truncated.Edge x₀ x₂} (h : e₀₁.CompStruct e₁₂ e₀₂) {Z : V.HomotopyCategory} (h✝ : SSet.Truncated.HomotopyCategory.mk x₂ ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.Truncated.HomotopyCategory.homMk e₀₁) (CategoryTheory.CategoryStruct.comp (SSet.Truncated.HomotopyCategory.homMk e₁₂) h✝) = CategoryTheory.CategoryStruct.comp (SSet.Truncated.HomotopyCategory.homMk e₀₂) h✝ - SSet.OneTruncation₂.HoRel₂.of_compStruct 📋 Mathlib.AlgebraicTopology.SimplicialSet.HomotopyCat
{V : SSet.Truncated 2} {x₀ x₁ x₂ : V.obj (Opposite.op { obj := { len := 0 }, property := SSet.OneTruncation₂._proof_1 })} {e₀₁ : SSet.Truncated.Edge x₀ x₁} {e₁₂ : SSet.Truncated.Edge x₁ x₂} {e₀₂ : SSet.Truncated.Edge x₀ x₂} (h : e₀₁.CompStruct e₁₂ e₀₂) : SSet.OneTruncation₂.HoRel₂ V ((CategoryTheory.Cat.FreeRefl.quotientFunctor (SSet.OneTruncation₂ V)).map (CategoryTheory.CategoryStruct.comp (Quiver.Hom.toPath e₀₁) (Quiver.Hom.toPath e₁₂))) ((CategoryTheory.Cat.FreeRefl.quotientFunctor (SSet.OneTruncation₂ V)).map (Quiver.Hom.toPath e₀₂)) - SSet.Truncated.HomotopyCategory.lift 📋 Mathlib.AlgebraicTopology.SimplicialSet.HomotopyCat
{V : SSet.Truncated 2} {D : Type u_1} [CategoryTheory.Category.{v_1, u_1} D] (obj : V.obj (Opposite.op { obj := { len := 0 }, property := SSet.OneTruncation₂._proof_1 }) → D) (map : {x y : V.obj (Opposite.op { obj := { len := 0 }, property := SSet.OneTruncation₂._proof_1 })} → SSet.Truncated.Edge x y → (obj x ⟶ obj y)) (map_id : ∀ (x : V.obj (Opposite.op { obj := { len := 0 }, property := SSet.OneTruncation₂._proof_1 })), map (SSet.Truncated.Edge.id x) = CategoryTheory.CategoryStruct.id (obj x)) (map_comp : ∀ {x₀ x₁ x₂ : V.obj (Opposite.op { obj := { len := 0 }, property := SSet.OneTruncation₂._proof_1 })} {e₀₁ : SSet.Truncated.Edge x₀ x₁} {e₁₂ : SSet.Truncated.Edge x₁ x₂} {e₀₂ : SSet.Truncated.Edge x₀ x₂} (x : e₀₁.CompStruct e₁₂ e₀₂), CategoryTheory.CategoryStruct.comp (map e₀₁) (map e₁₂) = map e₀₂) : CategoryTheory.Functor V.HomotopyCategory D - SSet.Truncated.HomotopyCategory.lift_obj_mk 📋 Mathlib.AlgebraicTopology.SimplicialSet.HomotopyCat
{V : SSet.Truncated 2} {D : Type u_1} [CategoryTheory.Category.{v_1, u_1} D] (obj : V.obj (Opposite.op { obj := { len := 0 }, property := SSet.OneTruncation₂._proof_1 }) → D) (map : {x y : V.obj (Opposite.op { obj := { len := 0 }, property := SSet.OneTruncation₂._proof_1 })} → SSet.Truncated.Edge x y → (obj x ⟶ obj y)) (map_id : ∀ (x : V.obj (Opposite.op { obj := { len := 0 }, property := SSet.OneTruncation₂._proof_1 })), map (SSet.Truncated.Edge.id x) = CategoryTheory.CategoryStruct.id (obj x)) (map_comp : ∀ {x₀ x₁ x₂ : V.obj (Opposite.op { obj := { len := 0 }, property := SSet.OneTruncation₂._proof_1 })} {e₀₁ : SSet.Truncated.Edge x₀ x₁} {e₁₂ : SSet.Truncated.Edge x₁ x₂} {e₀₂ : SSet.Truncated.Edge x₀ x₂} (x : e₀₁.CompStruct e₁₂ e₀₂), CategoryTheory.CategoryStruct.comp (map e₀₁) (map e₁₂) = map e₀₂) (x : V.obj (Opposite.op { obj := { len := 0 }, property := SSet.OneTruncation₂._proof_1 })) : (SSet.Truncated.HomotopyCategory.lift obj (fun {x y} => map) map_id ⋯).obj (SSet.Truncated.HomotopyCategory.mk x) = obj x - SSet.Truncated.HomotopyCategory.lift_map_homMk 📋 Mathlib.AlgebraicTopology.SimplicialSet.HomotopyCat
{V : SSet.Truncated 2} {D : Type u_1} [CategoryTheory.Category.{v_1, u_1} D] (obj : V.obj (Opposite.op { obj := { len := 0 }, property := SSet.OneTruncation₂._proof_1 }) → D) (map : {x y : V.obj (Opposite.op { obj := { len := 0 }, property := SSet.OneTruncation₂._proof_1 })} → SSet.Truncated.Edge x y → (obj x ⟶ obj y)) (map_id : ∀ (x : V.obj (Opposite.op { obj := { len := 0 }, property := SSet.OneTruncation₂._proof_1 })), map (SSet.Truncated.Edge.id x) = CategoryTheory.CategoryStruct.id (obj x)) (map_comp : ∀ {x₀ x₁ x₂ : V.obj (Opposite.op { obj := { len := 0 }, property := SSet.OneTruncation₂._proof_1 })} {e₀₁ : SSet.Truncated.Edge x₀ x₁} {e₁₂ : SSet.Truncated.Edge x₁ x₂} {e₀₂ : SSet.Truncated.Edge x₀ x₂} (x : e₀₁.CompStruct e₁₂ e₀₂), CategoryTheory.CategoryStruct.comp (map e₀₁) (map e₁₂) = map e₀₂) {x y : V.obj (Opposite.op { obj := { len := 0 }, property := SSet.OneTruncation₂._proof_1 })} (e : SSet.Truncated.Edge x y) : (SSet.Truncated.HomotopyCategory.lift obj (fun {x y} => map) map_id ⋯).map (SSet.Truncated.HomotopyCategory.homMk e) = map e - SSet.Truncated.Edge.CompStruct.tensor 📋 Mathlib.AlgebraicTopology.SimplicialSet.HoFunctorMonoidal
{X Y : SSet.Truncated 2} {x₀ x₁ x₂ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge.tensor._proof_1 })} {e₀₁ : SSet.Truncated.Edge x₀ x₁} {e₁₂ : SSet.Truncated.Edge x₁ x₂} {e₀₂ : SSet.Truncated.Edge x₀ x₂} (hx : e₀₁.CompStruct e₁₂ e₀₂) {y₀ y₁ y₂ : Y.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge.tensor._proof_1 })} {e'₀₁ : SSet.Truncated.Edge y₀ y₁} {e'₁₂ : SSet.Truncated.Edge y₁ y₂} {e'₀₂ : SSet.Truncated.Edge y₀ y₂} (hy : e'₀₁.CompStruct e'₁₂ e'₀₂) : (e₀₁.tensor e'₀₁).CompStruct (e₁₂.tensor e'₁₂) (e₀₂.tensor e'₀₂) - SSet.Truncated.Edge.CompStruct.tensor_simplex_fst 📋 Mathlib.AlgebraicTopology.SimplicialSet.HoFunctorMonoidal
{X Y : SSet.Truncated 2} {x₀ x₁ x₂ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge.tensor._proof_1 })} {e₀₁ : SSet.Truncated.Edge x₀ x₁} {e₁₂ : SSet.Truncated.Edge x₁ x₂} {e₀₂ : SSet.Truncated.Edge x₀ x₂} (hx : e₀₁.CompStruct e₁₂ e₀₂) {y₀ y₁ y₂ : Y.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge.tensor._proof_1 })} {e'₀₁ : SSet.Truncated.Edge y₀ y₁} {e'₁₂ : SSet.Truncated.Edge y₁ y₂} {e'₀₂ : SSet.Truncated.Edge y₀ y₂} (hy : e'₀₁.CompStruct e'₁₂ e'₀₂) : (hx.tensor hy).simplex.1 = hx.simplex - SSet.Truncated.Edge.CompStruct.tensor_simplex_snd 📋 Mathlib.AlgebraicTopology.SimplicialSet.HoFunctorMonoidal
{X Y : SSet.Truncated 2} {x₀ x₁ x₂ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge.tensor._proof_1 })} {e₀₁ : SSet.Truncated.Edge x₀ x₁} {e₁₂ : SSet.Truncated.Edge x₁ x₂} {e₀₂ : SSet.Truncated.Edge x₀ x₂} (hx : e₀₁.CompStruct e₁₂ e₀₂) {y₀ y₁ y₂ : Y.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge.tensor._proof_1 })} {e'₀₁ : SSet.Truncated.Edge y₀ y₁} {e'₁₂ : SSet.Truncated.Edge y₁ y₂} {e'₀₂ : SSet.Truncated.Edge y₀ y₂} (hy : e'₀₁.CompStruct e'₁₂ e'₀₂) : (hx.tensor hy).simplex.2 = hy.simplex - SSet.Truncated.Edge.compStruct 📋 Mathlib.AlgebraicTopology.Quasicategory.TwoTruncated
{A : SSet.Truncated 2} [A.Quasicategory₂] {x y z : A.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Quasicategory₂._proof_1 })} (f : SSet.Truncated.Edge x y) (g : SSet.Truncated.Edge y z) : f.CompStruct g (f.comp g) - SSet.Truncated.Quasicategory₂.fill21 📋 Mathlib.AlgebraicTopology.Quasicategory.TwoTruncated
{X : SSet.Truncated 2} [self : X.Quasicategory₂] {x₀ x₁ x₂ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Quasicategory₂._proof_1 })} (e₀₁ : SSet.Truncated.Edge x₀ x₁) (e₁₂ : SSet.Truncated.Edge x₁ x₂) : Nonempty ((e₀₂ : SSet.Truncated.Edge x₀ x₂) × e₀₁.CompStruct e₁₂ e₀₂) - SSet.Truncated.Edge.CompStruct.comp_unique 📋 Mathlib.AlgebraicTopology.Quasicategory.TwoTruncated
{A : SSet.Truncated 2} [A.Quasicategory₂] {x y z : A.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Quasicategory₂._proof_1 })} {f f' : SSet.Truncated.Edge x y} {g g' : SSet.Truncated.Edge y z} {h h' : SSet.Truncated.Edge x z} (s : f.CompStruct g h) (s' : f'.CompStruct g' h') (hf : SSet.Truncated.HomotopicL f f') (hg : SSet.Truncated.HomotopicL g g') : SSet.Truncated.HomotopicL h h' - SSet.Truncated.Edge.CompStruct.homotopyCategory₂_fac 📋 Mathlib.AlgebraicTopology.Quasicategory.TwoTruncated
{A : SSet.Truncated 2} [A.Quasicategory₂] {x y z : A.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Quasicategory₂._proof_1 })} {f : SSet.Truncated.Edge x y} {g : SSet.Truncated.Edge y z} {h : SSet.Truncated.Edge x z} (s : f.CompStruct g h) : CategoryTheory.CategoryStruct.comp (SSet.Truncated.HomotopyCategory₂.homMk f) (SSet.Truncated.HomotopyCategory₂.homMk g) = SSet.Truncated.HomotopyCategory₂.homMk h - SSet.Truncated.Edge.CompStruct.ofHomotopyCategory₂Fac 📋 Mathlib.AlgebraicTopology.Quasicategory.TwoTruncated
{A : SSet.Truncated 2} [A.Quasicategory₂] {x y z : A.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Quasicategory₂._proof_1 })} {f : SSet.Truncated.Edge x y} {g : SSet.Truncated.Edge y z} {h : SSet.Truncated.Edge x z} (fac : CategoryTheory.CategoryStruct.comp (SSet.Truncated.HomotopyCategory₂.homMk f) (SSet.Truncated.HomotopyCategory₂.homMk g) = SSet.Truncated.HomotopyCategory₂.homMk h) : f.CompStruct g h - SSet.Truncated.Edge.CompStruct.nonempty_iff 📋 Mathlib.AlgebraicTopology.Quasicategory.TwoTruncated
{A : SSet.Truncated 2} [A.Quasicategory₂] {x y z : A.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Quasicategory₂._proof_1 })} {f : SSet.Truncated.Edge x y} {g : SSet.Truncated.Edge y z} {h : SSet.Truncated.Edge x z} : Nonempty (f.CompStruct g h) ↔ CategoryTheory.CategoryStruct.comp (SSet.Truncated.HomotopyCategory₂.homMk f) (SSet.Truncated.HomotopyCategory₂.homMk g) = SSet.Truncated.HomotopyCategory₂.homMk h - SSet.Truncated.Quasicategory₂.fill31 📋 Mathlib.AlgebraicTopology.Quasicategory.TwoTruncated
{X : SSet.Truncated 2} [self : X.Quasicategory₂] {x₀ x₁ x₂ x₃ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Quasicategory₂._proof_1 })} {e₀₁ : SSet.Truncated.Edge x₀ x₁} {e₁₂ : SSet.Truncated.Edge x₁ x₂} {e₂₃ : SSet.Truncated.Edge x₂ x₃} {e₀₂ : SSet.Truncated.Edge x₀ x₂} {e₁₃ : SSet.Truncated.Edge x₁ x₃} {e₀₃ : SSet.Truncated.Edge x₀ x₃} (f₃ : e₀₁.CompStruct e₁₂ e₀₂) (f₀ : e₁₂.CompStruct e₂₃ e₁₃) (f₂ : e₀₁.CompStruct e₁₃ e₀₃) : Nonempty (e₀₂.CompStruct e₂₃ e₀₃) - SSet.Truncated.Quasicategory₂.fill32 📋 Mathlib.AlgebraicTopology.Quasicategory.TwoTruncated
{X : SSet.Truncated 2} [self : X.Quasicategory₂] {x₀ x₁ x₂ x₃ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Quasicategory₂._proof_1 })} {e₀₁ : SSet.Truncated.Edge x₀ x₁} {e₁₂ : SSet.Truncated.Edge x₁ x₂} {e₂₃ : SSet.Truncated.Edge x₂ x₃} {e₀₂ : SSet.Truncated.Edge x₀ x₂} {e₁₃ : SSet.Truncated.Edge x₁ x₃} {e₀₃ : SSet.Truncated.Edge x₀ x₃} (f₃ : e₀₁.CompStruct e₁₂ e₀₂) (f₀ : e₁₂.CompStruct e₂₃ e₁₃) (f₁ : e₀₂.CompStruct e₂₃ e₀₃) : Nonempty (e₀₁.CompStruct e₁₃ e₀₃) - SSet.Truncated.Quasicategory₂.mk 📋 Mathlib.AlgebraicTopology.Quasicategory.TwoTruncated
{X : SSet.Truncated 2} (fill21 : ∀ {x₀ x₁ x₂ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Quasicategory₂._proof_1 })} (e₀₁ : SSet.Truncated.Edge x₀ x₁) (e₁₂ : SSet.Truncated.Edge x₁ x₂), Nonempty ((e₀₂ : SSet.Truncated.Edge x₀ x₂) × e₀₁.CompStruct e₁₂ e₀₂)) (fill31 : ∀ {x₀ x₁ x₂ x₃ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Quasicategory₂._proof_1 })} {e₀₁ : SSet.Truncated.Edge x₀ x₁} {e₁₂ : SSet.Truncated.Edge x₁ x₂} {e₂₃ : SSet.Truncated.Edge x₂ x₃} {e₀₂ : SSet.Truncated.Edge x₀ x₂} {e₁₃ : SSet.Truncated.Edge x₁ x₃} {e₀₃ : SSet.Truncated.Edge x₀ x₃} (f₃ : e₀₁.CompStruct e₁₂ e₀₂) (f₀ : e₁₂.CompStruct e₂₃ e₁₃) (f₂ : e₀₁.CompStruct e₁₃ e₀₃), Nonempty (e₀₂.CompStruct e₂₃ e₀₃)) (fill32 : ∀ {x₀ x₁ x₂ x₃ : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Quasicategory₂._proof_1 })} {e₀₁ : SSet.Truncated.Edge x₀ x₁} {e₁₂ : SSet.Truncated.Edge x₁ x₂} {e₂₃ : SSet.Truncated.Edge x₂ x₃} {e₀₂ : SSet.Truncated.Edge x₀ x₂} {e₁₃ : SSet.Truncated.Edge x₁ x₃} {e₀₃ : SSet.Truncated.Edge x₀ x₃} (f₃ : e₀₁.CompStruct e₁₂ e₀₂) (f₀ : e₁₂.CompStruct e₂₃ e₁₃) (f₁ : e₀₂.CompStruct e₂₃ e₀₃), Nonempty (e₀₁.CompStruct e₁₃ e₀₃)) : X.Quasicategory₂
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