Theorems · Theorem · combinatorics
SimpleGraph.Copy.injective
∀ {α : Type u_4} {β : Type u_5} {A : SimpleGraph α} {B : SimpleGraph β} (f : A.Copy B), Function.Injective ⇑f.toHom- Defined in
- Mathlib.Combinatorics.SimpleGraph.Copy
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 7 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement · cited by 62,936
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjstatement · cited by 1,346
- SimpleGraph.Homstatement · cited by 139
- SimpleGraph.Copystatement and proof · cited by 49
- SimpleGraph.Copy.toHomstatement · cited by 14
- SimpleGraph.Copy.injective'proof · cited by 1
Cited by5
Results whose statement or proof uses this declaration.
- SimpleGraph.Copy.toEmbeddingproof · cited by 9
- SimpleGraph.IsContained.egirth_leproof · cited by 2
- SimpleGraph.Copy.isoSubgraphMapproof · cited by 1
- SimpleGraph.cycleGraph_isContained_iffproof · cited by 1
- SimpleGraph.completeBipartiteGraph_isContained_iffproof · cited by 0