Theorems · Theorem · combinatorics
SimpleGraph.swap_mem_interedges_iff
∀ {α : Type u_4} (G : SimpleGraph α) [inst : DecidableRel G.Adj] {s t : Finset α} {x : α × α},
x.swap ∈ G.interedges s t ↔ x ∈ G.interedges t s- Cited by
- 0 results in Mathlib
- Foundations
- Depth 68 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableRel
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.
- Finsetstatement and proof · cited by 13,712
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjstatement and proof · cited by 1,346
- SimpleGraph.interedgesstatement · cited by 23
- SimpleGraph.symmproof · cited by 8
- Rel.swap_mem_interedges_iffproof · cited by 3
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.