Theorems · Definition · combinatorics
SimpleGraph.Iso.comp
{V : Type u_1} →
{W : Type u_2} →
{X : Type u_3} → {G : SimpleGraph V} → {G' : SimpleGraph W} → {G'' : SimpleGraph X} → G' ≃g G'' → G ≃g G' → G ≃g G''Composition of graph isomorphisms.
- Defined in
- Mathlib.Combinatorics.SimpleGraph.Maps
- Cited by
- 10 results in Mathlib
- Foundations
- Depth 24 from the axioms · uses 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.Isostatement and proof · cited by 99
- RelIso.transproof · cited by 18
Cited by11
Results whose statement or proof uses this declaration.
- SimpleGraph.Copy.isoToSubgraphproof · cited by 3
- SimpleGraph.isTuranMaximal_of_isoproof · cited by 3
- SimpleGraph.Iso.comp_assocstatement · cited by 0
- SimpleGraph.Iso.comp_reflstatement · cited by 0
- SimpleGraph.IsTuranMaximal.isoproof · cited by 0
- SimpleGraph.Iso.refl_compstatement · cited by 0
- SimpleGraph.Iso.sumAssoc_comp_sumCongrstatement · cited by 0
- SimpleGraph.Iso.induce_comp_inducestatement and proof · cited by 0
- SimpleGraph.Iso.sumComm_comp_sumCongrstatement · cited by 0
- SimpleGraph.Iso.coe_compstatement · cited by 0
- SimpleGraph.free_killCopiesproof · cited by 0