proposition: Lemma real_addr_minl : {in real & real & real, @left_distributive R R +%R min}.
proof: Proof. by move=> x y z xr yr zr; case: (@real_leP (_ + _)); rewrite ?realD//; rewrite lterD2; case: real_leP. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(ssrAC div fintype path bigop order finset fingroup) mathcomp(ssralg poly)