Theorems · Inductive type · combinatorics
Prefunctor.IsCovering
{U : Type u_1} → [inst : Quiver U] → {V : Type u_2} → [inst_1 : Quiver V] → U ⥤q V → PropA prefunctor is a covering of quivers if it defines bijections on all stars and costars.
- Defined in
- Mathlib.Combinatorics.Quiver.Covering
- Cited by
- 11 results in Mathlib
- Foundations
- Depth 2 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Quiverstatement · cited by 405
- Prefunctorstatement · cited by 116
Cited by13
Results whose statement or proof uses this declaration.
- Prefunctor.IsCovering.star_bijectivestatement and proof · cited by 6
- Prefunctor.IsCovering.costar_bijectivestatement and proof · cited by 4
- Prefunctor.isCovering_of_bijective_costarstatement · cited by 0
- Prefunctor.isCovering_of_bijective_starstatement · cited by 0
- Quiver.SchreierGraph.labelling_isCoveringstatement · cited by 0
- Prefunctor.IsCovering.casesOnstatement and proof · cited by 0
- Prefunctor.IsCovering.compstatement and proof · cited by 0
- Prefunctor.IsCovering.map_injectivestatement and proof · cited by 0
- Prefunctor.IsCovering.of_comp_leftstatement and proof · cited by 0
- Prefunctor.IsCovering.of_comp_rightstatement and proof · cited by 0
- Prefunctor.IsCovering.pathStar_bijectivestatement and proof · cited by 0
- Prefunctor.IsCovering.recOnstatement and proof · cited by 0