dcreager.net

Intersection of s₁ ≤ and ≠ t₂

The intersection of a lower bound and a non-equivalence cannot be simplified.

(s₁ ≤) ∧ (≠ t₂) = (s₁ ≤) ∧ (≁ t₂)

(If there is also an upper bound, then the range might be simplifiable!)

Intersection of s₁..t₁ and ≠ t₂

» Theory » Constraints on sets