Quiver.Path.exists_eq_comp_of_le_length

∀ {V : Type u_1} [inst : Quiver V] {a b : V} (p : Quiver.Path a b) {n : ℕ},
  n ≤ p.length → ∃ v p₁ p₂, p = p₁.comp p₂ ∧ p₁.length = n

Given a path p : Path a b and an index n ≤ p.length, we can split p = p₁.comp p₂ with p₁.length = n.

Around this declaration

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

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

Results whose statement or proof uses this declaration.