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