Theorems · Theorem · combinatorics

SimpleGraph.mem_incidenceFinset

∀ {V : Type u_1} (G : SimpleGraph V) (v : V) [inst : Fintype ↑(G.neighborSet v)] [inst_1 : DecidableEq V] (e : Sym2 V),
  e ∈ G.incidenceFinset v ↔ e ∈ G.incidenceSet v

Defined in

Mathlib.Combinatorics.SimpleGraph.Finite

Cited by

1 results in Mathlib

Foundations

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

Assumes

FintypeDecidableEq