Theorems · Theorem · combinatorics
Graph.Inc.isNonloopAt
∀ {α : Type u_1} {β : Type u_2} {G : Graph α β} {u : α} {e : β} [G.Loopless], G.Inc e u → G.IsNonloopAt e u- Defined in
- Mathlib.Combinatorics.Graph.Simple
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 17 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Graph.Loopless
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
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.Incstatement and proof · cited by 42
- Graph.IsNonloopAtstatement · cited by 16
- Graph.Looplessstatement and proof · cited by 12
- Graph.Loopless.not_isLoopAtproof · cited by 3
- Graph.Inc.isLoopAt_or_isNonloopAtproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.