Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.induce_adj

∀ {V : Type u_1} {G : SimpleGraph V} {s : Set V} {u v : ↑s}, (SimpleGraph.induce s G).Adj u v ↔ G.Adj ↑u ↑v
Defined in
Mathlib.Combinatorics.SimpleGraph.Maps
Cited by
2 results in Mathlib
Foundations
Depth 12 from the axioms · uses propext, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.induce_eq_top · cited by 1SimpleGraph.induce_eq_topSimpleGraph.Walk.induce_cons · cited by 0Walk.induce_consSet · cited by 53352SetSet.Elem · cited by 7166Set.ElemSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Adj · cited by 1346SimpleGraph.AdjSimpleGraph.induce · cited by 80SimpleGraph.induceSimpleGraph.induce_adjCITED BYCITES

Cites5

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

Cited by2

Results whose statement or proof uses this declaration.