Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.IsExtremal.congr_simp

∀ {V : Type u_1} [inst : Fintype V] (G G_1 : SimpleGraph V),
  G = G_1 →
    ∀ {inst_1 : DecidableRel G.Adj} [inst_2 : DecidableRel G_1.Adj] (p p_1 : SimpleGraph V → Prop),
      p = p_1 → G.IsExtremal p = G_1.IsExtremal p_1
Defined in
Mathlib.Combinatorics.SimpleGraph.Extremal.Turan
Cited by
0 results in Mathlib
Foundations
Depth 66 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
FintypeDecidableRel
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

Fintype · cited by 7736FintypeSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Adj · cited by 1346SimpleGraph.AdjSimpleGraph.IsExtremal · cited by 9SimpleGraph.IsExtremalIsExtremal.congr_simpCITED BYCITES

Cites4

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

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.