Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.adjMatrix.congr_simp

∀ (α : Type u_1) {V : Type u_2} (G G_1 : SimpleGraph V),
  G = G_1 →
    ∀ {inst : DecidableRel G.Adj} [inst_1 : DecidableRel G_1.Adj] [inst_2 : Zero α] [inst_3 : One α] (a a_1 : V),
      a = a_1 → ∀ (a_2 a_3 : V), a_2 = a_3 → SimpleGraph.adjMatrix α G a a_2 = SimpleGraph.adjMatrix α G_1 a_1 a_3
Defined in
Mathlib.Combinatorics.SimpleGraph.AdjMatrix
Cited by
1 results in Mathlib
Foundations
Depth 15 from the axioms · uses Quot.sound
Assumes
DecidableRelZeroOne
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.adjMatrix_top · cited by 0SimpleGraph.adjMatrix_topSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Adj · cited by 1346SimpleGraph.AdjSimpleGraph.adjMatrix · cited by 48SimpleGraph.adjMatrixadjMatrix.congr_simpCITED BYCITES

Cites3

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.