Theorems · Theorem · combinatorics
SimpleGraph.map_le_of_subsingleton
∀ {V : Type u_1} {W : Type u_2} (G : SimpleGraph V) (G' : SimpleGraph W) (f : V ↪ W) [Subsingleton V],
SimpleGraph.map (⇑f) G ≤ G'- Defined in
- Mathlib.Combinatorics.SimpleGraph.Maps
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 19 from the axioms · uses propext, Quot.sound
- Assumes
- Subsingleton
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.
- DFunLike.coestatement and proof · cited by 62,936
- SimpleGraphstatement and proof · cited by 3,072
- Function.Embeddingstatement and proof · cited by 988
- SimpleGraph.mapstatement · cited by 49
- SimpleGraph.map_le_iff_le_comapproof · cited by 3
- SimpleGraph.le_comap_of_subsingletonproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.