Theorems · Theorem · combinatorics
Graph.banana_adj
∀ {α : Type u_1} {β : Type u_2} {x y u v : α} {edgeSet : Set β},
(Graph.banana u v edgeSet).Adj x y ↔ edgeSet.Nonempty ∧ s(x, y) = s(u, v)- Defined in
- Mathlib.Combinatorics.Graph.Basic
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 19 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Set.Nonemptystatement and proof · cited by 2,627
- Sym2statement · cited by 737
- Sym2.mkstatement · cited by 332
- Graph.Adjstatement · cited by 23
- Graph.bananastatement · cited by 10
- Graph.banana_isLinkproof · cited by 7
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.