Theorems · Theorem · combinatorics
SimpleGraph.Walk.reverse_cons
∀ {V : Type u} {G : SimpleGraph V} {u v w : V} (h : G.Adj u v) (p : G.Walk v w),
(SimpleGraph.Walk.cons h p).reverse = p.reverse.append (SimpleGraph.Walk.cons ⋯ SimpleGraph.Walk.nil)- Cited by
- 11 results in Mathlib
- Foundations
- Depth 9 from the axioms · uses propext
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
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.Adjstatement and proof · cited by 1,346
- SimpleGraph.Walkstatement and proof · cited by 915
- SimpleGraph.Walk.appendstatement · cited by 95
- SimpleGraph.Adj.symmstatement and proof · cited by 66
- SimpleGraph.Walk.reversestatement · cited by 55
- SimpleGraph.Walk.reverseAuxproof · cited by 7
- SimpleGraph.Walk.reverseAux_appendproof · cited by 3
Cited by11
Results whose statement or proof uses this declaration.
- SimpleGraph.Walk.support_reverseproof · cited by 8
- SimpleGraph.Walk.reverse_reverseproof · cited by 6
- SimpleGraph.Walk.getVert_reverseproof · cited by 4
- SimpleGraph.Walk.darts_reverseproof · cited by 3
- SimpleGraph.Walk.reverse_concatproof · cited by 2
- SimpleGraph.Walk.toSubgraph_reverseproof · cited by 2
- SimpleGraph.Walk.penultimate_reverseproof · cited by 1
- SimpleGraph.Walk.reverse_mapproof · cited by 1
- SimpleGraph.Walk.nil_reverseproof · cited by 0
- SimpleGraph.Walk.concatRecAux.eq_defproof · cited by 0
- SimpleGraph.Walk.reverse_transferproof · cited by 0