Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.Copy.minDegree_mono

∀ {V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} [inst : Fintype V] [inst_1 : Fintype W]
  [inst_2 : DecidableRel G.Adj] [inst_3 : DecidableRel H.Adj] {f : G.Copy H},
  Function.Surjective ⇑f → G.minDegree ≤ H.minDegree
Defined in
Mathlib.Combinatorics.SimpleGraph.Copy
Cited by
2 results in Mathlib
Foundations
Depth 83 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
FintypeFintypeDecidableRelDecidableRel
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.Hom.minDegree_mono · cited by 1Hom.minDegree_monoSimpleGraph.Copy.minDegree_le · cited by 0Copy.minDegree_leDFunLike.coe · cited by 62936DFunLike.coeFintype · cited by 7736FintypeSimpleGraph · cited by 3072SimpleGraphle_refl · cited by 2061le_reflSimpleGraph.Adj · cited by 1346SimpleGraph.AdjIsEmpty · cited by 759IsEmptyle_imp_le_of_le_of_le · cited by 576le_imp_le_of_le_of_leisEmpty_or_nonempty · cited by 269isEmpty_or_nonemptySimpleGraph.Copy · cited by 49SimpleGraph.CopySimpleGraph.minDegree · cited by 25SimpleGraph.minDegreeFunction.isEmpty · cited by 15Function.isEmptySimpleGraph.minDegree_le_degree · cited by 6SimpleGraph.minDegree_le_…SimpleGraph.minDegree_of_subsingleton · cited by 6SimpleGraph.minDegree_of_…SimpleGraph.le_minDegree_of_forall_le_degree · cited by 3SimpleGraph.le_minDegree_…SimpleGraph.Copy.degree_le · cited by 1Copy.degree_leCopy.minDegree_monoCITED BYCITES

Cites15

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

Cited by2

Results whose statement or proof uses this declaration.