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