proposition: Lemma cut_minus_mult_distr_r x y z : 0 ≤ x → (y ∸ z) * x = y * x ∸ z * x.
proof: Proof. intros E. rewrite 3!(commutativity _ x). now apply cut_minus_mult_distr_l. Qed.
imports: Coq.setoid_ring.Ring MathClasses.interfaces.abstract_algebra MathClasses.interfaces.additional_operations MathClasses.interfaces.orders MathClasses.orders.minmax