Theorems · Theorem · combinatorics
SimpleGraph.Walk.penultimate_reverse
∀ {V : Type u} {G : SimpleGraph V} {u v : V} (p : G.Walk u v), p.reverse.penultimate = p.snd- Cited by
- 1 results in Mathlib
- Foundations
- Depth 22 from the axioms · uses propext
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites17
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
- zero_addproof · cited by 2,366
- SimpleGraph.Adjproof · cited by 1,346
- SimpleGraph.Walkstatement and proof · cited by 915
- SimpleGraph.Walk.lengthproof · cited by 212
- SimpleGraph.Walk.getVertproof · cited by 114
- SimpleGraph.Walk.appendproof · cited by 95
- SimpleGraph.Adj.symmproof · cited by 66
- SimpleGraph.Walk.casesOnproof · cited by 59
- SimpleGraph.Walk.sndstatement · cited by 56
- SimpleGraph.Walk.reversestatement and proof · cited by 55
- SimpleGraph.Walk.penultimatestatement and proof · cited by 48
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.Walk.reverse_tailstatement and proof · cited by 0