Mathlib Map

Theorems · Theorem · combinatorics

ruzsaSzemerediNumber_congr

∀ {α : Type u_1} {β : Type u_2} [inst : DecidableEq α] [inst_1 : DecidableEq β] [inst_2 : Fintype α]
  [inst_3 : Fintype β] (e : α ≃ β), ruzsaSzemerediNumber α = ruzsaSzemerediNumber β
Defined in
Mathlib.Combinatorics.Extremal.RuzsaSzemeredi
Cited by
1 results in Mathlib
Foundations
Depth 83 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
DecidableEqDecidableEqFintypeFintype
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

ruzsaSzemerediNumberNat_card · cited by 0ruzsaSzemerediNumberNat_c…Equiv · cited by 8337EquivFintype · cited by 7736FintypeEquiv.symm · cited by 3681Equiv.symmLE.le.antisymm · cited by 507le.antisymmEquiv.toEmbedding · cited by 254Equiv.toEmbeddingruzsaSzemerediNumber · cited by 8ruzsaSzemerediNumberruzsaSzemerediNumber_mono · cited by 2ruzsaSzemerediNumber_monoruzsaSzemerediNumber_congrCITED BYCITES

Cites7

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.