Loogle!
Result
Found 558 declarations mentioning Quiver. Of these, only the first 200 are shown.
- Quiver π Mathlib.Combinatorics.Quiver.Basic
(V : Type u) : Type (max u (v + 1)) - Quiver.IsThin π Mathlib.Combinatorics.Quiver.Basic
(V : Type u) [Quiver V] : Prop - Quiver.emptyQuiver π Mathlib.Combinatorics.Quiver.Basic
(V : Type u) : Quiver (Quiver.Empty V) - Quiver.Hom π Mathlib.Combinatorics.Quiver.Basic
{V : Type u} [self : Quiver V] : V β V β Type v - Quiver.mk π Mathlib.Combinatorics.Quiver.Basic
{V : Type u} (Hom : V β V β Type v) : Quiver V - Quiver.opposite π Mathlib.Combinatorics.Quiver.Basic
{V : Type u_1} [Quiver V] : Quiver Vα΅α΅ - Quiver.Hom.op π Mathlib.Combinatorics.Quiver.Basic
{V : Type u_1} [Quiver V] {X Y : V} (f : X βΆ Y) : Opposite.op Y βΆ Opposite.op X - Quiver.Hom.opEquiv π Mathlib.Combinatorics.Quiver.Basic
{V : Type u_1} [Quiver V] {X Y : V} : (X βΆ Y) β (Opposite.op Y βΆ Opposite.op X) - Quiver.Hom.unop π Mathlib.Combinatorics.Quiver.Basic
{V : Type u_1} [Quiver V] {X Y : Vα΅α΅} (f : X βΆ Y) : Opposite.unop Y βΆ Opposite.unop X - Quiver.homOfEq π Mathlib.Combinatorics.Quiver.Basic
{V : Type u_1} [Quiver V] {X Y X' Y' : V} (f : X βΆ Y) (hX : X = X') (hY : Y = Y') : X' βΆ Y' - Quiver.homOfEq_rfl π Mathlib.Combinatorics.Quiver.Basic
{V : Type u_1} [Quiver V] {X Y : V} (f : X βΆ Y) : Quiver.homOfEq f β― β― = f - Quiver.homOfEq_heq π Mathlib.Combinatorics.Quiver.Basic
{V : Type u_1} [Quiver V] {X Y X' Y' : V} (hX : X = X') (hY : Y = Y') (f : X βΆ Y) : Quiver.homOfEq f hX hY β f - Quiver.heq_of_homOfEq_ext π Mathlib.Combinatorics.Quiver.Basic
{V : Type u_1} [Quiver V] {X Y X' Y' : V} (hX : X = X') (hY : Y = Y') {f : X βΆ Y} {f' : X' βΆ Y'} (e : Quiver.homOfEq f hX hY = f') : f β f' - Quiver.homOfEq_injective π Mathlib.Combinatorics.Quiver.Basic
{V : Type u_1} [Quiver V] {X Y X' Y' : V} (hX : X = X') (hY : Y = Y') {f g : X βΆ Y} (h : Quiver.homOfEq f hX hY = Quiver.homOfEq g hX hY) : f = g - Quiver.homOfEq_heq_left_iff π Mathlib.Combinatorics.Quiver.Basic
{V : Type u_1} [Quiver V] {X Y X' Y' : V} (f : X βΆ Y) (g : X' βΆ Y') (hX : X = X') (hY : Y = Y') : Quiver.homOfEq f hX hY β g β f β g - Quiver.homOfEq_heq_right_iff π Mathlib.Combinatorics.Quiver.Basic
{V : Type u_1} [Quiver V] {X Y X' Y' : V} (f : X βΆ Y) (g : X' βΆ Y') (hX : X' = X) (hY : Y' = Y) : f β Quiver.homOfEq g hX hY β f β g - Quiver.eq_homOfEq_iff π Mathlib.Combinatorics.Quiver.Basic
{V : Type u_1} [Quiver V] {X Y X' Y' : V} (f : X βΆ Y) (g : X' βΆ Y') (hX : X' = X) (hY : Y' = Y) : f = Quiver.homOfEq g hX hY β Quiver.homOfEq f β― β― = g - Quiver.homOfEq_eq_iff π Mathlib.Combinatorics.Quiver.Basic
{V : Type u_1} [Quiver V] {X Y X' Y' : V} (f : X βΆ Y) (g : X' βΆ Y') (hX : X = X') (hY : Y = Y') : Quiver.homOfEq f hX hY = g β f = Quiver.homOfEq g β― β― - Quiver.homOfEq_trans π Mathlib.Combinatorics.Quiver.Basic
{V : Type u_1} [Quiver V] {X Y X' Y' : V} (f : X βΆ Y) (hX : X = X') (hY : Y = Y') {X'' Y'' : V} (hX' : X' = X'') (hY' : Y' = Y'') : Quiver.homOfEq (Quiver.homOfEq f hX hY) hX' hY' = Quiver.homOfEq f β― β― - Quiver.Hom.opEquiv_apply π Mathlib.Combinatorics.Quiver.Basic
{V : Type u_1} [Quiver V] {X Y : V} (unop : X βΆ Y) : Quiver.Hom.opEquiv unop = Opposite.op unop - Quiver.Hom.opEquiv_symm_apply π Mathlib.Combinatorics.Quiver.Basic
{V : Type u_1} [Quiver V] {X Y : V} (self : (Opposite.unop (Opposite.op X) βΆ Opposite.unop (Opposite.op Y))α΅α΅) : Quiver.Hom.opEquiv.symm self = Opposite.unop self - CategoryTheory.CategoryStruct.toQuiver π Mathlib.CategoryTheory.Category.Basic
{obj : Type u} [self : CategoryTheory.CategoryStruct.{v, u} obj] : Quiver obj - CategoryTheory.CategoryStruct.mk π Mathlib.CategoryTheory.Category.Basic
{obj : Type u} [toQuiver : Quiver obj] (id : (X : obj) β X βΆ X) (comp : {X Y Z : obj} β (X βΆ Y) β (Y βΆ Z) β (X βΆ Z)) : CategoryTheory.CategoryStruct.{v, u} obj - Prefunctor π Mathlib.Combinatorics.Quiver.Prefunctor
(V : Type uβ) [Quiver V] (W : Type uβ) [Quiver W] : Type (max (max (max uβ uβ) vβ) vβ) - Prefunctor.id π Mathlib.Combinatorics.Quiver.Prefunctor
(V : Type u_1) [Quiver V] : V β₯€q V - Prefunctor.instInhabited π Mathlib.Combinatorics.Quiver.Prefunctor
(V : Type u_1) [Quiver V] : Inhabited (V β₯€q V) - Prefunctor.obj π Mathlib.Combinatorics.Quiver.Prefunctor
{V : Type uβ} [Quiver V] {W : Type uβ} [Quiver W] (self : V β₯€q W) : V β W - Prefunctor.id_obj π Mathlib.Combinatorics.Quiver.Prefunctor
(V : Type u_1) [Quiver V] (X : V) : (πq V).obj X = X - Prefunctor.comp π Mathlib.Combinatorics.Quiver.Prefunctor
{U : Type u_1} [Quiver U] {V : Type u_2} [Quiver V] {W : Type u_3} [Quiver W] (F : U β₯€q V) (G : V β₯€q W) : U β₯€q W - Prefunctor.mk π Mathlib.Combinatorics.Quiver.Prefunctor
{V : Type uβ} [Quiver V] {W : Type uβ} [Quiver W] (obj : V β W) (map : {X Y : V} β (X βΆ Y) β (obj X βΆ obj Y)) : V β₯€q W - Prefunctor.id_map π Mathlib.Combinatorics.Quiver.Prefunctor
(V : Type u_1) [Quiver V] {Xβ Yβ : V} (f : Xβ βΆ Yβ) : (πq V).map f = f - Prefunctor.comp_id π Mathlib.Combinatorics.Quiver.Prefunctor
{U : Type u_1} {V : Type u_2} [Quiver U] [Quiver V] (F : U β₯€q V) : F βq πq V = F - Prefunctor.id_comp π Mathlib.Combinatorics.Quiver.Prefunctor
{U : Type u_1} {V : Type u_2} [Quiver U] [Quiver V] (F : U β₯€q V) : πq U βq F = F - Prefunctor.map π Mathlib.Combinatorics.Quiver.Prefunctor
{V : Type uβ} [Quiver V] {W : Type uβ} [Quiver W] (self : V β₯€q W) {X Y : V} : (X βΆ Y) β (self.obj X βΆ self.obj Y) - Prefunctor.mk_obj π Mathlib.Combinatorics.Quiver.Prefunctor
{V : Type u_1} {W : Type u_2} [Quiver V] [Quiver W] {obj : V β W} {map : {X Y : V} β (X βΆ Y) β (obj X βΆ obj Y)} {X : V} : { obj := obj, map := map }.obj X = obj X - Prefunctor.congr_obj π Mathlib.Combinatorics.Quiver.Prefunctor
{U : Type u_1} {V : Type u_2} [Quiver U] [Quiver V] {F G : U β₯€q V} (e : F = G) (X : U) : F.obj X = G.obj X - Prefunctor.comp_obj π Mathlib.Combinatorics.Quiver.Prefunctor
{U : Type u_1} [Quiver U] {V : Type u_2} [Quiver V] {W : Type u_3} [Quiver W] (F : U β₯€q V) (G : V β₯€q W) (X : U) : (F βq G).obj X = G.obj (F.obj X) - Prefunctor.comp_assoc π Mathlib.Combinatorics.Quiver.Prefunctor
{U : Type u_1} {V : Type u_2} {W : Type u_3} {Z : Type u_4} [Quiver U] [Quiver V] [Quiver W] [Quiver Z] (F : U β₯€q V) (G : V β₯€q W) (H : W β₯€q Z) : F βq G βq H = F βq (G βq H) - Prefunctor.congr_map π Mathlib.Combinatorics.Quiver.Prefunctor
{U : Type u_1} {V : Type u_2} [Quiver U] [Quiver V] (F : U β₯€q V) {X Y : U} {f g : X βΆ Y} (h : f = g) : F.map f = F.map g - Prefunctor.mk_map π Mathlib.Combinatorics.Quiver.Prefunctor
{V : Type u_1} {W : Type u_2} [Quiver V] [Quiver W] {obj : V β W} {map : {X Y : V} β (X βΆ Y) β (obj X βΆ obj Y)} {X Y : V} {f : X βΆ Y} : { obj := obj, map := map }.map f = map f - Prefunctor.comp_map π Mathlib.Combinatorics.Quiver.Prefunctor
{U : Type u_1} [Quiver U] {V : Type u_2} [Quiver V] {W : Type u_3} [Quiver W] (F : U β₯€q V) (G : V β₯€q W) {Xβ Yβ : U} (f : Xβ βΆ Yβ) : (F βq G).map f = G.map (F.map f) - Prefunctor.congr_hom π Mathlib.Combinatorics.Quiver.Prefunctor
{U : Type u_1} {V : Type u_2} [Quiver U] [Quiver V] {F G : U β₯€q V} (e : F = G) {X Y : U} (f : X βΆ Y) : Quiver.homOfEq (F.map f) β― β― = G.map f - Prefunctor.homOfEq_map π Mathlib.Combinatorics.Quiver.Prefunctor
{U : Type u_1} {V : Type u_2} [Quiver U] [Quiver V] (F : U β₯€q V) {X Y : U} (f : X βΆ Y) {X' Y' : U} (hX : X = X') (hY : Y = Y') : F.map (Quiver.homOfEq f hX hY) = Quiver.homOfEq (F.map f) β― β― - Prefunctor.ext' π Mathlib.Combinatorics.Quiver.Prefunctor
{V W : Type u} [Quiver V] [Quiver W] {F G : V β₯€q W} (h_obj : β (X : V), F.obj X = G.obj X) (h_map : β (X Y : V) (f : X βΆ Y), F.map f = Quiver.homOfEq (G.map f) β― β―) : F = G - Prefunctor.ext π Mathlib.Combinatorics.Quiver.Prefunctor
{V : Type u} [Quiver V] {W : Type uβ} [Quiver W] {F G : V β₯€q W} (h_obj : β (X : V), F.obj X = G.obj X) (h_map : β (X Y : V) (f : X βΆ Y), F.map f = Eq.recOn β― (Eq.recOn β― (G.map f))) : F = G - Quiver.Path π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] (a : V) : V β Type (max u v) - Quiver.Reachable π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] (a b : V) : Prop - Quiver.Path.BoundedPaths π Mathlib.Combinatorics.Quiver.Path
{V : Type u_1} [Quiver V] (v w : V) (n : β) : Type (max 0 u_1 u_2) - Quiver.instIsPreorderReachable π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] : IsPreorder V Quiver.Reachable - Quiver.Path.nil π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a : V} : Quiver.Path a a - Quiver.Reachable.refl π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] (a : V) : Quiver.Reachable a a - Quiver.Reachable.rfl π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a : V} : Quiver.Reachable a a - Quiver.Path.instInhabited π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a : V} : Inhabited (Quiver.Path a a) - Quiver.Path.length π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a b : V} : Quiver.Path a b β β - Quiver.Path.toList π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a b : V} : Quiver.Path a b β List V - Quiver.Hom.reachable π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a b : V} (e : a βΆ b) : Quiver.Reachable a b - Quiver.Hom.toPath π Mathlib.Combinatorics.Quiver.Path
{V : Type u_1} [Quiver V] {a b : V} (e : a βΆ b) : Quiver.Path a b - Quiver.Path.reachable π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a b : V} (p : Quiver.Path a b) : Quiver.Reachable a b - Quiver.Path.decidableEqBddPathsZero π Mathlib.Combinatorics.Quiver.Path
{V : Type u_1} [Quiver V] (v w : V) : DecidableEq (Quiver.Path.BoundedPaths v w 0) - Quiver.Path.instSubsingletonBddPaths π Mathlib.Combinatorics.Quiver.Path
{V : Type u_1} [Quiver V] (v w : V) : Subsingleton (Quiver.Path.BoundedPaths v w 0) - Quiver.Reachable.elim π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a b : V} {p : Prop} (h : Quiver.Reachable a b) (hp : β (a : Quiver.Path a b), p) : p - Quiver.Path.length_nil π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a : V} : Quiver.Path.nil.length = 0 - Quiver.Path.comp π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a b c : V} : Quiver.Path a b β Quiver.Path b c β Quiver.Path a c - Quiver.Path.cons π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a b c : V} : Quiver.Path a b β (b βΆ c) β Quiver.Path a c - Quiver.Path.instDecidableEq π Mathlib.Combinatorics.Quiver.Path
{V : Type u_1} [Quiver V] [DecidableEq V] [(v w : V) β DecidableEq (v βΆ w)] (v w : V) : DecidableEq (Quiver.Path v w) - Quiver.Reachable.trans π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a b c : V} (hab : Quiver.Reachable a b) (hbc : Quiver.Reachable b c) : Quiver.Reachable a c - Quiver.Path.decidableEqBoundedPaths π Mathlib.Combinatorics.Quiver.Path
{V : Type u_1} [Quiver V] [DecidableEq V] [(v w : V) β DecidableEq (v βΆ w)] (n : β) (v w : V) : DecidableEq (Quiver.Path.BoundedPaths v w n) - Quiver.Path.isChain_toList_nonempty π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a b : V} (p : Quiver.Path a b) : List.IsChain (fun x y => Nonempty (y βΆ x)) p.toList - Quiver.Path.toList_injective π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] [β (a b : V), Subsingleton (a βΆ b)] (a b : V) : Function.Injective Quiver.Path.toList - Quiver.Path.eq_of_length_zero π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a b : V} (p : Quiver.Path a b) (hzero : p.length = 0) : a = b - Quiver.Path.comp_nil π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a b : V} (p : Quiver.Path a b) : p.comp Quiver.Path.nil = p - Quiver.Path.length_toPath π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a b : V} (e : a βΆ b) : e.toPath.length = 1 - Quiver.Path.nil_comp π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a b : V} (p : Quiver.Path a b) : Quiver.Path.nil.comp p = p - Quiver.Path.comp_injective_right π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a b c : V} (p : Quiver.Path a b) : Function.Injective p.comp - Quiver.Path.isChain_cons_toList_nonempty π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a b : V} (p : Quiver.Path a b) : List.IsChain (fun x y => Nonempty (y βΆ x)) (b :: p.toList) - Quiver.Path.cons_ne_nil π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a b : V} (p : Quiver.Path a b) (e : b βΆ a) : p.cons e β Quiver.Path.nil - Quiver.Path.eq_nil_of_length_zero π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a : V} (p : Quiver.Path a a) (hzero : p.length = 0) : p = Quiver.Path.nil - Quiver.Path.nil_ne_cons π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a b : V} (p : Quiver.Path a b) (e : b βΆ a) : Quiver.Path.nil β p.cons e - Prefunctor.mapPath π Mathlib.Combinatorics.Quiver.Path
{V : Type uβ} [Quiver V] {W : Type uβ} [Quiver W] (F : V β₯€q W) {a b : V} : Quiver.Path a b β Quiver.Path (F.obj a) (F.obj b) - Quiver.Path.comp_injective_left π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a b c : V} (q : Quiver.Path b c) : Function.Injective fun p => p.comp q - Quiver.Path.comp_toPath_eq_cons π Mathlib.Combinatorics.Quiver.Path
{V : Type u_1} [Quiver V] {a b c : V} (p : Quiver.Path a b) (e : b βΆ c) : p.comp e.toPath = p.cons e - Prefunctor.mapPath_id π Mathlib.Combinatorics.Quiver.Path
{V : Type uβ} [Quiver V] {a b : V} (p : Quiver.Path a b) : (πq V).mapPath p = p - Quiver.Path.decidableEqBddPathsOfDecidableEq π Mathlib.Combinatorics.Quiver.Path
{V : Type u_1} [Quiver V] (n : β) (hβ : DecidableEq V) (hβ : (v w : V) β DecidableEq (v βΆ w)) (hβ : (v w : V) β DecidableEq (Quiver.Path.BoundedPaths v w n)) (v w : V) : DecidableEq (Quiver.Path.BoundedPaths v w (n + 1)) - Quiver.Path.toList_inj π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a b : V} [β (a b : V), Subsingleton (a βΆ b)] {p q : Quiver.Path a b} : p.toList = q.toList β p = q - Quiver.Path.length_cons π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] (a b c : V) (p : Quiver.Path a b) (e : b βΆ c) : (p.cons e).length = p.length + 1 - Quiver.Path.length_comp π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a b : V} (p : Quiver.Path a b) {c : V} (q : Quiver.Path b c) : (p.comp q).length = p.length + q.length - Prefunctor.mapPath_nil π Mathlib.Combinatorics.Quiver.Path
{V : Type uβ} [Quiver V] {W : Type uβ} [Quiver W] (F : V β₯€q W) (a : V) : F.mapPath Quiver.Path.nil = Quiver.Path.nil - Quiver.Path.comp_inj_left π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a b c : V} {pβ pβ : Quiver.Path a b} {q : Quiver.Path b c} : pβ.comp q = pβ.comp q β pβ = pβ - Quiver.Path.comp_inj_right π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a b c : V} {p : Quiver.Path a b} {qβ qβ : Quiver.Path b c} : p.comp qβ = p.comp qβ β qβ = qβ - Quiver.Path.obj_eq_of_cons_eq_cons π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a b c d : V} {p : Quiver.Path a b} {p' : Quiver.Path a c} {e : b βΆ d} {e' : c βΆ d} (h : p.cons e = p'.cons e') : b = c - Quiver.Path.toList_comp π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a b : V} (p : Quiver.Path a b) {c : V} (q : Quiver.Path b c) : (p.comp q).toList = q.toList ++ p.toList - Quiver.Path.comp_assoc π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a b c d : V} (p : Quiver.Path a b) (q : Quiver.Path b c) (r : Quiver.Path c d) : (p.comp q).comp r = p.comp (q.comp r) - Quiver.Path.comp_cons π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a b c d : V} (p : Quiver.Path a b) (q : Quiver.Path b c) (e : c βΆ d) : p.comp (q.cons e) = (p.comp q).cons e - Quiver.Path.heq_of_cons_eq_cons π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a b c d : V} {p : Quiver.Path a b} {p' : Quiver.Path a c} {e : b βΆ d} {e' : c βΆ d} (h : p.cons e = p'.cons e') : p β p' - Quiver.Path.hom_heq_of_cons_eq_cons π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a b c d : V} {p : Quiver.Path a b} {p' : Quiver.Path a c} {e : b βΆ d} {e' : c βΆ d} (h : p.cons e = p'.cons e') : e β e' - Quiver.Path.length_ne_zero_iff_eq_cons π Mathlib.Combinatorics.Quiver.Path
{V : Type u_1} [Quiver V] {a b : V} (p : Quiver.Path a b) : p.length β 0 β β c p' e, p = p'.cons e - Prefunctor.mapPath_toPath π Mathlib.Combinatorics.Quiver.Path
{V : Type uβ} [Quiver V] {W : Type uβ} [Quiver W] (F : V β₯€q W) {a b : V} (f : a βΆ b) : F.mapPath f.toPath = (F.map f).toPath - Quiver.Path.comp_inj π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a b c : V} {pβ pβ : Quiver.Path a b} {qβ qβ : Quiver.Path b c} (hq : qβ.length = qβ.length) : pβ.comp qβ = pβ.comp qβ β pβ = pβ β§ qβ = qβ - Quiver.Path.comp_inj' π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a b c : V} {pβ pβ : Quiver.Path a b} {qβ qβ : Quiver.Path b c} (h : pβ.length = pβ.length) : pβ.comp qβ = pβ.comp qβ β pβ = pβ β§ qβ = qβ - Quiver.Path.eq_toPath_comp_of_length_eq_succ π Mathlib.Combinatorics.Quiver.Path
{V : Type u} [Quiver V] {a b : V} (p : Quiver.Path a b) {n : β} (hp : p.length = n + 1) : β c f q, β (_ : q.length = n), p = f.toPath.comp q - Quiver.Path.length_ne_zero_iff_eq_comp π Mathlib.Combinatorics.Quiver.Path
{V : Type u_1} [Quiver V] {a b : V} (p : Quiver.Path a b) : p.length β 0 β β c e p', p = e.toPath.comp p' β§ p.length = p'.length + 1 - Prefunctor.mapPath_comp π Mathlib.Combinatorics.Quiver.Path
{V : Type uβ} [Quiver V] {W : Type uβ} [Quiver W] (F : V β₯€q W) {a b : V} (p : Quiver.Path a b) {c : V} (q : Quiver.Path b c) : F.mapPath (p.comp q) = (F.mapPath p).comp (F.mapPath q) - Prefunctor.mapPath_cons π Mathlib.Combinatorics.Quiver.Path
{V : Type uβ} [Quiver V] {W : Type uβ} [Quiver W] (F : V β₯€q W) {a b c : V} (p : Quiver.Path a b) (e : b βΆ c) : F.mapPath (p.cons e) = (F.mapPath p).cons (F.map e) - Prefunctor.mapPath_comp_apply π Mathlib.Combinatorics.Quiver.Path
{V : Type uβ} [Quiver V] {W : Type uβ} [Quiver W] (F : V β₯€q W) {U : Type uβ} [Quiver U] (G : W β₯€q U) {a b : V} (p : Quiver.Path a b) : (F βq G).mapPath p = G.mapPath (F.mapPath p) - Quiver.PushQuiver π Mathlib.Combinatorics.Quiver.Push
{V : Type u} [Quiver V] {W : Type uβ} (Ο : V β W) : W β W β Type (max u uβ v) - Quiver.instPush π Mathlib.Combinatorics.Quiver.Push
{V : Type u_1} [Quiver V] {W : Type u_2} (Ο : V β W) : Quiver (Quiver.Push Ο) - Quiver.Push.of π Mathlib.Combinatorics.Quiver.Push
{V : Type u_1} [Quiver V] {W : Type u_2} (Ο : V β W) : V β₯€q Quiver.Push Ο - Quiver.PushQuiver.arrow π Mathlib.Combinatorics.Quiver.Push
{V : Type u} [Quiver V] {W : Type uβ} {Ο : V β W} {X Y : V} (f : X βΆ Y) : Quiver.PushQuiver Ο (Ο X) (Ο Y) - Quiver.Push.of_obj π Mathlib.Combinatorics.Quiver.Push
{V : Type u_1} [Quiver V] {W : Type u_2} (Ο : V β W) : (Quiver.Push.of Ο).obj = Ο - Quiver.Push.lift π Mathlib.Combinatorics.Quiver.Push
{V : Type u_1} [Quiver V] {W : Type u_2} (Ο : V β W) {W' : Type u_3} [Quiver W'] (Ο : V β₯€q W') (Ο : W β W') (h : β (x : V), Ο.obj x = Ο (Ο x)) : Quiver.Push Ο β₯€q W' - Quiver.Push.lift_obj π Mathlib.Combinatorics.Quiver.Push
{V : Type u_1} [Quiver V] {W : Type u_2} (Ο : V β W) {W' : Type u_3} [Quiver W'] (Ο : V β₯€q W') (Ο : W β W') (h : β (x : V), Ο.obj x = Ο (Ο x)) : (Quiver.Push.lift Ο Ο Ο h).obj = Ο - Quiver.Push.lift_comp π Mathlib.Combinatorics.Quiver.Push
{V : Type u_1} [Quiver V] {W : Type u_2} (Ο : V β W) {W' : Type u_3} [Quiver W'] (Ο : V β₯€q W') (Ο : W β W') (h : β (x : V), Ο.obj x = Ο (Ο x)) : Quiver.Push.of Ο βq Quiver.Push.lift Ο Ο Ο h = Ο - Quiver.Push.lift_unique π Mathlib.Combinatorics.Quiver.Push
{V : Type u_1} [Quiver V] {W : Type u_2} (Ο : V β W) {W' : Type u_3} [Quiver W'] (Ο : V β₯€q W') (Ο : W β W') (h : β (x : V), Ο.obj x = Ο (Ο x)) (Ξ¦ : Quiver.Push Ο β₯€q W') (Ξ¦β : Ξ¦.obj = Ο) (Ξ¦comp : Quiver.Push.of Ο βq Ξ¦ = Ο) : Ξ¦ = Quiver.Push.lift Ο Ο Ο h - Quiver.HasInvolutiveReverse π Mathlib.Combinatorics.Quiver.Symmetric
(V : Type u_2) [Quiver V] : Type (max u_2 v) - Quiver.HasReverse π Mathlib.Combinatorics.Quiver.Symmetric
(V : Type u_2) [Quiver V] : Type (max u_2 v) - Quiver.symmetrifyQuiver π Mathlib.Combinatorics.Quiver.Symmetric
(V : Type u) [Quiver V] : Quiver (Quiver.Symmetrify V) - Quiver.instHasInvolutiveReverseSymmetrify π Mathlib.Combinatorics.Quiver.Symmetric
{V : Type u_2} [Quiver V] : Quiver.HasInvolutiveReverse (Quiver.Symmetrify V) - Quiver.instHasReverseSymmetrify π Mathlib.Combinatorics.Quiver.Symmetric
{V : Type u_2} [Quiver V] : Quiver.HasReverse (Quiver.Symmetrify V) - Quiver.HasInvolutiveReverse.toHasReverse π Mathlib.Combinatorics.Quiver.Symmetric
{V : Type u_2} {instβ : Quiver V} [self : Quiver.HasInvolutiveReverse V] : Quiver.HasReverse V - Quiver.Symmetrify.of π Mathlib.Combinatorics.Quiver.Symmetric
{V : Type u_2} [Quiver V] : V β₯€q Quiver.Symmetrify V - Prefunctor.mapReverseId π Mathlib.Combinatorics.Quiver.Symmetric
{U : Type u_1} [Quiver U] [Quiver.HasReverse U] : (πq U).MapReverse - Prefunctor.MapReverse π Mathlib.Combinatorics.Quiver.Symmetric
{U : Type u_1} {V : Type u_2} [Quiver U] [Quiver V] [Quiver.HasReverse U] [Quiver.HasReverse V] (Ο : U β₯€q V) : Prop - Quiver.reverse π Mathlib.Combinatorics.Quiver.Symmetric
{V : Type u_4} [Quiver V] [Quiver.HasReverse V] {a b : V} : (a βΆ b) β (b βΆ a) - Quiver.HasReverse.mk π Mathlib.Combinatorics.Quiver.Symmetric
{V : Type u_2} [Quiver V] (reverse' : {a b : V} β (a βΆ b) β (b βΆ a)) : Quiver.HasReverse V - Quiver.HasReverse.reverse' π Mathlib.Combinatorics.Quiver.Symmetric
{V : Type u_2} {instβ : Quiver V} [self : Quiver.HasReverse V] {a b : V} : (a βΆ b) β (b βΆ a) - Quiver.Hom.toNeg π Mathlib.Combinatorics.Quiver.Symmetric
{V : Type u_2} [Quiver V] {X Y : V} (f : X βΆ Y) : Y βΆ X - Quiver.Hom.toPos π Mathlib.Combinatorics.Quiver.Symmetric
{V : Type u_2} [Quiver V] {X Y : V} (f : X βΆ Y) : X βΆ Y - Quiver.Path.reverse π Mathlib.Combinatorics.Quiver.Symmetric
{V : Type u_2} [Quiver V] [Quiver.HasReverse V] {a b : V} : Quiver.Path a b β Quiver.Path b a - Quiver.Push.instHasInvolutiveReverse π Mathlib.Combinatorics.Quiver.Symmetric
{V : Type u_2} [Quiver V] {V' : Type u_4} (Ο : V β V') [h : Quiver.HasInvolutiveReverse V] : Quiver.HasInvolutiveReverse (Quiver.Push Ο) - Quiver.Push.instHasReverse π Mathlib.Combinatorics.Quiver.Symmetric
{V : Type u_2} [Quiver V] {V' : Type u_4} (Ο : V β V') [Quiver.HasReverse V] : Quiver.HasReverse (Quiver.Push Ο) - Quiver.Symmetrify.of_obj π Mathlib.Combinatorics.Quiver.Symmetric
{V : Type u_2} [Quiver V] (a : V) : Quiver.Symmetrify.of.obj a = id a - Prefunctor.symmetrify π Mathlib.Combinatorics.Quiver.Symmetric
{U : Type u_1} {V : Type u_2} [Quiver U] [Quiver V] (Ο : U β₯€q V) : Quiver.Symmetrify U β₯€q Quiver.Symmetrify V - Quiver.Symmetrify.lift π Mathlib.Combinatorics.Quiver.Symmetric
{V : Type u_2} [Quiver V] {V' : Type u_4} [Quiver V'] [Quiver.HasReverse V'] (Ο : V β₯€q V') : Quiver.Symmetrify V β₯€q V' - Prefunctor.symmetrify_mapReverse π Mathlib.Combinatorics.Quiver.Symmetric
{U : Type u_1} {V : Type u_2} [Quiver U] [Quiver V] (Ο : U β₯€q V) : Ο.symmetrify.MapReverse - Quiver.HasInvolutiveReverse.mk π Mathlib.Combinatorics.Quiver.Symmetric
{V : Type u_2} [Quiver V] [toHasReverse : Quiver.HasReverse V] (inv' : β {a b : V} (f : a βΆ b), Quiver.reverse (Quiver.reverse f) = f) : Quiver.HasInvolutiveReverse V - Prefunctor.symmetrify_obj π Mathlib.Combinatorics.Quiver.Symmetric
{U : Type u_1} {V : Type u_2} [Quiver U] [Quiver V] (Ο : U β₯€q V) (aβ : U) : Ο.symmetrify.obj aβ = Ο.obj aβ - Quiver.reverse_reverse π Mathlib.Combinatorics.Quiver.Symmetric
{V : Type u_2} [Quiver V] [h : Quiver.HasInvolutiveReverse V] {a b : V} (f : a βΆ b) : Quiver.reverse (Quiver.reverse f) = f - Quiver.HasInvolutiveReverse.inv' π Mathlib.Combinatorics.Quiver.Symmetric
{V : Type u_2} {instβ : Quiver V} [self : Quiver.HasInvolutiveReverse V] {a b : V} (f : a βΆ b) : Quiver.reverse (Quiver.reverse f) = f - Quiver.Path.reverse_reverse π Mathlib.Combinatorics.Quiver.Symmetric
{V : Type u_2} [Quiver V] [h : Quiver.HasInvolutiveReverse V] {a b : V} (p : Quiver.Path a b) : p.reverse.reverse = p - Quiver.Push.ofMapReverse π Mathlib.Combinatorics.Quiver.Symmetric
{V : Type u_2} [Quiver V] {V' : Type u_4} (Ο : V β V') [h : Quiver.HasInvolutiveReverse V] : (Quiver.Push.of Ο).MapReverse - Quiver.Symmetrify.lift_spec π Mathlib.Combinatorics.Quiver.Symmetric
{V : Type u_2} [Quiver V] {V' : Type u_4} [Quiver V'] [Quiver.HasReverse V'] (Ο : V β₯€q V') : Quiver.Symmetrify.of βq Quiver.Symmetrify.lift Ο = Ο - Quiver.Path.reverse_toPath π Mathlib.Combinatorics.Quiver.Symmetric
{V : Type u_2} [Quiver V] [Quiver.HasReverse V] {a b : V} (f : a βΆ b) : f.toPath.reverse = (Quiver.reverse f).toPath - Quiver.symmetrify_reverse π Mathlib.Combinatorics.Quiver.Symmetric
{V : Type u_2} [Quiver V] {a b : Quiver.Symmetrify V} (e : a βΆ b) : Quiver.reverse e = Sum.swap e - Quiver.eq_reverse_iff π Mathlib.Combinatorics.Quiver.Symmetric
{V : Type u_2} [Quiver V] [h : Quiver.HasInvolutiveReverse V] {a b : V} (f : a βΆ b) (g : b βΆ a) : f = Quiver.reverse g β Quiver.reverse f = g - Quiver.reverse_inj π Mathlib.Combinatorics.Quiver.Symmetric
{V : Type u_2} [Quiver V] [h : Quiver.HasInvolutiveReverse V] {a b : V} (f g : a βΆ b) : Quiver.reverse f = Quiver.reverse g β f = g - Quiver.Symmetrify.of_map π Mathlib.Combinatorics.Quiver.Symmetric
{V : Type u_2} [Quiver V] {Xβ Yβ : V} (val : Xβ βΆ Yβ) : Quiver.Symmetrify.of.map val = Sum.inl val - Quiver.Path.reverse_comp π Mathlib.Combinatorics.Quiver.Symmetric
{V : Type u_2} [Quiver V] [Quiver.HasReverse V] {a b c : V} (p : Quiver.Path a b) (q : Quiver.Path b c) : (p.comp q).reverse = q.reverse.comp p.reverse - Prefunctor.mapReverseComp π Mathlib.Combinatorics.Quiver.Symmetric
{U : Type u_1} {V : Type u_2} {W : Type u_3} [Quiver U] [Quiver V] [Quiver W] [Quiver.HasReverse U] [Quiver.HasReverse V] [Quiver.HasReverse W] (Ο : U β₯€q V) (Ο : V β₯€q W) [Ο.MapReverse] [Ο.MapReverse] : (Ο βq Ο).MapReverse - Prefunctor.map_reverse π Mathlib.Combinatorics.Quiver.Symmetric
{U : Type u_1} {V : Type u_2} [Quiver U] [Quiver V] [Quiver.HasReverse U] [Quiver.HasReverse V] (Ο : U β₯€q V) [Ο.MapReverse] {u v : U} (e : u βΆ v) : Ο.map (Quiver.reverse e) = Quiver.reverse (Ο.map e) - Prefunctor.MapReverse.map_reverse' π Mathlib.Combinatorics.Quiver.Symmetric
{U : Type u_1} {V : Type u_2} {instβ : Quiver U} {instβΒΉ : Quiver V} {instβΒ² : Quiver.HasReverse U} {instβΒ³ : Quiver.HasReverse V} {Ο : U β₯€q V} [self : Ο.MapReverse] {u v : U} (e : u βΆ v) : Ο.map (Quiver.reverse e) = Quiver.reverse (Ο.map e) - Prefunctor.MapReverse.mk π Mathlib.Combinatorics.Quiver.Symmetric
{U : Type u_1} {V : Type u_2} [Quiver U] [Quiver V] [Quiver.HasReverse U] [Quiver.HasReverse V] {Ο : U β₯€q V} (map_reverse' : β {u v : U} (e : u βΆ v), Ο.map (Quiver.reverse e) = Quiver.reverse (Ο.map e)) : Ο.MapReverse - Prefunctor.symmetrify_map π Mathlib.Combinatorics.Quiver.Symmetric
{U : Type u_1} {V : Type u_2} [Quiver U] [Quiver V] (Ο : U β₯€q V) {Xβ Yβ : Quiver.Symmetrify U} (aβ : (Xβ βΆ Yβ) β (Yβ βΆ Xβ)) : Ο.symmetrify.map aβ = Sum.map Ο.map Ο.map aβ - Quiver.Symmetrify.lift_unique π Mathlib.Combinatorics.Quiver.Symmetric
{V : Type u_2} [Quiver V] {V' : Type u_4} [Quiver V'] [Quiver.HasReverse V'] (Ο : V β₯€q V') (Ξ¦ : Quiver.Symmetrify V β₯€q V') (hΞ¦ : Quiver.Symmetrify.of βq Ξ¦ = Ο) (hΞ¦inv : β {X Y : Quiver.Symmetrify V} (f : X βΆ Y), Ξ¦.map (Quiver.reverse f) = Quiver.reverse (Ξ¦.map f)) : Ξ¦ = Quiver.Symmetrify.lift Ο - Quiver.Symmetrify.lift_reverse π Mathlib.Combinatorics.Quiver.Symmetric
{V : Type u_2} [Quiver V] {V' : Type u_4} [Quiver V'] [h : Quiver.HasInvolutiveReverse V'] (Ο : V β₯€q V') {X Y : Quiver.Symmetrify V} (f : X βΆ Y) : (Quiver.Symmetrify.lift Ο).map (Quiver.reverse f) = Quiver.reverse ((Quiver.Symmetrify.lift Ο).map f) - Quiver.Push.of_reverse π Mathlib.Combinatorics.Quiver.Symmetric
{V : Type u_2} [Quiver V] {V' : Type u_4} (Ο : V β V') [Quiver.HasInvolutiveReverse V] (X Y : V) (f : X βΆ Y) : Quiver.reverse ((Quiver.Push.of Ο).map f) = (Quiver.Push.of Ο).map (Quiver.reverse f) - Quiver.Hom.op_inj π Mathlib.CategoryTheory.Opposites
{C : Type uβ} [Quiver C] {X Y : C} : Function.Injective Quiver.Hom.op - Quiver.Hom.unop_inj π Mathlib.CategoryTheory.Opposites
{C : Type uβ} [Quiver C] {X Y : Cα΅α΅} : Function.Injective Quiver.Hom.unop - Quiver.Hom.unop_op π Mathlib.CategoryTheory.Opposites
{C : Type uβ} [Quiver C] {X Y : C} (f : X βΆ Y) : f.op.unop = f - Quiver.Hom.unop_op' π Mathlib.CategoryTheory.Opposites
{C : Type uβ} [Quiver C] {X Y : Cα΅α΅} {x : Opposite.unop Y βΆ Opposite.unop X} : Quiver.Hom.unop (Opposite.op x) = x - Quiver.Hom.op_unop π Mathlib.CategoryTheory.Opposites
{C : Type uβ} [Quiver C] {X Y : Cα΅α΅} (f : X βΆ Y) : f.unop.op = f - Quiver.Hom.unop_mk π Mathlib.CategoryTheory.Opposites
{C : Type uβ} [Quiver C] {X Y : Cα΅α΅} (f : X βΆ Y) : Quiver.Hom.unop (Opposite.op f) = f - CategoryTheory.instQuiverArrow π Mathlib.CategoryTheory.Comma.Arrow
{T : Type u} [CategoryTheory.Category.{v, u} T] : Quiver (CategoryTheory.Arrow T) - CategoryTheory.Cat.instQuiver π Mathlib.CategoryTheory.Category.Cat
: Quiver CategoryTheory.Cat - CategoryTheory.Cat.Hom.instQuiver π Mathlib.CategoryTheory.Category.Cat
{C D : CategoryTheory.Cat} : Quiver (C βΆ D) - CategoryTheory.instQuiverComonad π Mathlib.CategoryTheory.Monad.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] : Quiver (CategoryTheory.Comonad C) - CategoryTheory.instQuiverMonad π Mathlib.CategoryTheory.Monad.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] : Quiver (CategoryTheory.Monad C) - CategoryTheory.PrelaxFunctorStruct.id π Mathlib.CategoryTheory.Bicategory.Functor.Prelax
(B : Type uβ) [Quiver B] [(a b : B) β Quiver (a βΆ b)] : CategoryTheory.PrelaxFunctorStruct B B - CategoryTheory.PrelaxFunctorStruct.instInhabited π Mathlib.CategoryTheory.Bicategory.Functor.Prelax
{B : Type uβ} [Quiver B] [(a b : B) β Quiver (a βΆ b)] : Inhabited (CategoryTheory.PrelaxFunctorStruct B B) - CategoryTheory.PrelaxFunctorStruct π Mathlib.CategoryTheory.Bicategory.Functor.Prelax
(B : Type uβ) [Quiver B] [(a b : B) β Quiver (a βΆ b)] (C : Type uβ) [Quiver C] [(a b : C) β Quiver (a βΆ b)] : Type (max (max (max (max (max uβ uβ) vβ) vβ) wβ) wβ) - CategoryTheory.PrelaxFunctorStruct.id_toPrefunctor π Mathlib.CategoryTheory.Bicategory.Functor.Prelax
(B : Type uβ) [Quiver B] [(a b : B) β Quiver (a βΆ b)] : (CategoryTheory.PrelaxFunctorStruct.id B).toPrefunctor = πq B - CategoryTheory.PrelaxFunctorStruct.toPrefunctor π Mathlib.CategoryTheory.Bicategory.Functor.Prelax
{B : Type uβ} [Quiver B] [(a b : B) β Quiver (a βΆ b)] {C : Type uβ} [Quiver C] [(a b : C) β Quiver (a βΆ b)] (self : CategoryTheory.PrelaxFunctorStruct B C) : B β₯€q C - CategoryTheory.PrelaxFunctorStruct.comp π Mathlib.CategoryTheory.Bicategory.Functor.Prelax
{B : Type uβ} [Quiver B] [(a b : B) β Quiver (a βΆ b)] {C : Type uβ} [Quiver C] [(a b : C) β Quiver (a βΆ b)] {D : Type uβ} [Quiver D] [(a b : D) β Quiver (a βΆ b)] (F : CategoryTheory.PrelaxFunctorStruct B C) (G : CategoryTheory.PrelaxFunctorStruct C D) : CategoryTheory.PrelaxFunctorStruct B D - CategoryTheory.PrelaxFunctorStruct.mkOfHomPrefunctors π Mathlib.CategoryTheory.Bicategory.Functor.Prelax
{B : Type uβ} [Quiver B] [(a b : B) β Quiver (a βΆ b)] {C : Type uβ} [Quiver C] [(a b : C) β Quiver (a βΆ b)] (F : B β C) (F' : (a b : B) β (a βΆ b) β₯€q (F a βΆ F b)) : CategoryTheory.PrelaxFunctorStruct B C - CategoryTheory.PrelaxFunctorStruct.id_mapβ π Mathlib.CategoryTheory.Bicategory.Functor.Prelax
(B : Type uβ) [Quiver B] [(a b : B) β Quiver (a βΆ b)] {aβ bβ : B} {fβ gβ : aβ βΆ bβ} (Ξ· : fβ βΆ gβ) : (CategoryTheory.PrelaxFunctorStruct.id B).mapβ Ξ· = Ξ· - CategoryTheory.PrelaxFunctorStruct.mkOfHomPrefunctors_toPrefunctor_obj π Mathlib.CategoryTheory.Bicategory.Functor.Prelax
{B : Type uβ} [Quiver B] [(a b : B) β Quiver (a βΆ b)] {C : Type uβ} [Quiver C] [(a b : C) β Quiver (a βΆ b)] (F : B β C) (F' : (a b : B) β (a βΆ b) β₯€q (F a βΆ F b)) (aβ : B) : (CategoryTheory.PrelaxFunctorStruct.mkOfHomPrefunctors F F').obj aβ = F aβ - CategoryTheory.PrelaxFunctorStruct.comp_toPrefunctor π Mathlib.CategoryTheory.Bicategory.Functor.Prelax
{B : Type uβ} [Quiver B] [(a b : B) β Quiver (a βΆ b)] {C : Type uβ} [Quiver C] [(a b : C) β Quiver (a βΆ b)] {D : Type uβ} [Quiver D] [(a b : D) β Quiver (a βΆ b)] (F : CategoryTheory.PrelaxFunctorStruct B C) (G : CategoryTheory.PrelaxFunctorStruct C D) : (F.comp G).toPrefunctor = F.toPrefunctor βq G.toPrefunctor - CategoryTheory.PrelaxFunctorStruct.mk π Mathlib.CategoryTheory.Bicategory.Functor.Prelax
{B : Type uβ} [Quiver B] [(a b : B) β Quiver (a βΆ b)] {C : Type uβ} [Quiver C] [(a b : C) β Quiver (a βΆ b)] (toPrefunctor : B β₯€q C) (mapβ : {a b : B} β {f g : a βΆ b} β (f βΆ g) β (toPrefunctor.map f βΆ toPrefunctor.map g)) : CategoryTheory.PrelaxFunctorStruct B C - CategoryTheory.PrelaxFunctorStruct.mkOfHomPrefunctors_toPrefunctor_map π Mathlib.CategoryTheory.Bicategory.Functor.Prelax
{B : Type uβ} [Quiver B] [(a b : B) β Quiver (a βΆ b)] {C : Type uβ} [Quiver C] [(a b : C) β Quiver (a βΆ b)] (F : B β C) (F' : (a b : B) β (a βΆ b) β₯€q (F a βΆ F b)) {a b : B} (aβ : a βΆ b) : (CategoryTheory.PrelaxFunctorStruct.mkOfHomPrefunctors F F').map aβ = (F' a b).obj aβ - CategoryTheory.PrelaxFunctorStruct.mapβ π Mathlib.CategoryTheory.Bicategory.Functor.Prelax
{B : Type uβ} [Quiver B] [(a b : B) β Quiver (a βΆ b)] {C : Type uβ} [Quiver C] [(a b : C) β Quiver (a βΆ b)] (self : CategoryTheory.PrelaxFunctorStruct B C) {a b : B} {f g : a βΆ b} : (f βΆ g) β (self.map f βΆ self.map g) - CategoryTheory.PrelaxFunctorStruct.mkOfHomPrefunctors_mapβ π Mathlib.CategoryTheory.Bicategory.Functor.Prelax
{B : Type uβ} [Quiver B] [(a b : B) β Quiver (a βΆ b)] {C : Type uβ} [Quiver C] [(a b : C) β Quiver (a βΆ b)] (F : B β C) (F' : (a b : B) β (a βΆ b) β₯€q (F a βΆ F b)) {a b : B} {fβ gβ : a βΆ b} (aβ : fβ βΆ gβ) : (CategoryTheory.PrelaxFunctorStruct.mkOfHomPrefunctors F F').mapβ aβ = (F' a b).map aβ - CategoryTheory.PrelaxFunctorStruct.comp_mapβ π Mathlib.CategoryTheory.Bicategory.Functor.Prelax
{B : Type uβ} [Quiver B] [(a b : B) β Quiver (a βΆ b)] {C : Type uβ} [Quiver C] [(a b : C) β Quiver (a βΆ b)] {D : Type uβ} [Quiver D] [(a b : D) β Quiver (a βΆ b)] (F : CategoryTheory.PrelaxFunctorStruct B C) (G : CategoryTheory.PrelaxFunctorStruct C D) {aβ bβ : B} {fβ gβ : aβ βΆ bβ} (Ξ· : fβ βΆ gβ) : (F.comp G).mapβ Ξ· = G.mapβ (F.mapβ Ξ·) - Quiver.Hom.unop_inj_iff π Mathlib.Algebra.Category.CommAlgCat.Monoidal
{C : Type uβ} [Quiver C] {X Y : Cα΅α΅} {aβ aβ : X βΆ Y} : aβ = aβ β aβ.unop = aβ.unop - HomRel π Mathlib.CategoryTheory.Quotient
(C : Type u_1) [Quiver C] : Type (max u_1 u_2) - instInhabitedHomRel π Mathlib.CategoryTheory.Quotient
(C : Type u_1) [Quiver C] : Inhabited (HomRel C) - CategoryTheory.Paths.categoryPaths π Mathlib.CategoryTheory.PathCategory.Basic
(V : Type uβ) [Quiver V] : CategoryTheory.Category.{max uβ vβ, uβ} (CategoryTheory.Paths V) - CategoryTheory.Paths.of π Mathlib.CategoryTheory.PathCategory.Basic
(V : Type uβ) [Quiver V] : V β₯€q CategoryTheory.Paths V - 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.Paths.of_obj π Mathlib.CategoryTheory.PathCategory.Basic
(V : Type uβ) [Quiver V] (X : V) : (CategoryTheory.Paths.of V).obj X = X - 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.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.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.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
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 01cceef