Theorems · Theorem · combinatorics
Graph.banana_comm
∀ {α : Type u_1} {β : Type u_2} (u v : α) (edgeSet : Set β), Graph.banana u v edgeSet = Graph.banana v u edgeSet- Defined in
- Mathlib.Combinatorics.Graph.Basic
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 22 from the axioms · uses propext, Classical.choice, Quot.sound
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 and proof · cited by 53,352
- Graphstatement · cited by 242
- Set.pair_commproof · cited by 22
- Graph.bananastatement · cited by 10
- Graph.ext_incproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.