Theorems · Theorem · combinatorics
Graph.Inc.edge_mem
∀ {α : Type u_1} {β : Type u_2} {x : α} {e : β} {G : Graph α β}, G.Inc e x → e ∈ G.edgeSet- Defined in
- Mathlib.Combinatorics.Graph.Basic
- Cited by
- 6 results in Mathlib
- Foundations
- Depth 10 from the axioms · uses Classical.choice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
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.Incstatement and proof · cited by 42
- Graph.IsLink.edge_memproof · cited by 14
Cited by6
Results whose statement or proof uses this declaration.
- Graph.IsClosedSubgraph.isLink_congrproof · cited by 3
- Graph.eq_bouquet_of_subsingletonproof · cited by 2
- Graph.IsLoopAt.edge_memproof · cited by 1
- Graph.not_inc_of_notMem_edgeSetproof · cited by 0
- Graph.IsNonloopAt.edge_memproof · cited by 0
- Graph.IsClosedSubgraph.anti_rightproof · cited by 0