Theorems · Theorem · combinatorics
SimpleGraph.Embedding.comp_assoc
∀ {V : Type u_1} {W : Type u_2} {X : Type u_3} {Y : Type u_4} {G : SimpleGraph V} {G' : SimpleGraph W}
{G'' : SimpleGraph X} {G''' : SimpleGraph Y} (f : G'' ↪g G''') (g : G' ↪g G'') (h : G ↪g G'),
f.comp (g.comp h) = (f.comp g).comp h- Defined in
- Mathlib.Combinatorics.SimpleGraph.Maps
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 16 from the axioms · uses propext, Quot.sound
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.Embeddingstatement and proof · cited by 41
- SimpleGraph.Embedding.compstatement · cited by 10
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.