Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.ext

∀ {V : Type u} {x y : SimpleGraph V}, x.Adj = y.Adj → x = y
Defined in
Mathlib.Combinatorics.SimpleGraph.Basic
Cited by
59 results in Mathlib
Foundations
Depth 13 from the axioms · uses no axioms
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.induce_eq_coe_induce_top · cited by 4SimpleGraph.induce_eq_coe…SimpleGraph.comap_map_eq · cited by 3SimpleGraph.comap_map_eqSimpleGraph.addCayley_erase_zero · cited by 3SimpleGraph.addCayley_era…SimpleGraph.deleteEdges_of_subset_diagSet · cited by 3SimpleGraph.deleteEdges_o…SimpleGraph.edge_self_eq_bot · cited by 3SimpleGraph.edge_self_eq_…SimpleGraph.fromEdgeSet_empty · cited by 3SimpleGraph.fromEdgeSet_e…SimpleGraph.Embedding.comap_eq · cited by 2Embedding.comap_eqSimpleGraph.comap_symm · cited by 2SimpleGraph.comap_symmSimpleGraph.comap_top · cited by 2SimpleGraph.comap_topSimpleGraph.deleteEdges_edgeSet · cited by 2SimpleGraph.deleteEdges_e…SimpleGraph.mulCayley_erase_one · cited by 2SimpleGraph.mulCayley_era…SimpleGraph.deleteEdges_fromEdgeSet · cited by 2SimpleGraph.deleteEdges_f…SimpleGraph.fromEdgeSet_edgeSet · cited by 2SimpleGraph.fromEdgeSet_e…SimpleGraph.fromEdgeSet_sdiff · cited by 2SimpleGraph.fromEdgeSet_s…SimpleGraph.Subgraph.spanningCoe_coe · cited by 1Subgraph.spanningCoe_coeSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Adj · cited by 1346SimpleGraph.AdjSimpleGraph.extCITED BYCITES

Cites2

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

Cited by59

Results whose statement or proof uses this declaration.