Theorems · Definition · combinatorics
Quiver.Path.below
{V : Type u} →
[inst : Quiver V] →
{a : V} →
{motive : (a_1 : V) → Quiver.Path a a_1 → Sort u_1} →
{a_1 : V} → Quiver.Path a a_1 → Sort (max ((max u v) + 1) u_1)- Defined in
- Mathlib.Combinatorics.Quiver.Path
- Cited by
- 7 results in Mathlib
- Foundations
- Depth 4 from the axioms · uses no axioms
- Assumes
- Quiver
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Quiver.Homproof · cited by 32,603
- Quiverstatement and proof · cited by 405
- Quiver.Pathstatement and proof · cited by 166
Cited by9
Results whose statement or proof uses this declaration.
- Quiver.Path.brecOnstatement and proof · cited by 10
- Quiver.Path.brecOn.gostatement and proof · cited by 7
- Quiver.Path.brecOn.eqstatement and proof · cited by 6
- Quiver.Path.reverse.eq_defproof · cited by 0
- Quiver.Path.toList.eq_defproof · cited by 0
- IsFreeGroupoid.SpanningTree.homOfPath.eq_defproof · cited by 0
- CategoryTheory.FreeBicategory.inclusionPathAux.eq_defproof · cited by 0
- CategoryTheory.composePath.eq_defproof · cited by 0
- Quiver.Path.length.eq_defproof · cited by 0