Theorems · Definition · combinatorics

Quiver.RootedConnected.recOn

{V : Type u} →
  [inst : Quiver V] →
    {r : V} →
      {motive : Quiver.RootedConnected r → Sort u_2} →
        (t : Quiver.RootedConnected r) → ((nonempty_path : ∀ (b : V), Nonempty (Quiver.Path r b)) → motive ⋯) → motive t

Defined in: Mathlib.Combinatorics.Quiver.Arborescence
Cited by: 0 results in Mathlib
Foundations: Depth 4 from the axioms · uses no axioms
Assumes: Quiver

Mathlib docs Source Loogle LeanSearch

Around this declaration

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

Cites3

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

Quiverstatement and proof · cited by 405
Quiver.Pathstatement and proof · cited by 166
Quiver.RootedConnectedstatement and proof · cited by 2

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.