proposition: Lemma min_idPl x y : reflect (min x y = x) (x <= y).
proof: Proof. by apply: (iffP idP); rewrite (rwP eqP) eq_minl. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)