Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.IsTree.of_subsingleton

∀ {V : Type u_1} [Nonempty V] [Subsingleton V] {G : SimpleGraph V}, G.IsTree
Defined in
Mathlib.Combinatorics.SimpleGraph.Acyclic
Cited by
1 results in Mathlib
Foundations
Depth 97 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
NonemptySubsingleton
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.IsTree.coe_singletonSubgraph · cited by 0IsTree.coe_singletonSubgr…SimpleGraph · cited by 3072SimpleGraphSimpleGraph.IsTree · cited by 32SimpleGraph.IsTreeSimpleGraph.IsAcyclic.of_subsingleton · cited by 2IsAcyclic.of_subsingletonSimpleGraph.Connected.of_subsingleton · cited by 1Connected.of_subsingletonIsTree.of_subsingletonCITED BYCITES

Cites4

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

Cited by1

Results whose statement or proof uses this declaration.