proposition: Lemma eq_minl x y : (min x y == x) = (x <= y).
proof: Proof. by rewrite !(fun_if, if_arg) eqxx; case: comparableP. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)