Theorems · Theorem · combinatorics
SimpleGraph.edist_boxProd
∀ {α : Type u_1} {β : Type u_2} {G : SimpleGraph α} {H : SimpleGraph β} (x y : α × β),
(G □ H).edist x y = G.edist x.1 y.1 + H.edist x.2 y.2- Defined in
- Mathlib.Combinatorics.SimpleGraph.Prod
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 38 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites26
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Top.topproof · cited by 9,680
- ENatstatement and proof · cited by 4,985
- SimpleGraphstatement and proof · cited by 3,072
- le_antisymmproof · cited by 2,068
- SimpleGraph.Walkproof · cited by 915
- add_le_addproof · cited by 666
- SimpleGraph.Walk.lengthproof · cited by 212
- SimpleGraph.Reachableproof · cited by 141
- SimpleGraph.Walk.appendproof · cited by 95
- SimpleGraph.Walk.mapproof · cited by 66
- top_addproof · cited by 55
- SimpleGraph.ediststatement and proof · cited by 55
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.