Theorems · Theorem · combinatorics

SimpleGraph.Iso.coe_induce

∀ {V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} {s : Set V} {t : Set W} (φ : G ≃g G')
  (φst : Set.BijOn (⇑φ) s t), ⇑(φ.induce φst) = Set.MapsTo.restrict (⇑φ) s t ⋯

Defined in

Mathlib.Combinatorics.SimpleGraph.Maps

Cited by

0 results in Mathlib

Foundations

Depth 28 from the axioms · uses propext, Quot.sound