Theorems · Theorem · combinatorics
SimpleGraph.Walk.isSubwalk_antisymm
∀ {V : Type u_1} {G : SimpleGraph V} {u v : V} {p₁ p₂ : G.Walk u v}, p₁.IsSubwalk p₂ → p₂.IsSubwalk p₁ → p₁ = p₂- Cited by
- 0 results in Mathlib
- Foundations
- Depth 70 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
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.IsSubwalkstatement and proof · cited by 46
- SimpleGraph.Walk.ext_supportproof · cited by 14
- SimpleGraph.Walk.isSubwalk_iff_support_isInfixproof · cited by 7
- List.infix_antisymmproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.