A partition of a linear order is into blocks when its classes are order-connected, there are at least two of them, and none has an endpoint facing another class.
- ordConnected (x : α) : {y : α | s x y}.OrdConnected
Each class is order-connected.
- exists_not_rel : ∃ (x : α) (y : α), ¬s x y
There are at least two classes.
- exists_gt ⦃x y : α⦄ : x < y → ¬s x y → ∃ (z : α), x < z ∧ s x z
A class below another has no greatest element.
- exists_lt ⦃x y : α⦄ : x < y → ¬s x y → ∃ w < y, s w y
A class above another has no least element.
Used by isBlocks_iff, ofSetoid, ofSetoid_marginallyLT_iff, ofSetoid_atMostMarginal_iff, atMostMarginalSetoid_ofSetoid, isBlocks_atMostMarginalSetoid, equivSetoid, equivSetoid_symm_apply