Theorems · Theorem · combinatorics
SimpleGraph.Reachable.elim
∀ {V : Type u} {G : SimpleGraph V} {p : Prop} {u v : V}, G.Reachable u v → (∀ (a : G.Walk u v), p) → p- Cited by
- 7 results in Mathlib
- Foundations
- Depth 6 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
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.Reachablestatement and proof · cited by 141
Cited by7
Results whose statement or proof uses this declaration.
- SimpleGraph.Reachable.symmproof · cited by 15
- SimpleGraph.Reachable.mapproof · cited by 14
- SimpleGraph.Reachable.transproof · cited by 11
- SimpleGraph.edist_ne_top_iff_reachableproof · cited by 4
- SimpleGraph.Subgraph.preconnected_iff_forall_exists_walk_subgraphproof · cited by 1
- SimpleGraph.reachable_botproof · cited by 1
- SimpleGraph.Reachable.elim_pathproof · cited by 1