Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.fromEdgeSet_sdiff

∀ {V : Type u} (s t : Set (Sym2 V)),
  SimpleGraph.fromEdgeSet (s \ t) = SimpleGraph.fromEdgeSet s \ SimpleGraph.fromEdgeSet t
Defined in
Mathlib.Combinatorics.SimpleGraph.Basic
Cited by
2 results in Mathlib
Foundations
Depth 61 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.deleteEdges_edge · cited by 2SimpleGraph.deleteEdges_e…SimpleGraph.deleteEdges_fromEdgeSet · cited by 2SimpleGraph.deleteEdges_f…Set · cited by 53352SetSimpleGraph · cited by 3072SimpleGraphSym2 · cited by 737Sym2Sym2.mk · cited by 332Sym2.mkSimpleGraph.ext · cited by 59SimpleGraph.extSimpleGraph.fromEdgeSet · cited by 43SimpleGraph.fromEdgeSetSimpleGraph.fromEdgeSet_sdiffCITED BYCITES

Cites6

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.