Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.sup_adj

∀ {V : Type u} (x y : SimpleGraph V) (v w : V), (x ⊔ y).Adj v w ↔ x.Adj v w ∨ y.Adj v w
Defined in
Mathlib.Combinatorics.SimpleGraph.Basic
Cited by
1 results in Mathlib
Foundations
Depth 18 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.addCayley_erase_zero · cited by 3SimpleGraph.addCayley_era…SimpleGraph · cited by 3072SimpleGraphSimpleGraph.Adj · cited by 1346SimpleGraph.AdjSimpleGraph.sup_adjCITED BYCITES

Cites2

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.