Theorems · Theorem · combinatorics
SimpleGraph.Preconnected.map
∀ {V : Type u} {V' : Type v} {G : SimpleGraph V} {H : SimpleGraph V'} (f : G →g H),
Function.Surjective ⇑f → G.Preconnected → H.Preconnected- Cited by
- 2 results in Mathlib
- Foundations
- Depth 9 from the axioms · uses no axioms
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.
- DFunLike.coestatement and proof · cited by 62,936
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjstatement · cited by 1,346
- SimpleGraph.Homstatement and proof · cited by 139
- Nonempty.mapproof · cited by 101
- SimpleGraph.Walk.mapproof · cited by 66
- SimpleGraph.Preconnectedstatement and proof · cited by 49
- Function.Surjective.forall₂proof · cited by 11
Cited by2
Results whose statement or proof uses this declaration.
- SimpleGraph.Connected.mapproof · cited by 1
- SimpleGraph.Iso.preconnected_iffproof · cited by 0