Theorems · Theorem · combinatorics
SimpleGraph.eq_top_of_isIndContained_top
∀ {V : Type u_1} {W : Type u_2} {G : SimpleGraph V}, G.IsIndContained (SimpleGraph.completeGraph W) → G = ⊤- Defined in
- Mathlib.Combinatorics.SimpleGraph.Copy
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 64 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Top.topstatement · cited by 9,680
- SimpleGraphstatement and proof · cited by 3,072
- Nonempty.someproof · cited by 340
- SimpleGraph.completeGraphstatement and proof · cited by 49
- RelEmbedding.injectiveproof · cited by 41
- SimpleGraph.IsIndContainedstatement and proof · cited by 22
- SimpleGraph.Embedding.comap_eqproof · cited by 2
- SimpleGraph.comap_topproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.