proposition: Lemma bigmin_mkcondr P Q F : \big[min/x]_(i <- r | P i && Q i) F i = \big[min/x]_(i <- r | P i) if Q i then F i else x.
proof: Proof. by under eq_bigl do rewrite andbC; apply: bigmin_mkcondl. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)