Theorems · Theorem · combinatorics
SimpleGraph.ComponentCompl.supp_inj
∀ {V : Type u} {G : SimpleGraph V} {K : Set V} {C D : G.ComponentCompl K}, C.supp = D.supp ↔ C = D- Cited by
- 0 results in Mathlib
- Foundations
- Depth 17 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.ComponentComplstatement and proof · cited by 29
- SimpleGraph.ComponentCompl.suppstatement · cited by 6
- SimpleGraph.ComponentCompl.supp_injectiveproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.