Theorems · Theorem · combinatorics
SimpleGraph.Walk.darts_reverse
∀ {V : Type u} {G : SimpleGraph V} {u v : V} (p : G.Walk u v),
p.reverse.darts = (List.map SimpleGraph.Dart.symm p.darts).reverse- Cited by
- 3 results in Mathlib
- Foundations
- Depth 11 from the axioms · uses propext
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjproof · cited by 1,346
- SimpleGraph.Walkstatement and proof · cited by 915
- SimpleGraph.Dartstatement · cited by 109
- SimpleGraph.Walk.dartsstatement and proof · cited by 74
- SimpleGraph.Adj.symmproof · cited by 66
- SimpleGraph.Walk.reversestatement and proof · cited by 55
- SimpleGraph.Dart.symmstatement and proof · cited by 14
- SimpleGraph.Walk.reverse_consproof · cited by 11
- SimpleGraph.Walk.darts_appendproof · cited by 3
Cited by3
Results whose statement or proof uses this declaration.
- SimpleGraph.Walk.edges_reverseproof · cited by 6
- SimpleGraph.Walk.dart_snd_mem_support_of_mem_dartsproof · cited by 1
- SimpleGraph.Walk.mem_darts_reverseproof · cited by 0