Theorems · Theorem · combinatorics
Graph.Adj.symm
∀ {α : Type u_1} {β : Type u_2} {x y : α} {G : Graph α β}, G.Adj x y → G.Adj y x- Defined in
- Mathlib.Combinatorics.Graph.Basic
- Cited by
- 2 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.
Cites3
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.Adjstatement and proof · cited by 23
- Graph.IsLink.symmproof · cited by 11
Cited by2
Results whose statement or proof uses this declaration.
- Graph.adj_commproof · cited by 0
- Graph.Adj.right_memproof · cited by 0