Graph.ext_inc

∀ {α : Type u_1} {β : Type u_2} {G₁ G₂ : Graph α β},
  G₁.vertexSet = G₂.vertexSet → (∀ (e : β) (x : α), G₁.Inc e x ↔ G₂.Inc e x) → G₁ = G₂

Two graphs with the same vertex set and unary incidences are equal.

Defined in: Mathlib.Combinatorics.Graph.Basic
Cited by: 2 results in Mathlib
Foundations: Depth 21 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.