Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.IsContained.mono_left

∀ {α : Type u_4} {β : Type u_5} {A : SimpleGraph α} {B : SimpleGraph β} {A' : SimpleGraph α},
  A ≤ A' → A'.IsContained B → A.IsContained B
Defined in
Mathlib.Combinatorics.SimpleGraph.Copy
Cited by
1 results in Mathlib
Foundations
Depth 13 from the axioms · uses no axioms
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.IsContained.trans_le' · cited by 0IsContained.trans_le'SimpleGraph · cited by 3072SimpleGraphSimpleGraph.IsContained · cited by 68SimpleGraph.IsContainedSimpleGraph.IsContained.trans · cited by 9IsContained.transSimpleGraph.IsContained.of_le · cited by 6IsContained.of_leIsContained.mono_leftCITED BYCITES

Cites4

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.