Theorems · Theorem · combinatorics
SimpleGraph.componentComplFunctor_map
∀ {V : Type u} (G : SimpleGraph V) {X Y : (Finset V)ᵒᵖ} (f : X ⟶ Y),
G.componentComplFunctor.map f = TypeCat.ofHom (SimpleGraph.ComponentCompl.hom ⋯)- Cited by
- 1 results in Mathlib
- Foundations
- Depth 63 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Quiver.Homstatement and proof · cited by 32,603
- Finsetstatement and proof · cited by 13,712
- CategoryTheory.Functor.mapstatement and proof · cited by 8,698
- SetLike.coestatement · cited by 8,199
- Oppositestatement and proof · cited by 8,081
- SimpleGraphstatement and proof · cited by 3,072
- Opposite.unopstatement · cited by 2,231
- TypeCat.ofHomstatement · cited by 389
- SimpleGraph.ComponentComplstatement · cited by 29
- SimpleGraph.ComponentCompl.homstatement · cited by 12
- SimpleGraph.componentComplFunctorstatement and proof · cited by 6
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.infinite_iff_in_eventualRangeproof · cited by 0