Mathlib Map

Theorems · Theorem · combinatorics

Quiver.shortestPath.congr_simp

∀ {V : Type u} [inst : Quiver V] (r : V) [inst_1 : Quiver.RootedConnected r] (b : V),
  Quiver.shortestPath r b = Quiver.shortestPath r b
Defined in
Mathlib.Combinatorics.Quiver.Arborescence
Cited by
0 results in Mathlib
Foundations
Depth 17 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
QuiverQuiver.RootedConnected
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

Quiver · cited by 405QuiverQuiver.Path · cited by 166Quiver.PathQuiver.RootedConnected · cited by 2Quiver.RootedConnectedQuiver.shortestPath · cited by 2Quiver.shortestPathshortestPath.congr_simpCITED BYCITES

Cites4

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

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.