A set is disjoint if no two distinct members overlap.
- DisjointPred P = P.Pairwise fun (x y : α) => ¬Overlap x y
Used by not_disjointPred_iff, DisjointPred.anti, disjointPred_singleton, disjointPred_iff_pairwiseDisjoint, instDecidableDisjointPredOfFintypeOfDecidableEqOfDecidableRelOverlapOfDecidablePredMemSet, IsMaxDisjointIn, IsMaxDisjointIn.disjointPred, isMaxDisjointIn_iff, IsMaxDisjointIn.not_disjointPred_union, IsMaxDisjointIn.not_disjointPred, DisjointPred.isMaxDisjointIn_iff_eq, DisjointPred.isMaxDisjointIn_self
Used in Semantics/Mereology/Topology, HaslingerHienEtAl2025, Scontras2014, SuttonFilip2021