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