Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.compl_isIndContained_compl

∀ {V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W}, Gᶜ.IsIndContained Hᶜ ↔ G.IsIndContained H
Defined in
Mathlib.Combinatorics.SimpleGraph.Copy
Cited by
2 results in Mathlib
Foundations
Depth 18 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.IsIndContained.of_compl · cited by 0IsIndContained.of_complSimpleGraph.IsIndContained.compl · cited by 0IsIndContained.complEquiv.symm · cited by 3681Equiv.symmSimpleGraph · cited by 3072SimpleGraphCompl.compl · cited by 2925Compl.complEquiv.nonempty_congr · cited by 47Equiv.nonempty_congrSimpleGraph.IsIndContained · cited by 22SimpleGraph.IsIndContainedSimpleGraph.Embedding.complEquiv · cited by 1Embedding.complEquivSimpleGraph.compl_isIndContai…CITED BYCITES

Cites6

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.