Theorems · Theorem · combinatorics

Finpartition.IsUniform.mono

∀ {α : Type u_1} {𝕜 : Type u_2} [inst : Field 𝕜] [inst_1 : LinearOrder 𝕜] [IsStrictOrderedRing 𝕜]
  [inst_3 : DecidableEq α] {A : Finset α} {P : Finpartition A} {G : SimpleGraph α} [inst_4 : DecidableRel G.Adj]
  {ε ε' : 𝕜}, P.IsUniform G ε → ε ≤ ε' → P.IsUniform G ε'

Defined in

Mathlib.Combinatorics.SimpleGraph.Regularity.Uniform

Cited by

1 results in Mathlib

Foundations

Depth 73 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

FieldLinearOrderIsStrictOrderedRingDecidableEqDecidableRel