proposition: Lemma mul_max_distr_r n m p : max (n * p) (m * p) == max n m * p.
proof: Proof. destruct (le_ge_cases n m); [rewrite 2 max_r | rewrite 2 max_l]; try order; now apply mul_le_mono_r. Qed.
imports: NAxioms NSub GenericMinMax