Theorems · Definition · combinatorics
SimpleGraph.Copy.mapEdgeSet
{α : Type u_4} → {β : Type u_5} → {A : SimpleGraph α} → {B : SimpleGraph β} → A.Copy B → ↑A.edgeSet ↪ ↑B.edgeSetA copy induces an embedding of edge sets.
- Defined in
- Mathlib.Combinatorics.SimpleGraph.Copy
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 65 from the axioms · uses propext, Classical.choice, Quot.sound
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.
- Set.Elemstatement · cited by 7,166
- SimpleGraphstatement and proof · cited by 3,072
- Function.Embeddingstatement · cited by 988
- Sym2statement · cited by 737
- SimpleGraph.edgeSetstatement · cited by 199
- SimpleGraph.Copystatement and proof · cited by 49
- SimpleGraph.Copy.toHomproof · cited by 14
- SimpleGraph.Hom.mapEdgeSetproof · cited by 6
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.