Theorems · Theorem · combinatorics
Graph.IsNonloopAt.edge_mem
∀ {α : Type u_1} {β : Type u_2} {x : α} {e : β} {G : Graph α β}, G.IsNonloopAt e x → e ∈ G.edgeSet- Defined in
- Mathlib.Combinatorics.Graph.Basic
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 11 from the axioms · uses Classical.choice
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.
- Setstatement · cited by 53,352
- Graphstatement and proof · cited by 242
- Graph.edgeSetstatement · cited by 79
- Graph.IsNonloopAtstatement and proof · cited by 16
- Graph.Inc.edge_memproof · cited by 6
- Graph.IsNonloopAt.incproof · cited by 3
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.