Theorems · Theorem · combinatorics
SimpleGraph.Walk.getVert_append
∀ {V : Type u} {G : SimpleGraph V} {u v w : V} (p : G.Walk u v) (q : G.Walk v w) (i : ℕ),
(p.append q).getVert i = if i < p.length then p.getVert i else q.getVert (i - p.length)- Cited by
- 4 results in Mathlib
- Foundations
- Depth 21 from the axioms · uses propext
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
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.Walk.lengthstatement and proof · cited by 212
- SimpleGraph.Walk.getVertstatement and proof · cited by 114
- SimpleGraph.Walk.appendstatement and proof · cited by 95
- SimpleGraph.Walk.getVert_zeroproof · cited by 43
Cited by4
Results whose statement or proof uses this declaration.
- SimpleGraph.Walk.getVert_takeUntilproof · cited by 4
- SimpleGraph.Walk.getVert_reverseproof · cited by 4
- SimpleGraph.Walk.penultimate_reverseproof · cited by 1
- SimpleGraph.Walk.penultimate_concatproof · cited by 0