Mathlib Map

Theorems · Definition · combinatorics

SimpleGraph.Connected.casesOn

{V : Type u} →
  {G : SimpleGraph V} →
    {motive : G.Connected → Sort u_1} →
      (t : G.Connected) → ((preconnected : G.Preconnected) → [nonempty : Nonempty V] → motive ⋯) → motive t
Defined in
Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
Cited by
2 results in Mathlib
Foundations
Depth 6 from the axioms · uses no axioms
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.connected_iff · cited by 6SimpleGraph.connected_iffSimpleGraph.Connected.sum_sup_edge · cited by 0Connected.sum_sup_edgeSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Connected · cited by 75SimpleGraph.ConnectedSimpleGraph.Preconnected · cited by 49SimpleGraph.PreconnectedConnected.casesOnCITED BYCITES

Cites3

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

Cited by2

Results whose statement or proof uses this declaration.