Mathlib Map

Theorems · Theorem · combinatorics

Rel.edgeDensity_empty_right

∀ {α : Type u_4} {β : Type u_5} (r : α → β → Prop) [inst : (a : α) → DecidablePred (r a)] (s : Finset α),
  Rel.edgeDensity r s ∅ = 0
Defined in
Mathlib.Combinatorics.SimpleGraph.Density
Cited by
1 results in Mathlib
Foundations
Depth 80 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
DecidablePred
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.edgeDensity_empty_right · cited by 0SimpleGraph.edgeDensity_e…Finset · cited by 13712FinsetFinset.card · cited by 2327Finset.cardMulZeroClass.mul_zero · cited by 2091MulZeroClass.mul_zeroNat.cast_zero · cited by 1870Nat.cast_zerodiv_zero · cited by 251div_zeroRel.interedges · cited by 27Rel.interedgesFinset.card_empty · cited by 20Finset.card_emptyRel.edgeDensity · cited by 12Rel.edgeDensityRel.edgeDensity_empty_rightCITED BYCITES

Cites8

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.