Mathlib Map

Theorems · Definition · combinatorics

SimpleGraph.overFinIso

{V : Type u_1} → (G : SimpleGraph V) → [inst : Fintype V] → {n : ℕ} → (hc : Fintype.card V = n) → G ≃g G.overFin hc

The isomorphism between G and G.overFin hc.

Defined in
Mathlib.Combinatorics.SimpleGraph.Maps
Cited by
1 results in Mathlib
Foundations
Depth 62 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
Fintype
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.isContained_of_card_edgeFinset · cited by 0SimpleGraph.isContained_o…Fintype · cited by 7736FintypeEquiv.symm · cited by 3681Equiv.symmSimpleGraph · cited by 3072SimpleGraphFintype.card · cited by 1386Fintype.cardSimpleGraph.Iso · cited by 99SimpleGraph.IsoSimpleGraph.Iso.symm · cited by 34Iso.symmFintype.equivFinOfCardEq · cited by 22Fintype.equivFinOfCardEqSimpleGraph.Iso.comap · cited by 2Iso.comapSimpleGraph.overFin · cited by 1SimpleGraph.overFinSimpleGraph.overFinIsoCITED BYCITES

Cites9

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.