Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.Iso.isIndContained

∀ {V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} (e : G ≃g H), G.IsIndContained H

If G is isomorphic to H, then G is inducingly contained in H.

Defined in
Mathlib.Combinatorics.SimpleGraph.Copy
Cited by
2 results in Mathlib
Foundations
Depth 18 from the axioms · uses Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.isIndContained_iff_exists_iso_subgraph · cited by 2SimpleGraph.isIndContaine…SimpleGraph.Iso.isIndContained' · cited by 0Iso.isIndContained'SimpleGraph · cited by 3072SimpleGraphSimpleGraph.Iso · cited by 99SimpleGraph.IsoSimpleGraph.IsIndContained · cited by 22SimpleGraph.IsIndContainedSimpleGraph.Iso.toEmbedding · cited by 9Iso.toEmbeddingSimpleGraph.Embedding.isIndContained · cited by 1Embedding.isIndContainedIso.isIndContainedCITED BYCITES

Cites5

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.