Theorems · Definition · combinatorics
Rel.interedges
{α : Type u_4} →
{β : Type u_5} → (r : α → β → Prop) → [(a : α) → DecidablePred (r a)] → Finset α → Finset β → Finset (α × β)Finset of edges of a relation between two finsets of vertices.
- Cited by
- 27 results in Mathlib
- Foundations
- Depth 64 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidablePred
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.
- Finsetstatement and proof · cited by 13,712
- SProd.sprodproof · cited by 1,750
- Finset.filterproof · cited by 949
Cited by29
Results whose statement or proof uses this declaration.
- SimpleGraph.interedgesproof · cited by 23
- Rel.edgeDensityproof · cited by 12
- Rel.mem_interedges_iffstatement · cited by 5
- Rel.edgeDensity_le_oneproof · cited by 3
- Rel.interedges_biUnion_leftstatement · cited by 3
- Rel.interedges_biUnion_rightstatement · cited by 3
- Rel.swap_mem_interedges_iffstatement and proof · cited by 3
- Rel.card_interedges_le_mulstatement · cited by 2
- Rel.edgeDensity_nonnegproof · cited by 2
- Rel.interedges_disjoint_leftstatement and proof · cited by 2
- Rel.interedges_disjoint_rightstatement and proof · cited by 2
- Rel.interedges_empty_leftstatement · cited by 2