Mathlib Map

Theorems · Definition · combinatorics

Quiver.Labelling

(V : Type u) → [Quiver V] → Sort u_1 → Sort (imax (u + 1) (u + 1) (u_2 + 1) u_1)

An L-labelling of a quiver assigns to every arrow an element of L.

Defined in
Mathlib.Combinatorics.Quiver.Subquiver
Cited by
2 results in Mathlib
Foundations
Depth 2 from the axioms · uses no axioms
Assumes
Quiver
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

IsFreeGroupoid.unique_lift · cited by 2IsFreeGroupoid.unique_liftIsFreeGroupoid.noConfusion · cited by 0IsFreeGroupoid.noConfusionIsFreeGroupoid.noConfusionType · cited by 0IsFreeGroupoid.noConfusio…IsFreeGroupoid.recOn · cited by 0IsFreeGroupoid.recOnIsFreeGroupoid.SpanningTree.endIsFree · cited by 0SpanningTree.endIsFreeIsFreeGroupoid.mk.noConfusion · cited by 0mk.noConfusionIsFreeGroupoid.casesOn · cited by 0IsFreeGroupoid.casesOnQuiver.Hom · cited by 32603Quiver.HomQuiver · cited by 405QuiverQuiver.LabellingCITED BYCITES

Cites2

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by7

Results whose statement or proof uses this declaration.