Theorems · Definition · combinatorics
WideSubquiver
(V : Type u_1) → [Quiver V] → Type (max u_1 v)
A wide subquiver H of G picks out a set H a b of arrows from a to b
for every pair of vertices a b.
- Defined in
- Mathlib.Combinatorics.Quiver.Subquiver
- Cited by
- 7 results in Mathlib
- Foundations
- Depth 2 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.
- Setproof · cited by 53,352
- Quiver.Homproof · cited by 32,603
- Quiverstatement and proof · cited by 405
Cited by15
Results whose statement or proof uses this declaration.
- WideSubquiver.toTypestatement and proof · cited by 7
- IsFreeGroupoid.SpanningTree.homOfPathstatement and proof · cited by 4
- IsFreeGroupoid.SpanningTree.treeHomstatement and proof · cited by 4
- IsFreeGroupoid.SpanningTree.functorOfMonoidHomstatement and proof · cited by 3
- IsFreeGroupoid.SpanningTree.loopOfHomstatement and proof · cited by 3
- IsFreeGroupoid.SpanningTree.treeHom_eqstatement and proof · cited by 2
- Quiver.wideSubquiverSymmetrifystatement and proof · cited by 2
- IsFreeGroupoid.SpanningTree.loopOfHom_eq_idstatement and proof · cited by 1
- IsFreeGroupoid.SpanningTree.treeHom_rootstatement and proof · cited by 1
- Quiver.wideSubquiverEquivSetTotalstatement and proof · cited by 1
- IsFreeGroupoid.SpanningTree.endIsFreestatement and proof · cited by 0
- IsFreeGroupoid.SpanningTree.functorOfMonoidHom_mapstatement and proof · cited by 0