proposition: Lemma bigmin_le_id P F : \big[min/x]_(i <- r | P i) F i <= x.
proof: Proof. by rewrite bigmin_idl. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)