Theorems · Theorem · combinatorics
Graph.IsLink.eq
∀ {α : Type u_1} {β : Type u_2} {G : Graph α β} {u v : α} {e f : β} [G.Simple], G.IsLink e u v → G.IsLink f u v → e = f- Defined in
- Mathlib.Combinatorics.Graph.Simple
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 3 from the axioms · uses no axioms
- Assumes
- Graph.Simple
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Graphstatement and proof · cited by 242
- Graph.IsLinkstatement and proof · cited by 124
- Graph.Simplestatement and proof · cited by 4
- Graph.Simple.eq_of_isLinkproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- Graph.Simple.antiproof · cited by 0