¶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!)
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!)
This page is also available via Gemini at gemini://dcreager.net/theory/constraints/intersect-lower-neq.gmi