proposition: Lemma comparable_minl z : {in >=< z &, forall x y, min x y >=< z}.
proof: Proof. by move=> x y cmp_xz cmp_yz; rewrite /min; case: ifP. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)