Theorems · Inductive type · combinatorics
Quiver.HasReverse
(V : Type u_2) → [Quiver V] → Type (max u_2 v)
A quiver HasReverse if we can reverse an arrow p from a to b to get an arrow
p.reverse from b to a.
- Defined in
- Mathlib.Combinatorics.Quiver.Symmetric
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 1 from the axioms · uses no axioms
- Assumes
- Quiver
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Quiverstatement · cited by 405
Cited by28
Results whose statement or proof uses this declaration.
- Quiver.reversestatement and proof · cited by 23
- Quiver.Path.reversestatement and proof · cited by 7
- Prefunctor.MapReversestatement · cited by 6
- Quiver.Symmetrify.liftstatement and proof · cited by 5
- Quiver.Path.reverse_compstatement and proof · cited by 2
- Quiver.Symmetrify.lift_specstatement and proof · cited by 1
- Quiver.Symmetrify.lift_uniquestatement and proof · cited by 1
- Quiver.Path.reverse_toPathstatement and proof · cited by 1
- Prefunctor.map_reversestatement and proof · cited by 1
- Quiver.reverse_injproof · cited by 1
- Prefunctor.MapReverse.map_reverse'statement and proof · cited by 1
- Quiver.Path.reverse.eq_defstatement and proof · cited by 0