Proof step 2 from proof nummult-le-01 (previous step)
0 < m, n < 0 ⊦ m * m0 ≤ n ↔ m0 ≤ (n + 1 - m) / m
Heuristic simplifier applied rule simplifier
And closed the goal!
Rule argument
Additional information
Used simplifier rules:
le-div-to-mult: m0 ≠ 0 ⊦ n ≤ m / m0 ↔ n * m0 ≤ m;%zero-01: ⊦ ¬ m < 0; from specification nat-basic1%zero: ⊦ 0 < m ↔ m ≠ 0; from specification nat-basic1