Loogle!
Result
Found 127 declarations mentioning CategoryTheory.Paths.
- CategoryTheory.Paths π Mathlib.CategoryTheory.PathCategory.Basic
(V : Type uβ) : Type uβ - CategoryTheory.instInhabitedPaths π Mathlib.CategoryTheory.PathCategory.Basic
(V : Type uβ) [Inhabited V] : Inhabited (CategoryTheory.Paths V) - CategoryTheory.instUniquePaths π Mathlib.CategoryTheory.PathCategory.Basic
(V : Type uβ) [Unique V] : Unique (CategoryTheory.Paths V) - CategoryTheory.Paths.categoryPaths π Mathlib.CategoryTheory.PathCategory.Basic
(V : Type uβ) [Quiver V] : CategoryTheory.Category.{max uβ vβ, uβ} (CategoryTheory.Paths V) - CategoryTheory.pathComposition π Mathlib.CategoryTheory.PathCategory.Basic
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] : CategoryTheory.Functor (CategoryTheory.Paths C) C - CategoryTheory.Paths.of π Mathlib.CategoryTheory.PathCategory.Basic
(V : Type uβ) [Quiver V] : V β₯€q CategoryTheory.Paths V - CategoryTheory.pathsHomRel π Mathlib.CategoryTheory.PathCategory.Basic
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] : HomRel (CategoryTheory.Paths C) - CategoryTheory.Paths.lift π Mathlib.CategoryTheory.PathCategory.Basic
{V : Type uβ} [Quiver V] {C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (Ο : V β₯€q C) : CategoryTheory.Functor (CategoryTheory.Paths V) C - CategoryTheory.pathComposition_obj π Mathlib.CategoryTheory.PathCategory.Basic
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] (X : CategoryTheory.Paths C) : (CategoryTheory.pathComposition C).obj X = X - CategoryTheory.Paths.of_obj π Mathlib.CategoryTheory.PathCategory.Basic
(V : Type uβ) [Quiver V] (X : V) : (CategoryTheory.Paths.of V).obj X = X - CategoryTheory.quotientPathsEquiv π Mathlib.CategoryTheory.PathCategory.Basic
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] : CategoryTheory.Quotient (CategoryTheory.pathsHomRel C) β C - CategoryTheory.quotientPathsTo π Mathlib.CategoryTheory.PathCategory.Basic
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] : CategoryTheory.Functor (CategoryTheory.Quotient (CategoryTheory.pathsHomRel C)) C - CategoryTheory.toQuotientPaths π Mathlib.CategoryTheory.PathCategory.Basic
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] : CategoryTheory.Functor C (CategoryTheory.Quotient (CategoryTheory.pathsHomRel C)) - CategoryTheory.composePath_id π Mathlib.CategoryTheory.PathCategory.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : CategoryTheory.Paths C} : CategoryTheory.composePath (CategoryTheory.CategoryStruct.id X) = CategoryTheory.CategoryStruct.id (have this := X; this) - CategoryTheory.Paths.of_map π Mathlib.CategoryTheory.PathCategory.Basic
(V : Type uβ) [Quiver V] {Xβ Yβ : V} (f : Xβ βΆ Yβ) : (CategoryTheory.Paths.of V).map f = f.toPath - CategoryTheory.toQuotientPaths_obj_as π Mathlib.CategoryTheory.PathCategory.Basic
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] (X : C) : ((CategoryTheory.toQuotientPaths C).obj X).as = X - CategoryTheory.pathComposition_map π Mathlib.CategoryTheory.PathCategory.Basic
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] {Xβ Yβ : CategoryTheory.Paths C} (f : Xβ βΆ Yβ) : (CategoryTheory.pathComposition C).map f = CategoryTheory.composePath f - CategoryTheory.Paths.lift_spec π Mathlib.CategoryTheory.PathCategory.Basic
{V : Type uβ} [Quiver V] {C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (Ο : V β₯€q C) : CategoryTheory.Paths.of V βq (CategoryTheory.Paths.lift Ο).toPrefunctor = Ο - CategoryTheory.quotientPathsTo_obj π Mathlib.CategoryTheory.PathCategory.Basic
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] (a : CategoryTheory.Quotient (CategoryTheory.pathsHomRel C)) : (CategoryTheory.quotientPathsTo C).obj a = a.as - CategoryTheory.Paths.lift_unique π Mathlib.CategoryTheory.PathCategory.Basic
{V : Type uβ} [Quiver V] {C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (Ο : V β₯€q C) (Ξ¦ : CategoryTheory.Functor (CategoryTheory.Paths V) C) (hΞ¦ : CategoryTheory.Paths.of V βq Ξ¦.toPrefunctor = Ο) : Ξ¦ = CategoryTheory.Paths.lift Ο - CategoryTheory.Paths.lift_nil π Mathlib.CategoryTheory.PathCategory.Basic
{V : Type uβ} [Quiver V] {C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (Ο : V β₯€q C) (X : V) : (CategoryTheory.Paths.lift Ο).map Quiver.Path.nil = CategoryTheory.CategoryStruct.id (Ο.obj X) - CategoryTheory.Paths.lift_toPath π Mathlib.CategoryTheory.PathCategory.Basic
{V : Type uβ} [Quiver V] {C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (Ο : V β₯€q C) {X Y : V} (f : X βΆ Y) : (CategoryTheory.Paths.lift Ο).map f.toPath = Ο.map f - CategoryTheory.composePath_comp' π Mathlib.CategoryTheory.PathCategory.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y Z : CategoryTheory.Paths C} (f : X βΆ Y) (g : Y βΆ Z) : CategoryTheory.composePath (CategoryTheory.CategoryStruct.comp f g) = CategoryTheory.CategoryStruct.comp (CategoryTheory.composePath f) (CategoryTheory.composePath g) - CategoryTheory.Prefunctor.mapPath_comp' π Mathlib.CategoryTheory.PathCategory.Basic
(V : Type uβ) [Quiver V] (W : Type uβ) [Quiver W] (F : V β₯€q W) {X Y Z : CategoryTheory.Paths V} (f : X βΆ Y) (g : Y βΆ Z) : F.mapPath (CategoryTheory.CategoryStruct.comp f g) = (F.mapPath f).comp (F.mapPath g) - CategoryTheory.Paths.lift_cons π Mathlib.CategoryTheory.PathCategory.Basic
{V : Type uβ} [Quiver V] {C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (Ο : V β₯€q C) {X Y Z : V} (p : Quiver.Path X Y) (f : Y βΆ Z) : (CategoryTheory.Paths.lift Ο).map (p.cons f) = CategoryTheory.CategoryStruct.comp ((CategoryTheory.Paths.lift Ο).map p) (Ο.map f) - CategoryTheory.Paths.induction_fixed_source π Mathlib.CategoryTheory.PathCategory.Basic
{V : Type uβ} [Quiver V] {a : CategoryTheory.Paths V} (P : {b : CategoryTheory.Paths V} β (a βΆ b) β Prop) (id : P (CategoryTheory.CategoryStruct.id a)) (comp : β {u v : V} (p : a βΆ (CategoryTheory.Paths.of V).obj u) (q : u βΆ v), P p β P (CategoryTheory.CategoryStruct.comp p ((CategoryTheory.Paths.of V).map q))) {b : CategoryTheory.Paths V} (f : a βΆ b) : P f - CategoryTheory.Paths.induction_fixed_target π Mathlib.CategoryTheory.PathCategory.Basic
{V : Type uβ} [Quiver V] {b : CategoryTheory.Paths V} (P : {a : CategoryTheory.Paths V} β (a βΆ b) β Prop) (id : P (CategoryTheory.CategoryStruct.id b)) (comp : β {u v : V} (p : (CategoryTheory.Paths.of V).obj v βΆ b) (q : u βΆ v), P p β P (CategoryTheory.CategoryStruct.comp ((CategoryTheory.Paths.of V).map q) p)) {a : CategoryTheory.Paths V} (f : a βΆ b) : P f - CategoryTheory.Paths.ext_functor π Mathlib.CategoryTheory.PathCategory.Basic
{V : Type uβ} [Quiver V] {C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {F G : CategoryTheory.Functor (CategoryTheory.Paths V) C} (h_obj : F.obj = G.obj) (h : β (a b : V) (e : a βΆ b), F.map e.toPath = CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom β―) (CategoryTheory.CategoryStruct.comp (G.map e.toPath) (CategoryTheory.eqToHom β―))) : F = G - CategoryTheory.Paths.induction π Mathlib.CategoryTheory.PathCategory.Basic
{V : Type uβ} [Quiver V] (P : {a b : CategoryTheory.Paths V} β (a βΆ b) β Prop) (id : β {v : V}, P (CategoryTheory.CategoryStruct.id ((CategoryTheory.Paths.of V).obj v))) (comp : β {u v w : V} (p : (CategoryTheory.Paths.of V).obj u βΆ (CategoryTheory.Paths.of V).obj v) (q : v βΆ w), P p β P (CategoryTheory.CategoryStruct.comp p ((CategoryTheory.Paths.of V).map q))) {a b : CategoryTheory.Paths V} (f : a βΆ b) : P f - CategoryTheory.Paths.induction' π Mathlib.CategoryTheory.PathCategory.Basic
{V : Type uβ} [Quiver V] (P : {a b : CategoryTheory.Paths V} β (a βΆ b) β Prop) (id : β {v : V}, P (CategoryTheory.CategoryStruct.id ((CategoryTheory.Paths.of V).obj v))) (comp : β {u v w : V} (p : u βΆ v) (q : (CategoryTheory.Paths.of V).obj v βΆ (CategoryTheory.Paths.of V).obj w), P q β P (CategoryTheory.CategoryStruct.comp ((CategoryTheory.Paths.of V).map p) q)) {a b : CategoryTheory.Paths V} (f : a βΆ b) : P f - CategoryTheory.toQuotientPaths_map π Mathlib.CategoryTheory.PathCategory.Basic
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] {Xβ Yβ : C} (f : Xβ βΆ Yβ) : (CategoryTheory.toQuotientPaths C).map f = Quot.mk (CategoryTheory.HomRel.CompClosure (CategoryTheory.pathsHomRel C)) f.toPath - CategoryTheory.quotientPathsTo_map π Mathlib.CategoryTheory.PathCategory.Basic
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] {Xβ Yβ : CategoryTheory.Quotient (CategoryTheory.pathsHomRel C)} (hf : Xβ βΆ Yβ) : (CategoryTheory.quotientPathsTo C).map hf = Quot.liftOn hf (fun f => CategoryTheory.composePath f) β― - CategoryTheory.MorphismProperty.paths π Mathlib.CategoryTheory.PathCategory.MorphismProperty
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (W : CategoryTheory.MorphismProperty C) : CategoryTheory.MorphismProperty (CategoryTheory.Paths C) - CategoryTheory.MorphismProperty.instIsMultiplicativePathsPaths π Mathlib.CategoryTheory.PathCategory.MorphismProperty
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (W : CategoryTheory.MorphismProperty C) : W.paths.IsMultiplicative - CategoryTheory.MorphismProperty.instIsMultiplicativeStrictMapPathsPathsPathComposition π Mathlib.CategoryTheory.PathCategory.MorphismProperty
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (W : CategoryTheory.MorphismProperty C) : (W.paths.strictMap (CategoryTheory.pathComposition C)).IsMultiplicative - CategoryTheory.MorphismProperty.multiplicativeClosure_eq_strictMap_paths π Mathlib.CategoryTheory.PathCategory.MorphismProperty
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (W : CategoryTheory.MorphismProperty C) : W.multiplicativeClosure = W.paths.strictMap (CategoryTheory.pathComposition C) - CategoryTheory.MorphismProperty.comp_mem_paths_iff' π Mathlib.CategoryTheory.PathCategory.MorphismProperty
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {W : CategoryTheory.MorphismProperty C} {X Y Z : CategoryTheory.Paths C} {p : X βΆ Y} {q : Y βΆ Z} : W.paths (CategoryTheory.CategoryStruct.comp p q) β W.paths p β§ W.paths q - CategoryTheory.MorphismProperty.monotone_paths π Mathlib.CategoryTheory.PathCategory.MorphismProperty
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] : Monotone CategoryTheory.MorphismProperty.paths - CategoryTheory.MorphismProperty.paths_le_inverseImage π Mathlib.CategoryTheory.PathCategory.MorphismProperty
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (W : CategoryTheory.MorphismProperty C) [W.IsMultiplicative] : W.paths β€ W.inverseImage (CategoryTheory.pathComposition C) - CategoryTheory.Paths.morphismProperty_eq_top_of_isMultiplicative π Mathlib.CategoryTheory.PathCategory.MorphismProperty
(V : Type uβ) [Quiver V] (P : CategoryTheory.MorphismProperty (CategoryTheory.Paths V)) [P.IsMultiplicative] (hP : β {u v : V} (p : u βΆ v), P ((CategoryTheory.Paths.of V).map p)) : P = β€ - CategoryTheory.Paths.liftNatTrans π Mathlib.CategoryTheory.PathCategory.MorphismProperty
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {V : Type uβ} [Quiver V] {F G : CategoryTheory.Functor (CategoryTheory.Paths V) C} (Ξ±_app : (v : V) β F.obj v βΆ G.obj v) (Ξ±_nat : β {X Y : V} (f : X βΆ Y), CategoryTheory.CategoryStruct.comp (F.map f.toPath) (Ξ±_app Y) = CategoryTheory.CategoryStruct.comp (Ξ±_app X) (G.map f.toPath)) : F βΆ G - CategoryTheory.Paths.liftNatTrans_app π Mathlib.CategoryTheory.PathCategory.MorphismProperty
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {V : Type uβ} [Quiver V] {F G : CategoryTheory.Functor (CategoryTheory.Paths V) C} (Ξ±_app : (v : V) β F.obj v βΆ G.obj v) (Ξ±_nat : β {X Y : V} (f : X βΆ Y), CategoryTheory.CategoryStruct.comp (F.map f.toPath) (Ξ±_app Y) = CategoryTheory.CategoryStruct.comp (Ξ±_app X) (G.map f.toPath)) (v : V) : (CategoryTheory.Paths.liftNatTrans Ξ±_app Ξ±_nat).app v = Ξ±_app v - CategoryTheory.Paths.liftNatIso π Mathlib.CategoryTheory.PathCategory.MorphismProperty
{V : Type uβ} [Quiver V] {C : Type u_2} [CategoryTheory.Category.{v_2, u_2} C] {F G : CategoryTheory.Functor (CategoryTheory.Paths V) C} (Ξ±_app : (v : V) β F.obj v β G.obj v) (Ξ±_nat : β {X Y : V} (f : X βΆ Y), CategoryTheory.CategoryStruct.comp (F.map f.toPath) (Ξ±_app Y).hom = CategoryTheory.CategoryStruct.comp (Ξ±_app X).hom (G.map f.toPath)) : F β G - CategoryTheory.Paths.liftNatIso_hom_app π Mathlib.CategoryTheory.PathCategory.MorphismProperty
{V : Type uβ} [Quiver V] {C : Type u_2} [CategoryTheory.Category.{v_2, u_2} C] {F G : CategoryTheory.Functor (CategoryTheory.Paths V) C} (Ξ±_app : (v : V) β F.obj v β G.obj v) (Ξ±_nat : β {X Y : V} (f : X βΆ Y), CategoryTheory.CategoryStruct.comp (F.map f.toPath) (Ξ±_app Y).hom = CategoryTheory.CategoryStruct.comp (Ξ±_app X).hom (G.map f.toPath)) (X : CategoryTheory.Paths V) : (CategoryTheory.Paths.liftNatIso Ξ±_app Ξ±_nat).hom.app X = (Ξ±_app X).hom - CategoryTheory.Paths.liftNatIso_inv_app π Mathlib.CategoryTheory.PathCategory.MorphismProperty
{V : Type uβ} [Quiver V] {C : Type u_2} [CategoryTheory.Category.{v_2, u_2} C] {F G : CategoryTheory.Functor (CategoryTheory.Paths V) C} (Ξ±_app : (v : V) β F.obj v β G.obj v) (Ξ±_nat : β {X Y : V} (f : X βΆ Y), CategoryTheory.CategoryStruct.comp (F.map f.toPath) (Ξ±_app Y).hom = CategoryTheory.CategoryStruct.comp (Ξ±_app X).hom (G.map f.toPath)) (X : CategoryTheory.Paths V) : (CategoryTheory.Paths.liftNatIso Ξ±_app Ξ±_nat).inv.app X = (Ξ±_app X).inv - CategoryTheory.Paths.morphismProperty_eq_top π Mathlib.CategoryTheory.PathCategory.MorphismProperty
(V : Type uβ) [Quiver V] (P : CategoryTheory.MorphismProperty (CategoryTheory.Paths V)) (id : β {v : V}, P (CategoryTheory.CategoryStruct.id ((CategoryTheory.Paths.of V).obj v))) (comp : β {u v w : V} (p : (CategoryTheory.Paths.of V).obj u βΆ (CategoryTheory.Paths.of V).obj v) (q : v βΆ w), P p β P (CategoryTheory.CategoryStruct.comp p ((CategoryTheory.Paths.of V).map q))) : P = β€ - CategoryTheory.Paths.morphismProperty_eq_top' π Mathlib.CategoryTheory.PathCategory.MorphismProperty
(V : Type uβ) [Quiver V] (P : CategoryTheory.MorphismProperty (CategoryTheory.Paths V)) (id : β {v : V}, P (CategoryTheory.CategoryStruct.id ((CategoryTheory.Paths.of V).obj v))) (comp : β {u v w : V} (p : u βΆ v) (q : (CategoryTheory.Paths.of V).obj v βΆ (CategoryTheory.Paths.of V).obj w), P q β P (CategoryTheory.CategoryStruct.comp ((CategoryTheory.Paths.of V).map p) q)) : P = β€ - CategoryTheory.Cat.free_obj π Mathlib.CategoryTheory.Category.Quiv
(V : CategoryTheory.Quiv) : CategoryTheory.Cat.free.obj V = CategoryTheory.Cat.of (CategoryTheory.Paths βV) - CategoryTheory.Cat.freeMap π Mathlib.CategoryTheory.Category.Quiv
{V : Type u_1} {W : Type u_2} [Quiver V] [Quiver W] (F : V β₯€q W) : CategoryTheory.Functor (CategoryTheory.Paths V) (CategoryTheory.Paths W) - CategoryTheory.Quiv.lift π Mathlib.CategoryTheory.Category.Quiv
{V : Type u} [Quiver V] {C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (F : V β₯€q C) : CategoryTheory.Functor (CategoryTheory.Paths V) C - CategoryTheory.Quiv.pathsEquiv π Mathlib.CategoryTheory.Category.Quiv
{V : Type u} {C : Type uβ} [Quiver V] [CategoryTheory.Category.{vβ, uβ} C] : CategoryTheory.Functor (CategoryTheory.Paths V) C β V β₯€q C - CategoryTheory.Cat.freeMap_id π Mathlib.CategoryTheory.Category.Quiv
(V : Type u_1) [Quiver V] : CategoryTheory.Cat.freeMap (πq V) = CategoryTheory.Functor.id (CategoryTheory.Paths V) - CategoryTheory.Cat.freeMap_obj π Mathlib.CategoryTheory.Category.Quiv
{V : Type u_1} {W : Type u_2} [Quiver V] [Quiver W] (F : V β₯€q W) (aβ : V) : (CategoryTheory.Cat.freeMap F).obj aβ = F.obj aβ - CategoryTheory.Cat.freeMapIdIso π Mathlib.CategoryTheory.Category.Quiv
(V : Type u_1) [Quiver V] : CategoryTheory.Cat.freeMap (πq V) β CategoryTheory.Functor.id (CategoryTheory.Paths V) - CategoryTheory.Quiv.lift_obj π Mathlib.CategoryTheory.Category.Quiv
{V : Type u} [Quiver V] {C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (F : V β₯€q C) (X : CategoryTheory.Paths V) : (CategoryTheory.Quiv.lift F).obj X = F.obj X - CategoryTheory.Cat.freeMap_map π Mathlib.CategoryTheory.Category.Quiv
{V : Type u_1} {W : Type u_2} [Quiver V] [Quiver W] (F : V β₯€q W) {Xβ Yβ : CategoryTheory.Paths V} (aβ : Quiver.Path Xβ Yβ) : (CategoryTheory.Cat.freeMap F).map aβ = F.mapPath aβ - CategoryTheory.Quiv.freeMap_pathsOf_pathComposition π Mathlib.CategoryTheory.Category.Quiv
(V : Type u) [Quiver V] : (CategoryTheory.Cat.freeMap (CategoryTheory.Paths.of V)).comp (CategoryTheory.pathComposition (CategoryTheory.Paths V)) = CategoryTheory.Functor.id (CategoryTheory.Paths V) - CategoryTheory.Cat.freeMap_comp π Mathlib.CategoryTheory.Category.Quiv
{Vβ : Type uβ} {Vβ : Type uβ} {Vβ : Type uβ} [Quiver Vβ] [Quiver Vβ] [Quiver Vβ] (F : Vβ β₯€q Vβ) (G : Vβ β₯€q Vβ) : CategoryTheory.Cat.freeMap (F βq G) = (CategoryTheory.Cat.freeMap F).comp (CategoryTheory.Cat.freeMap G) - CategoryTheory.Quiv.pathsOf_pathComposition_toPrefunctor π Mathlib.CategoryTheory.Category.Quiv
(C : Type u) [CategoryTheory.Category.{v, u} C] : CategoryTheory.Paths.of C βq (CategoryTheory.pathComposition C).toPrefunctor = πq C - CategoryTheory.Quiv.freeMapPathsOfCompPathCompositionIso π Mathlib.CategoryTheory.Category.Quiv
(V : Type u) [Quiver V] : (CategoryTheory.Cat.freeMap (CategoryTheory.Paths.of V)).comp (CategoryTheory.pathComposition (CategoryTheory.Paths V)) β CategoryTheory.Functor.id (CategoryTheory.Paths V) - CategoryTheory.Cat.free_map π Mathlib.CategoryTheory.Category.Quiv
{Xβ Yβ : CategoryTheory.Quiv} (F : Xβ βΆ Yβ) : CategoryTheory.Cat.free.map F = (CategoryTheory.Cat.freeMap (CategoryTheory.Prefunctor.ofQuivHom F)).toCatHom - CategoryTheory.Cat.freeMapCompIso π Mathlib.CategoryTheory.Category.Quiv
{Vβ : Type uβ} {Vβ : Type uβ} {Vβ : Type uβ} [Quiver Vβ] [Quiver Vβ] [Quiver Vβ] (F : Vβ β₯€q Vβ) (G : Vβ β₯€q Vβ) : CategoryTheory.Cat.freeMap (F βq G) β (CategoryTheory.Cat.freeMap F).comp (CategoryTheory.Cat.freeMap G) - CategoryTheory.Quiv.pathComposition_naturality π Mathlib.CategoryTheory.Category.Quiv
{C : Type u} {D : Type uβ} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Category.{vβ, uβ} D] (F : CategoryTheory.Functor C D) : (CategoryTheory.Cat.freeMap F.toPrefunctor).comp (CategoryTheory.pathComposition D) = (CategoryTheory.pathComposition C).comp F - CategoryTheory.Quiv.pathsOf_freeMap_toPrefunctor π Mathlib.CategoryTheory.Category.Quiv
{V : Type u} {W : Type uβ} [Quiver V] [Quiver W] (F : V β₯€q W) : CategoryTheory.Paths.of V βq (CategoryTheory.Cat.freeMap F).toPrefunctor = F βq CategoryTheory.Paths.of W - CategoryTheory.Quiv.pathCompositionNaturality π Mathlib.CategoryTheory.Category.Quiv
{C : Type u} {D : Type uβ} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Category.{vβ, uβ} D] (F : CategoryTheory.Functor C D) : (CategoryTheory.Cat.freeMap F.toPrefunctor).comp (CategoryTheory.pathComposition D) β (CategoryTheory.pathComposition C).comp F - CategoryTheory.Quiv.lift_map π Mathlib.CategoryTheory.Category.Quiv
{V : Type u} [Quiver V] {C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (F : V β₯€q C) {Xβ Yβ : CategoryTheory.Paths V} (f : Xβ βΆ Yβ) : (CategoryTheory.Quiv.lift F).map f = CategoryTheory.composePath (F.mapPath f) - CategoryTheory.Quiv.adj_homEquiv π Mathlib.CategoryTheory.Category.Quiv
{V C : Type u} [Quiver V] [CategoryTheory.Category.{max u v, u} C] : CategoryTheory.Quiv.adj.homEquiv (CategoryTheory.Quiv.of V) (CategoryTheory.Cat.of C) = (CategoryTheory.Cat.Hom.equivFunctor (CategoryTheory.Cat.of (CategoryTheory.Paths V)) (CategoryTheory.Cat.of C)).trans CategoryTheory.Quiv.pathsEquiv - CategoryTheory.Cat.freeMapIdIso_hom_app π Mathlib.CategoryTheory.Category.Quiv
(V : Type u_1) [Quiver V] (X : CategoryTheory.Paths V) : (CategoryTheory.Cat.freeMapIdIso V).hom.app X = CategoryTheory.CategoryStruct.id X - CategoryTheory.Cat.freeMapIdIso_inv_app π Mathlib.CategoryTheory.Category.Quiv
(V : Type u_1) [Quiver V] (X : CategoryTheory.Paths V) : (CategoryTheory.Cat.freeMapIdIso V).inv.app X = CategoryTheory.CategoryStruct.id X - CategoryTheory.Cat.freeMapCompIso_hom_app π Mathlib.CategoryTheory.Category.Quiv
{Vβ : Type uβ} {Vβ : Type uβ} {Vβ : Type uβ} [Quiver Vβ] [Quiver Vβ] [Quiver Vβ] (F : Vβ β₯€q Vβ) (G : Vβ β₯€q Vβ) (X : CategoryTheory.Paths Vβ) : (CategoryTheory.Cat.freeMapCompIso F G).hom.app X = CategoryTheory.CategoryStruct.id (G.obj (F.obj X)) - CategoryTheory.Cat.freeMapCompIso_inv_app π Mathlib.CategoryTheory.Category.Quiv
{Vβ : Type uβ} {Vβ : Type uβ} {Vβ : Type uβ} [Quiver Vβ] [Quiver Vβ] [Quiver Vβ] (F : Vβ β₯€q Vβ) (G : Vβ β₯€q Vβ) (X : CategoryTheory.Paths Vβ) : (CategoryTheory.Cat.freeMapCompIso F G).inv.app X = CategoryTheory.CategoryStruct.id (G.obj (F.obj X)) - CategoryTheory.Localization.Construction.ΞΉPaths π Mathlib.CategoryTheory.Localization.Construction
{C : Type uC} [CategoryTheory.Category.{uC', uC} C] (W : CategoryTheory.MorphismProperty C) (X : C) : CategoryTheory.Paths (CategoryTheory.Localization.Construction.LocQuiver W) - CategoryTheory.Localization.Construction.relations π Mathlib.CategoryTheory.Localization.Construction
{C : Type uC} [CategoryTheory.Category.{uC', uC} C] (W : CategoryTheory.MorphismProperty C) : HomRel (CategoryTheory.Paths (CategoryTheory.Localization.Construction.LocQuiver W)) - CategoryTheory.Localization.Construction.liftToPathCategory π Mathlib.CategoryTheory.Localization.Construction
{C : Type uC} [CategoryTheory.Category.{uC', uC} C] {W : CategoryTheory.MorphismProperty C} {D : Type uD} [CategoryTheory.Category.{uD', uD} D] (G : CategoryTheory.Functor C D) (hG : W.IsInvertedBy G) : CategoryTheory.Functor (CategoryTheory.Paths (CategoryTheory.Localization.Construction.LocQuiver W)) D - CategoryTheory.Localization.Construction.Οβ π Mathlib.CategoryTheory.Localization.Construction
{C : Type uC} [CategoryTheory.Category.{uC', uC} C] (W : CategoryTheory.MorphismProperty C) {X Y : C} (f : X βΆ Y) : CategoryTheory.Localization.Construction.ΞΉPaths W X βΆ CategoryTheory.Localization.Construction.ΞΉPaths W Y - CategoryTheory.Localization.Construction.Οβ π Mathlib.CategoryTheory.Localization.Construction
{C : Type uC} [CategoryTheory.Category.{uC', uC} C] (W : CategoryTheory.MorphismProperty C) {X Y : C} (w : X βΆ Y) (hw : W w) : CategoryTheory.Localization.Construction.ΞΉPaths W Y βΆ CategoryTheory.Localization.Construction.ΞΉPaths W X - CategoryTheory.Localization.Construction.relations.id π Mathlib.CategoryTheory.Localization.Construction
{C : Type uC} [CategoryTheory.Category.{uC', uC} C] {W : CategoryTheory.MorphismProperty C} (X : C) : CategoryTheory.Localization.Construction.relations W (CategoryTheory.Localization.Construction.Οβ W (CategoryTheory.CategoryStruct.id X)) (CategoryTheory.CategoryStruct.id (CategoryTheory.Localization.Construction.ΞΉPaths W X)) - CategoryTheory.Localization.Construction.liftToPathCategory_obj π Mathlib.CategoryTheory.Localization.Construction
{C : Type uC} [CategoryTheory.Category.{uC', uC} C] {W : CategoryTheory.MorphismProperty C} {D : Type uD} [CategoryTheory.Category.{uD', uD} D] (G : CategoryTheory.Functor C D) (hG : W.IsInvertedBy G) (X : CategoryTheory.Paths (CategoryTheory.Localization.Construction.LocQuiver W)) : (CategoryTheory.Localization.Construction.liftToPathCategory G hG).obj X = G.obj X.obj - CategoryTheory.Localization.Construction.objEquiv_symm_apply π Mathlib.CategoryTheory.Localization.Construction
{C : Type uC} [CategoryTheory.Category.{uC', uC} C] (W : CategoryTheory.MorphismProperty C) (X : W.Localization) : (CategoryTheory.Localization.Construction.objEquiv W).symm X = X.as.obj - CategoryTheory.Localization.Construction.lift_obj π Mathlib.CategoryTheory.Localization.Construction
{C : Type uC} [CategoryTheory.Category.{uC', uC} C] {W : CategoryTheory.MorphismProperty C} {D : Type uD} [CategoryTheory.Category.{uD', uD} D] (G : CategoryTheory.Functor C D) (hG : W.IsInvertedBy G) (a : CategoryTheory.Quotient (CategoryTheory.Localization.Construction.relations W)) : (CategoryTheory.Localization.Construction.lift G hG).obj a = G.obj a.as.obj - CategoryTheory.Localization.Construction.relations.comp π Mathlib.CategoryTheory.Localization.Construction
{C : Type uC} [CategoryTheory.Category.{uC', uC} C] {W : CategoryTheory.MorphismProperty C} {X Y Z : C} (f : X βΆ Y) (g : Y βΆ Z) : CategoryTheory.Localization.Construction.relations W (CategoryTheory.Localization.Construction.Οβ W (CategoryTheory.CategoryStruct.comp f g)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Localization.Construction.Οβ W f) (CategoryTheory.Localization.Construction.Οβ W g)) - CategoryTheory.Localization.Construction.relations.Winvβ π Mathlib.CategoryTheory.Localization.Construction
{C : Type uC} [CategoryTheory.Category.{uC', uC} C] {W : CategoryTheory.MorphismProperty C} {X Y : C} (w : X βΆ Y) (hw : W w) : CategoryTheory.Localization.Construction.relations W (CategoryTheory.CategoryStruct.comp (CategoryTheory.Localization.Construction.Οβ W w) (CategoryTheory.Localization.Construction.Οβ W w hw)) (CategoryTheory.CategoryStruct.id (CategoryTheory.Localization.Construction.ΞΉPaths W X)) - CategoryTheory.Localization.Construction.relations.Winvβ π Mathlib.CategoryTheory.Localization.Construction
{C : Type uC} [CategoryTheory.Category.{uC', uC} C] {W : CategoryTheory.MorphismProperty C} {X Y : C} (w : X βΆ Y) (hw : W w) : CategoryTheory.Localization.Construction.relations W (CategoryTheory.CategoryStruct.comp (CategoryTheory.Localization.Construction.Οβ W w hw) (CategoryTheory.Localization.Construction.Οβ W w)) (CategoryTheory.CategoryStruct.id (CategoryTheory.Localization.Construction.ΞΉPaths W Y)) - CategoryTheory.Localization.Construction.WhiskeringLeftEquivalence.inverse_obj_obj π Mathlib.CategoryTheory.Localization.Construction
{C : Type uC} [CategoryTheory.Category.{uC', uC} C] (W : CategoryTheory.MorphismProperty C) (D : Type uD) [CategoryTheory.Category.{uD', uD} D] (G : W.FunctorsInverting D) (a : CategoryTheory.Quotient (CategoryTheory.Localization.Construction.relations W)) : ((CategoryTheory.Localization.Construction.WhiskeringLeftEquivalence.inverse W D).obj G).obj a = G.obj.obj a.as.obj - CategoryTheory.Localization.Construction.lift_map π Mathlib.CategoryTheory.Localization.Construction
{C : Type uC} [CategoryTheory.Category.{uC', uC} C] {W : CategoryTheory.MorphismProperty C} {D : Type uD} [CategoryTheory.Category.{uD', uD} D] (G : CategoryTheory.Functor C D) (hG : W.IsInvertedBy G) {Xβ Yβ : CategoryTheory.Quotient (CategoryTheory.Localization.Construction.relations W)} (hf : Xβ βΆ Yβ) : (CategoryTheory.Localization.Construction.lift G hG).map hf = Quot.liftOn hf (fun f => CategoryTheory.composePath ({ obj := fun X => G.obj X.obj, map := fun {X Y} a => Sum.rec (fun val => G.map val) (fun val => CategoryTheory.inv (G.map βval)) a }.mapPath f)) β― - CategoryTheory.Localization.Construction.liftToPathCategory_map π Mathlib.CategoryTheory.Localization.Construction
{C : Type uC} [CategoryTheory.Category.{uC', uC} C] {W : CategoryTheory.MorphismProperty C} {D : Type uD} [CategoryTheory.Category.{uD', uD} D] (G : CategoryTheory.Functor C D) (hG : W.IsInvertedBy G) {Xβ Yβ : CategoryTheory.Paths (CategoryTheory.Localization.Construction.LocQuiver W)} (f : Xβ βΆ Yβ) : (CategoryTheory.Localization.Construction.liftToPathCategory G hG).map f = CategoryTheory.composePath ({ obj := fun X => G.obj X.obj, map := fun {X Y} a => Sum.rec (fun val => G.map val) (fun val => CategoryTheory.inv (G.map βval)) a }.mapPath f) - CategoryTheory.Localization.Construction.WhiskeringLeftEquivalence.inverse_obj_map π Mathlib.CategoryTheory.Localization.Construction
{C : Type uC} [CategoryTheory.Category.{uC', uC} C] (W : CategoryTheory.MorphismProperty C) (D : Type uD) [CategoryTheory.Category.{uD', uD} D] (G : W.FunctorsInverting D) {Xβ Yβ : CategoryTheory.Quotient (CategoryTheory.Localization.Construction.relations W)} (hf : Xβ βΆ Yβ) : ((CategoryTheory.Localization.Construction.WhiskeringLeftEquivalence.inverse W D).obj G).map hf = Quot.liftOn hf (fun f => CategoryTheory.composePath ({ obj := fun X => G.obj.obj X.obj, map := fun {X Y} a => Sum.rec (fun val => G.obj.map val) (fun val => CategoryTheory.inv (G.obj.map βval)) a }.mapPath f)) β― - CategoryTheory.Cat.FreeRefl.quotientFunctor π Mathlib.CategoryTheory.Category.ReflQuiv
(V : Type u_1) [CategoryTheory.ReflQuiver V] : CategoryTheory.Functor (CategoryTheory.Paths V) (CategoryTheory.Cat.FreeRefl V) - CategoryTheory.Cat.FreeRefl.instFullPathsQuotientFunctor π Mathlib.CategoryTheory.Category.ReflQuiv
{V : Type u_1} [CategoryTheory.ReflQuiver V] : (CategoryTheory.Cat.FreeRefl.quotientFunctor V).Full - CategoryTheory.Cat.FreeReflRel π Mathlib.CategoryTheory.Category.ReflQuiv
(V : Type u_1) [CategoryTheory.ReflQuiver V] (X Y : CategoryTheory.Paths V) (f g : X βΆ Y) : Prop - CategoryTheory.Cat.FreeRefl.lift_unique' π Mathlib.CategoryTheory.Category.ReflQuiv
{V : Type u_2} [CategoryTheory.ReflQuiver V] {D : Type u_4} [CategoryTheory.Category.{v_1, u_4} D] (Fβ Fβ : CategoryTheory.Functor (CategoryTheory.Cat.FreeRefl V) D) (h : (CategoryTheory.Cat.FreeRefl.quotientFunctor V).comp Fβ = (CategoryTheory.Cat.FreeRefl.quotientFunctor V).comp Fβ) : Fβ = Fβ - CategoryTheory.Cat.freeReflMap_naturality π Mathlib.CategoryTheory.Category.ReflQuiv
{V : Type u_3} {W : Type u_4} [CategoryTheory.ReflQuiver V] [CategoryTheory.ReflQuiver W] (F : V β₯€rq W) : (CategoryTheory.Cat.FreeRefl.quotientFunctor V).comp (CategoryTheory.Cat.freeReflMap F) = (CategoryTheory.Cat.freeMap F.toPrefunctor).comp (CategoryTheory.Cat.FreeRefl.quotientFunctor W) - CategoryTheory.Cat.FreeRefl.quotientFunctor_map_nil π Mathlib.CategoryTheory.Category.ReflQuiv
{V : Type u_1} [CategoryTheory.ReflQuiver V] (x : CategoryTheory.Paths V) : (CategoryTheory.Cat.FreeRefl.quotientFunctor V).map Quiver.Path.nil = CategoryTheory.CategoryStruct.id ((CategoryTheory.Cat.FreeRefl.quotientFunctor V).obj x) - CategoryTheory.Cat.FreeRefl.quotientFunctor_map_id π Mathlib.CategoryTheory.Category.ReflQuiv
(V : Type u_2) [CategoryTheory.ReflQuiver V] (X : V) : (CategoryTheory.Cat.FreeRefl.quotientFunctor V).map (CategoryTheory.ReflQuiver.id X).toPath = CategoryTheory.CategoryStruct.id ((CategoryTheory.Cat.FreeRefl.quotientFunctor V).obj X) - CategoryTheory.ReflQuiv.adj.counit.comp_app_eq π Mathlib.CategoryTheory.Category.ReflQuiv
(C : Type u) [CategoryTheory.Category.{max u v, u} C] : (CategoryTheory.Cat.FreeRefl.quotientFunctor C).comp (CategoryTheory.ReflQuiv.adj.counit.app (CategoryTheory.Cat.of C)).toFunctor = CategoryTheory.pathComposition C - CategoryTheory.Cat.FreeRefl.quotientFunctor_map_cons π Mathlib.CategoryTheory.Category.ReflQuiv
{V : Type u_1} [CategoryTheory.ReflQuiver V] {x y z : CategoryTheory.Paths V} (p : x βΆ y) (q : y βΆ z) : (CategoryTheory.Cat.FreeRefl.quotientFunctor V).map (Quiver.Path.cons p q) = CategoryTheory.CategoryStruct.comp ((CategoryTheory.Cat.FreeRefl.quotientFunctor V).map p) (CategoryTheory.Cat.FreeRefl.homMk q) - CategoryTheory.ReflQuiv.adj.unit.map_app_eq π Mathlib.CategoryTheory.Category.ReflQuiv
(V : Type u) [CategoryTheory.ReflQuiver V] : (CategoryTheory.ReflQuiv.adj.unit.app (CategoryTheory.ReflQuiv.of V)).toPrefunctor = CategoryTheory.Quiv.adj.unit.app (CategoryTheory.Quiv.of V) βq (CategoryTheory.Cat.FreeRefl.quotientFunctor V).toPrefunctor - SSet.Truncated.HomotopyCategory.ext π Mathlib.AlgebraicTopology.SimplicialSet.HomotopyCat
{V : SSet.Truncated 2} {x y : V.HomotopyCategory} (h : x.as.as = y.as.as) : x = y - 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.HomotopyCategory.objEquiv_apply π Mathlib.AlgebraicTopology.SimplicialSet.HomotopyCat
{X : SSet} (x : X.HomotopyCategory) : SSet.HomotopyCategory.objEquiv x = x.as.as - FreeSimplexQuiver.homRel π Mathlib.AlgebraicTopology.SimplexCategory.GeneratorsRelations.Basic
: HomRel (CategoryTheory.Paths FreeSimplexQuiver) - FreeSimplexQuiver.homRel.Ξ΄_comp_Ο_self π Mathlib.AlgebraicTopology.SimplexCategory.GeneratorsRelations.Basic
{n : β} {i : Fin (n + 1)} : FreeSimplexQuiver.homRel (CategoryTheory.CategoryStruct.comp ((CategoryTheory.Paths.of FreeSimplexQuiver).map (FreeSimplexQuiver.Ξ΄ i.castSucc)) ((CategoryTheory.Paths.of FreeSimplexQuiver).map (FreeSimplexQuiver.Ο i))) (CategoryTheory.CategoryStruct.id ((CategoryTheory.Paths.of FreeSimplexQuiver).obj (FreeSimplexQuiver.mk n))) - FreeSimplexQuiver.homRel.Ξ΄_comp_Ο_succ π Mathlib.AlgebraicTopology.SimplexCategory.GeneratorsRelations.Basic
{n : β} {i : Fin (n + 1)} : FreeSimplexQuiver.homRel (CategoryTheory.CategoryStruct.comp ((CategoryTheory.Paths.of FreeSimplexQuiver).map (FreeSimplexQuiver.Ξ΄ i.succ)) ((CategoryTheory.Paths.of FreeSimplexQuiver).map (FreeSimplexQuiver.Ο i))) (CategoryTheory.CategoryStruct.id ((CategoryTheory.Paths.of FreeSimplexQuiver).obj (FreeSimplexQuiver.mk n))) - FreeSimplexQuiver.homRel.Ξ΄_comp_Ξ΄ π Mathlib.AlgebraicTopology.SimplexCategory.GeneratorsRelations.Basic
{n : β} {i j : Fin (n + 2)} (H : i β€ j) : FreeSimplexQuiver.homRel (CategoryTheory.CategoryStruct.comp ((CategoryTheory.Paths.of FreeSimplexQuiver).map (FreeSimplexQuiver.Ξ΄ i)) ((CategoryTheory.Paths.of FreeSimplexQuiver).map (FreeSimplexQuiver.Ξ΄ j.succ))) (CategoryTheory.CategoryStruct.comp ((CategoryTheory.Paths.of FreeSimplexQuiver).map (FreeSimplexQuiver.Ξ΄ j)) ((CategoryTheory.Paths.of FreeSimplexQuiver).map (FreeSimplexQuiver.Ξ΄ i.castSucc))) - FreeSimplexQuiver.homRel.Ο_comp_Ο π Mathlib.AlgebraicTopology.SimplexCategory.GeneratorsRelations.Basic
{n : β} {i j : Fin (n + 1)} (H : i β€ j) : FreeSimplexQuiver.homRel (CategoryTheory.CategoryStruct.comp ((CategoryTheory.Paths.of FreeSimplexQuiver).map (FreeSimplexQuiver.Ο i.castSucc)) ((CategoryTheory.Paths.of FreeSimplexQuiver).map (FreeSimplexQuiver.Ο j))) (CategoryTheory.CategoryStruct.comp ((CategoryTheory.Paths.of FreeSimplexQuiver).map (FreeSimplexQuiver.Ο j.succ)) ((CategoryTheory.Paths.of FreeSimplexQuiver).map (FreeSimplexQuiver.Ο i))) - FreeSimplexQuiver.homRel.Ξ΄_comp_Ο_of_le π Mathlib.AlgebraicTopology.SimplexCategory.GeneratorsRelations.Basic
{n : β} {i : Fin (n + 2)} {j : Fin (n + 1)} (H : i β€ j.castSucc) : FreeSimplexQuiver.homRel (CategoryTheory.CategoryStruct.comp ((CategoryTheory.Paths.of FreeSimplexQuiver).map (FreeSimplexQuiver.Ξ΄ i.castSucc)) ((CategoryTheory.Paths.of FreeSimplexQuiver).map (FreeSimplexQuiver.Ο j.succ))) (CategoryTheory.CategoryStruct.comp ((CategoryTheory.Paths.of FreeSimplexQuiver).map (FreeSimplexQuiver.Ο j)) ((CategoryTheory.Paths.of FreeSimplexQuiver).map (FreeSimplexQuiver.Ξ΄ i))) - FreeSimplexQuiver.homRel.Ξ΄_comp_Ο_of_gt π Mathlib.AlgebraicTopology.SimplexCategory.GeneratorsRelations.Basic
{n : β} {i : Fin (n + 2)} {j : Fin (n + 1)} (H : j.castSucc < i) : FreeSimplexQuiver.homRel (CategoryTheory.CategoryStruct.comp ((CategoryTheory.Paths.of FreeSimplexQuiver).map (FreeSimplexQuiver.Ξ΄ i.succ)) ((CategoryTheory.Paths.of FreeSimplexQuiver).map (FreeSimplexQuiver.Ο j.castSucc))) (CategoryTheory.CategoryStruct.comp ((CategoryTheory.Paths.of FreeSimplexQuiver).map (FreeSimplexQuiver.Ο j)) ((CategoryTheory.Paths.of FreeSimplexQuiver).map (FreeSimplexQuiver.Ξ΄ i))) - CategoryTheory.FreeBicategory.inclusion π Mathlib.CategoryTheory.Bicategory.Coherence
(B : Type u) [Quiver B] : CategoryTheory.Pseudofunctor (CategoryTheory.LocallyDiscrete (CategoryTheory.Paths B)) (CategoryTheory.FreeBicategory B) - CategoryTheory.FreeBicategory.normalize π Mathlib.CategoryTheory.Bicategory.Coherence
(B : Type u) [Quiver B] : CategoryTheory.Pseudofunctor (CategoryTheory.FreeBicategory B) (CategoryTheory.LocallyDiscrete (CategoryTheory.Paths B)) - CategoryTheory.FreeBicategory.preinclusion π Mathlib.CategoryTheory.Bicategory.Coherence
(B : Type u) [Quiver B] : CategoryTheory.PrelaxFunctor (CategoryTheory.LocallyDiscrete (CategoryTheory.Paths B)) (CategoryTheory.FreeBicategory B) - CategoryTheory.FreeBicategory.preinclusion_obj π Mathlib.CategoryTheory.Bicategory.Coherence
{B : Type u} [Quiver B] (a : B) : (CategoryTheory.FreeBicategory.preinclusion B).obj { as := a } = a - CategoryTheory.FreeBicategory.normalizeUnitIso π Mathlib.CategoryTheory.Bicategory.Coherence
{B : Type u} [Quiver B] (a b : CategoryTheory.FreeBicategory B) : CategoryTheory.Functor.id (a βΆ b) β ((CategoryTheory.FreeBicategory.normalize B).mapFunctor a b).comp (CategoryTheory.FreeBicategory.inclusionPath a b) - CategoryTheory.FreeBicategory.normalizeIso π Mathlib.CategoryTheory.Bicategory.Coherence
{B : Type u} [Quiver B] {a b c : B} (p : Quiver.Path a b) (f : CategoryTheory.FreeBicategory.Hom b c) : CategoryTheory.CategoryStruct.comp ((CategoryTheory.FreeBicategory.preinclusion B).map { as := p }) f β (CategoryTheory.FreeBicategory.preinclusion B).map { as := CategoryTheory.FreeBicategory.normalizeAux p f } - CategoryTheory.FreeBicategory.normalizeIso_id π Mathlib.CategoryTheory.Bicategory.Coherence
{B : Type u} [Quiver B] {a : B} {b : CategoryTheory.FreeBicategory B} (p : Quiver.Path a b) : CategoryTheory.FreeBicategory.normalizeIso p (CategoryTheory.CategoryStruct.id b) = CategoryTheory.Bicategory.rightUnitor ((CategoryTheory.FreeBicategory.preinclusion B).map { as := p }) - CategoryTheory.FreeBicategory.inclusionMapCompAux π Mathlib.CategoryTheory.Bicategory.Coherence
{B : Type u} [Quiver B] {a b c : B} (f : Quiver.Path a b) (g : Quiver.Path b c) : (CategoryTheory.FreeBicategory.preinclusion B).map (CategoryTheory.CategoryStruct.comp { as := f } { as := g }) β CategoryTheory.CategoryStruct.comp ((CategoryTheory.FreeBicategory.preinclusion B).map { as := f }) ((CategoryTheory.FreeBicategory.preinclusion B).map { as := g }) - CategoryTheory.FreeBicategory.preinclusion_mapβ π Mathlib.CategoryTheory.Bicategory.Coherence
{B : Type u} [Quiver B] {a b : B} (f g : CategoryTheory.Discrete (Quiver.Path a b)) (Ξ· : f βΆ g) : (CategoryTheory.FreeBicategory.preinclusion B).mapβ Ξ· = CategoryTheory.eqToHom β― - CategoryTheory.FreeBicategory.normalize_naturality π Mathlib.CategoryTheory.Bicategory.Coherence
{B : Type u} [Quiver B] {a b c : B} (p : Quiver.Path a b) {f g : CategoryTheory.FreeBicategory.Hom b c} (Ξ· : f βΆ g) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.whiskerLeft ((CategoryTheory.FreeBicategory.preinclusion B).map { as := p }) Ξ·) (CategoryTheory.FreeBicategory.normalizeIso p g).hom = CategoryTheory.CategoryStruct.comp (CategoryTheory.FreeBicategory.normalizeIso p f).hom ((CategoryTheory.FreeBicategory.preinclusion B).mapβ (CategoryTheory.eqToHom β―)) - CategoryTheory.FreeBicategory.normalizeIso_comp π Mathlib.CategoryTheory.Bicategory.Coherence
{B : Type u} [Quiver B] {a : B} {b c d : CategoryTheory.FreeBicategory B} (p : Quiver.Path a b) (f : b βΆ c) (g : c βΆ d) : CategoryTheory.FreeBicategory.normalizeIso p (CategoryTheory.CategoryStruct.comp f g) = (CategoryTheory.Bicategory.associator ((CategoryTheory.FreeBicategory.preinclusion B).map { as := p }) f g).symm βͺβ« CategoryTheory.Bicategory.whiskerRightIso (CategoryTheory.FreeBicategory.normalizeIso p f) g βͺβ« CategoryTheory.FreeBicategory.normalizeIso (CategoryTheory.FreeBicategory.normalizeAux p f) g - Quiver.FreeGroupoid.redStep π Mathlib.CategoryTheory.Groupoid.FreeGroupoid
{V : Type u} [Quiver V] : HomRel (CategoryTheory.Paths (Quiver.Symmetrify V)) - Quiver.Hom.toNegPath π Mathlib.CategoryTheory.Groupoid.FreeGroupoid
{V : Type u} [Quiver V] {X Y : V} (f : X βΆ Y) : Y βΆ X - Quiver.Hom.toPosPath π Mathlib.CategoryTheory.Groupoid.FreeGroupoid
{V : Type u} [Quiver V] {X Y : V} (f : X βΆ Y) : X βΆ Y - Quiver.FreeGroupoid.congr_reverse π Mathlib.CategoryTheory.Groupoid.FreeGroupoid
{V : Type u} [Quiver V] {X Y : CategoryTheory.Paths (Quiver.Symmetrify V)} (p q : X βΆ Y) : CategoryTheory.HomRel.CompClosure Quiver.FreeGroupoid.redStep p q β CategoryTheory.HomRel.CompClosure Quiver.FreeGroupoid.redStep (Quiver.Path.reverse p) (Quiver.Path.reverse q) - Quiver.FreeGroupoid.of_eq π Mathlib.CategoryTheory.Groupoid.FreeGroupoid
{V : Type u} [Quiver V] : Quiver.FreeGroupoid.of V = Quiver.Symmetrify.of βq CategoryTheory.Paths.of (Quiver.Symmetrify V) βq (CategoryTheory.Quotient.functor Quiver.FreeGroupoid.redStep).toPrefunctor - Quiver.FreeGroupoid.congr_comp_reverse π Mathlib.CategoryTheory.Groupoid.FreeGroupoid
{V : Type u} [Quiver V] {X Y : CategoryTheory.Paths (Quiver.Symmetrify V)} (p : X βΆ Y) : Quot.mk (CategoryTheory.HomRel.CompClosure Quiver.FreeGroupoid.redStep) (CategoryTheory.CategoryStruct.comp p (Quiver.Path.reverse p)) = Quot.mk (CategoryTheory.HomRel.CompClosure Quiver.FreeGroupoid.redStep) (CategoryTheory.CategoryStruct.id X) - Quiver.FreeGroupoid.congr_reverse_comp π Mathlib.CategoryTheory.Groupoid.FreeGroupoid
{V : Type u} [Quiver V] {X Y : CategoryTheory.Paths (Quiver.Symmetrify V)} (p : X βΆ Y) : Quot.mk (CategoryTheory.HomRel.CompClosure Quiver.FreeGroupoid.redStep) (CategoryTheory.CategoryStruct.comp (Quiver.Path.reverse p) p) = Quot.mk (CategoryTheory.HomRel.CompClosure Quiver.FreeGroupoid.redStep) (CategoryTheory.CategoryStruct.id Y) - Quiver.FreeGroupoid.redStep.step π Mathlib.CategoryTheory.Groupoid.FreeGroupoid
{V : Type u} [Quiver V] (X Z : Quiver.Symmetrify V) (f : X βΆ Z) : Quiver.FreeGroupoid.redStep (CategoryTheory.CategoryStruct.id ((CategoryTheory.Paths.of (Quiver.Symmetrify V)).obj X)) (CategoryTheory.CategoryStruct.comp f.toPath (Quiver.reverse f).toPath) - CategoryTheory.FreeGroupoid.eq_mk π Mathlib.CategoryTheory.Groupoid.FreeGroupoidOfCategory
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : CategoryTheory.FreeGroupoid C) : X = CategoryTheory.FreeGroupoid.mk X.as.as
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