proposition: Lemma add_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]; now rewrite <- ?add_le_mono_l. Qed.
imports: ZAxioms ZMulOrder GenericMinMax