Theorems · Definition · combinatorics
Quiver.Total.casesOn
{V : Type u} →
[inst : Quiver V] →
{motive : Quiver.Total V → Sort u_1} →
(t : Quiver.Total V) →
((left right : V) → (hom : left ⟶ right) → motive { left := left, right := right, hom := hom }) → motive t- Defined in
- Mathlib.Combinatorics.Quiver.Subquiver
- Cited by
- 1 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.Homstatement and proof · cited by 32,603
- Quiverstatement and proof · cited by 405
- Quiver.Totalstatement and proof · cited by 6
Cited by3
Results whose statement or proof uses this declaration.
- IsFreeGroupoid.SpanningTree.endIsFreeproof · cited by 0
- Quiver.Total.noConfusionTypeproof · cited by 0
- Quiver.Total.noConfusionproof · cited by 0