Mathlib Map

Theorems · Definition · combinatorics

SimpleGraph.induceUnivIso

{V : Type u_1} → (G : SimpleGraph V) → SimpleGraph.induce Set.univ G ≃g G

The graph induced on Set.univ is isomorphic to the original graph.

Defined in
Mathlib.Combinatorics.SimpleGraph.Maps
Cited by
2 results in Mathlib
Foundations
Depth 15 from the axioms · uses propext, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.induceUnivIso_apply · cited by 0SimpleGraph.induceUnivIso…SimpleGraph.induceUnivIso_symm_apply_coe · cited by 0SimpleGraph.induceUnivIso…Equiv · cited by 8337EquivSet.Elem · cited by 7166Set.ElemSet.univ · cited by 3945Set.univSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Iso · cited by 99SimpleGraph.IsoSimpleGraph.induce · cited by 80SimpleGraph.induceEquiv.Set.univ · cited by 21Set.univSimpleGraph.induceUnivIsoCITED BYCITES

Cites7

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.