proposition: Lemma bigmin_split P F1 F2 : \big[min/x]_(i <- r | P i) (min (F1 i) (F2 i)) = min (\big[min/x]_(i <- r | P i) F1 i) (\big[min/x]_(i <- r | P i) F2 i).
proof: Proof. by rewrite big_split_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)