Theorems · Theorem · combinatorics

Finpartition.nonUniforms_bot

∀ {α : Type u_1} {𝕜 : Type u_2} [inst : Field 𝕜] [inst_1 : LinearOrder 𝕜] [IsStrictOrderedRing 𝕜]
  [inst_3 : DecidableEq α] {A : Finset α} (G : SimpleGraph α) [inst_4 : DecidableRel G.Adj] {ε : 𝕜},
  0 < ε → ⊥.nonUniforms G ε = ∅

Defined in: Mathlib.Combinatorics.SimpleGraph.Regularity.Uniform
Cited by: 1 results in Mathlib
Foundations: Depth 80 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes: Field LinearOrder IsStrictOrderedRing DecidableEq DecidableRel

Mathlib docs Source Loogle LeanSearch

Around this declaration

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

Cites14

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

DFunLike.coeproof · cited by 62,936
Finsetstatement and proof · cited by 13,712
LinearOrderstatement and proof · cited by 8,572
Fieldstatement and proof · cited by 7,404
Bot.botstatement and proof · cited by 4,720
SimpleGraphstatement and proof · cited by 3,072
IsStrictOrderedRingstatement and proof · cited by 2,490
SimpleGraph.Adjstatement and proof · cited by 1,346
Finpartitionstatement · cited by 199
SimpleGraph.IsUniformproof · cited by 33
Finset.singleton_injectiveproof · cited by 14
Finpartition.nonUniformsstatement · cited by 11

Cited by1

Results whose statement or proof uses this declaration.

Finpartition.bot_isUniformproof · cited by 1