Theorems · Theorem · combinatorics
Rel.card_interedges_comm
∀ {α : Type u_4} {r : α → α → Prop} [inst : DecidableRel r] [Std.Symm r] (s t : Finset α),
(Rel.interedges r s t).card = (Rel.interedges r t s).card- Cited by
- 1 results in Mathlib
- Foundations
- Depth 78 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableRelStd.Symm
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
- Finset.cardstatement · cited by 2,327
- Rel.interedgesstatement and proof · cited by 27
- Prod.swap_injectiveproof · cited by 12
- Finset.card_bijproof · cited by 10
- Rel.swap_mem_interedges_iffproof · cited by 3
Cited by1
Results whose statement or proof uses this declaration.
- Rel.edgeDensity_commproof · cited by 1