proposition: Lemma le_min z x y : (z <= min x y) = (z <= x) && (z <= y).
proof: Proof. exact: comparable_le_min. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)