Mathlib Map

Theorems · Theorem · combinatorics

Graph.vertexSet_restrict

∀ {α : Type u_1} {β : Type u_2} (G : Graph α β) (E₀ : Set β), (G.restrict E₀).vertexSet = G.vertexSet
Defined in
Mathlib.Combinatorics.Graph.Delete
Cited by
4 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.

Graph.restrict_edgeSet_inter · cited by 1Graph.restrict_edgeSet_in…Graph.restrict_mono_left · cited by 1Graph.restrict_mono_leftGraph.restrict_restrict · cited by 1Graph.restrict_restrictGraph.restrict_eq_self_iff · cited by 0Graph.restrict_eq_self_iffSet · cited by 53352SetGraph · cited by 242GraphGraph.vertexSet · cited by 87Graph.vertexSetGraph.restrict · cited by 18Graph.restrictGraph.vertexSet_restrictCITED BYCITES

Cites4

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

Cited by4

Results whose statement or proof uses this declaration.