Theorems · Theorem · combinatorics
SimpleGraph.Walk.ext_support
∀ {V : Type u} {G : SimpleGraph V} {u v : V} {p q : G.Walk u v}, p.support = q.support → p = q- Cited by
- 14 results in Mathlib
- Foundations
- Depth 20 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
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.Walkstatement and proof · cited by 915
- SimpleGraph.Walk.supportstatement and proof · cited by 307
- SimpleGraph.Dartproof · cited by 109
- SimpleGraph.Walk.dartsproof · cited by 74
- SimpleGraph.Dart.toProdproof · cited by 48
- Function.RightInverse.injectiveproof · cited by 20
- Function.Injective.list_mapproof · cited by 3
- SimpleGraph.Dart.toProd_injectiveproof · cited by 1
- SimpleGraph.Walk.darts_injectiveproof · cited by 1
- List.rightInverse_unzip_zipproof · cited by 1
Cited by14
Results whose statement or proof uses this declaration.
- SimpleGraph.Walk.isSubwalk_iff_support_isInfixproof · cited by 7
- SimpleGraph.Walk.dropUntil_eq_dropproof · cited by 3
- SimpleGraph.Walk.takeUntil_eq_takeproof · cited by 3
- SimpleGraph.Walk.ext_getVert_le_lengthproof · cited by 2
- SimpleGraph.Walk.append_take_drop_eqproof · cited by 2
- SimpleGraph.Walk.bypass_eq_self_of_length_le_length_bypassproof · cited by 2
- SimpleGraph.Walk.take_takeproof · cited by 1
- SimpleGraph.Walk.drop_cons_eqproof · cited by 1
- SimpleGraph.Walk.take_cons_eqproof · cited by 0
- SimpleGraph.Walk.reverse_tailproof · cited by 0
- SimpleGraph.Walk.drop_dropproof · cited by 0
- SimpleGraph.Walk.support_injectiveproof · cited by 0