Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.Subgraph.IsMatching.map_ofLE

∀ {V : Type u_1} {G G' : SimpleGraph V} {M : G.Subgraph},
  M.IsMatching → ∀ (hGG' : G ≤ G'), (SimpleGraph.Subgraph.map (SimpleGraph.Hom.ofLE hGG') M).IsMatching
Defined in
Mathlib.Combinatorics.SimpleGraph.Matching
Cited by
1 results in Mathlib
Foundations
Depth 12 from the axioms · uses propext, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.IsMatchingFree.mono · cited by 0IsMatchingFree.monoDFunLike.coe · cited by 62936DFunLike.coeSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Subgraph · cited by 326SimpleGraph.SubgraphSimpleGraph.Subgraph.verts · cited by 210Subgraph.vertsSimpleGraph.Subgraph.Adj · cited by 147Subgraph.AdjSet.mem_image · cited by 131Set.mem_imageSimpleGraph.Subgraph.IsMatching · cited by 32Subgraph.IsMatchingSimpleGraph.Hom.ofLE · cited by 27Hom.ofLESimpleGraph.Subgraph.map · cited by 24Subgraph.mapSimpleGraph.Subgraph.map_adj · cited by 10Subgraph.map_adjRelation.map_id_id · cited by 4Relation.map_id_idIsMatching.map_ofLECITED BYCITES

Cites11

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.