Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.ComponentCompl.disjoint_right

∀ {V : Type u} {G : SimpleGraph V} {K : Set V} (C : G.ComponentCompl K), Disjoint K ↑C
Defined in
Mathlib.Combinatorics.SimpleGraph.Ends.Defs
Cited by
3 results in Mathlib
Foundations
Depth 60 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.ComponentCompl.infinite_iff_in_all_ranges · cited by 2ComponentCompl.infinite_i…SimpleGraph.ComponentCompl.exists_adj_boundary_pair · cited by 0ComponentCompl.exists_adj…SimpleGraph.ComponentCompl.notMem_of_mem · cited by 0ComponentCompl.notMem_of_…Set · cited by 53352SetSetLike.coe · cited by 8199SetLike.coeSimpleGraph · cited by 3072SimpleGraphDisjoint · cited by 2201DisjointSimpleGraph.ComponentCompl · cited by 29SimpleGraph.ComponentComplSet.disjoint_iff · cited by 27Set.disjoint_iffComponentCompl.disjoint_rightCITED BYCITES

Cites6

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

Cited by3

Results whose statement or proof uses this declaration.