Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.Subgraph.IsMatching.map

∀ {V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} {M : G.Subgraph} (f : G →g G'),
  Function.Injective ⇑f → M.IsMatching → (SimpleGraph.Subgraph.map f M).IsMatching
Defined in
Mathlib.Combinatorics.SimpleGraph.Matching
Cited by
1 results in Mathlib
Foundations
Depth 11 from the axioms · uses no axioms
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

SimpleGraph.Subgraph.Iso.isMatching_map · cited by 0Iso.isMatching_mapDFunLike.coe · cited by 62936DFunLike.coeSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Adj · cited by 1346SimpleGraph.AdjSimpleGraph.Subgraph · cited by 326SimpleGraph.SubgraphSimpleGraph.Subgraph.verts · cited by 210Subgraph.vertsSimpleGraph.Subgraph.Adj · cited by 147Subgraph.AdjSimpleGraph.Hom · cited by 139SimpleGraph.HomSimpleGraph.Subgraph.IsMatching · cited by 32Subgraph.IsMatchingSimpleGraph.Subgraph.map · cited by 24Subgraph.mapIsMatching.mapCITED BYCITES

Cites9

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by1

Results whose statement or proof uses this declaration.