Theorems · Theorem · combinatorics
Graph.Simple.eq_of_isLink
∀ {α : Type u_1} {β : Type u_2} {G : Graph α β} [self : G.Simple] ⦃e f : β⦄ ⦃x y : α⦄,
G.IsLink e x y → G.IsLink f x y → e = f- Defined in
- Mathlib.Combinatorics.Graph.Simple
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 2 from the axioms · uses no axioms
- Assumes
- Graph.Simple
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
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 · cited by 124
- Graph.Simplestatement and proof · cited by 4
Cited by1
Results whose statement or proof uses this declaration.
- Graph.IsLink.eqproof · cited by 1