Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.IsContained.of_le

∀ {V : Type u_1} {G₁ G₂ : SimpleGraph V}, G₁ ≤ G₂ → G₁.IsContained G₂

A simple graph contains its subgraphs.

Defined in
Mathlib.Combinatorics.SimpleGraph.Copy
Cited by
6 results in Mathlib
Foundations
Depth 8 from the axioms · uses no axioms
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.IsContained.mono_left · cited by 1IsContained.mono_leftSimpleGraph.IsContained.mono_right · cited by 1IsContained.mono_rightSimpleGraph.isContained_top_iff · cited by 0SimpleGraph.isContained_t…SimpleGraph.vertexCoverNum_mono · cited by 0SimpleGraph.vertexCoverNu…SimpleGraph.maxDegree_mono · cited by 0SimpleGraph.maxDegree_monoSimpleGraph.IsAcyclic.cliqueFree · cited by 0IsAcyclic.cliqueFreeSimpleGraph · cited by 3072SimpleGraphSimpleGraph.IsContained · cited by 68SimpleGraph.IsContainedSimpleGraph.Copy.ofLE · cited by 6Copy.ofLEIsContained.of_leCITED BYCITES

Cites3

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by6

Results whose statement or proof uses this declaration.