proposition: Lemma mul_min_distr_l n m p : min (p * n) (p * m) == p * min n m.
proof: Proof. destruct (le_ge_cases n m); [rewrite 2 min_l | rewrite 2 min_r]; try order; now apply mul_le_mono_l. Qed.
imports: NAxioms NSub GenericMinMax