Proof step 2 from proof orderedle-ls (previous step)
b < a, ordered≤(a ' + x), b ∈ x ⊦
Heuristic simplifier applied rule simplifier
And closed the goal!
Rule argument
Additional information
Used simplifier rules:
ole-in: ⊦ ordered≤(a ' + x) ∧ b ∈ x → ¬ b < a;%cons-02: ⊦ ordered≤(a ' + x) → ordered≤(x);%a: ⊦ (x + y) + z = x + y + z; from specification list