SimpleGraph.edist_anti

∀ {V : Type u_1} {G : SimpleGraph V} {u v : V} {G' : SimpleGraph V}, G ≤ G' → G'.edist u v ≤ G.edist u v

Supergraphs have smaller or equal extended distances to their subgraphs.

Defined in: Mathlib.Combinatorics.SimpleGraph.Metric
Cited by: 1 results in Mathlib
Foundations: Depth 35 from the axioms · uses propext, Classical.choice, Quot.sound

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.