Theorems · Theorem · combinatorics
Graph.Loopless.not_isLoopAt
∀ {α : Type u_1} {β : Type u_2} {G : Graph α β} [self : G.Loopless] (e : β) (x : α), ¬G.IsLoopAt e x- Defined in
- Mathlib.Combinatorics.Graph.Simple
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 3 from the axioms · uses no axioms
- Assumes
- Graph.Loopless
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.IsLoopAtstatement · cited by 29
- Graph.Looplessstatement and proof · cited by 12
Cited by3
Results whose statement or proof uses this declaration.
- Graph.not_adj_selfproof · cited by 1
- Graph.not_isLoopAtproof · cited by 0
- Graph.Inc.isNonloopAtproof · cited by 0