Mathlib Map

Theorems · Theorem · combinatorics

Graph.restrict_self

∀ {α : Type u_1} {β : Type u_2} (G : Graph α β), G.restrict G.edgeSet = G
Defined in
Mathlib.Combinatorics.Graph.Delete
Cited by
1 results in Mathlib
Foundations
Depth 67 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.deleteEdges_empty · cited by 0Graph.deleteEdges_emptyGraph · cited by 242GraphGraph.edgeSet · cited by 79Graph.edgeSetSet.inter_self · cited by 63Set.inter_selfGraph.restrict · cited by 18Graph.restrictGraph.Compatible.ext · cited by 9Compatible.extGraph.Compatible.of_le_le · cited by 9Compatible.of_le_leGraph.edgeSet_restrict · cited by 7Graph.edgeSet_restrictGraph.restrict_selfCITED BYCITES

Cites7

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.