Theorems · Theorem · combinatorics
Graph.IsLink.inc_left
∀ {α : Type u_1} {β : Type u_2} {x y : α} {e : β} {G : Graph α β}, G.IsLink e x y → G.Inc e x- Defined in
- Mathlib.Combinatorics.Graph.Basic
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 3 from the axioms · uses no axioms
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 and proof · cited by 124
- Graph.Incstatement · cited by 42
Cited by8
Results whose statement or proof uses this declaration.
- Graph.IsNonloopAt.incproof · cited by 3
- Graph.IsClosedSubgraph.isLink_congrproof · cited by 3
- Graph.IsClosedSubgraph.mk'proof · cited by 3
- Graph.IsLoopAt.incproof · cited by 2
- Graph.Inc.monoproof · cited by 2
- Graph.eq_bouquet_of_subsingletonproof · cited by 2
- Graph.IsLoopAt.not_isNonloopAtproof · cited by 1
- Graph.isLink_iff_incproof · cited by 1