Theorems · Theorem · combinatorics
SimpleGraph.Walk.edges_eq_nil
∀ {V : Type u} {G : SimpleGraph V} {v w : V} {p : G.Walk v w}, p.edges = [] ↔ p.Nil- Cited by
- 5 results in Mathlib
- Foundations
- Depth 13 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.Adjproof · cited by 1,346
- SimpleGraph.Walkstatement and proof · cited by 915
- Sym2statement · cited by 737
- Sym2.mkproof · cited by 332
- SimpleGraph.Walk.edgesstatement and proof · cited by 145
- SimpleGraph.Walk.Nilstatement · cited by 102
- SimpleGraph.Walk.casesOnproof · cited by 59
Cited by5
Results whose statement or proof uses this declaration.
- SimpleGraph.Walk.IsPath.eq_snd_of_mem_edgesproof · cited by 3
- SimpleGraph.Walk.mk_penultimate_end_eq_getLast_edgesstatement and proof · cited by 1
- SimpleGraph.Walk.mk_start_snd_eq_head_edgesstatement and proof · cited by 1
- SimpleGraph.Walk.mk_penultimate_end_mem_edgesproof · cited by 0
- SimpleGraph.Walk.mk_start_snd_mem_edgesproof · cited by 0