Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.Copy.isContained

∀ {V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} (f : G.Copy H), G.IsContained H
Defined in
Mathlib.Combinatorics.SimpleGraph.Copy
Cited by
2 results in Mathlib
Foundations
Depth 3 from the axioms · uses no axioms
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.Iso.isContained · cited by 5Iso.isContainedSimpleGraph.Embedding.isContained · cited by 4Embedding.isContainedSimpleGraph · cited by 3072SimpleGraphSimpleGraph.IsContained · cited by 68SimpleGraph.IsContainedSimpleGraph.Copy · cited by 49SimpleGraph.CopyCopy.isContainedCITED BYCITES

Cites3

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.