Theorems · Theorem · combinatorics

Finpartition.sparsePairs.congr_simp

∀ {α : Type u_1} {𝕜 : Type u_2} [inst : Field 𝕜] [inst_1 : LinearOrder 𝕜] [inst_2 : DecidableEq α] {A : Finset α}
  (P P_1 : Finpartition A),
  P = P_1 →
    ∀ (G G_1 : SimpleGraph α),
      G = G_1 →
        ∀ {inst_3 : DecidableRel G.Adj} [inst_4 : DecidableRel G_1.Adj] (ε ε_1 : 𝕜),
          ε = ε_1 → P.sparsePairs G ε = P_1.sparsePairs G_1 ε_1

Defined in

Mathlib.Combinatorics.SimpleGraph.Regularity.Uniform

Cited by

0 results in Mathlib

Foundations

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

Assumes

FieldLinearOrderDecidableEqDecidableRel