proposition: Lemma sub_bigmin [x0] I r (P P' : {pred I}) (F : I -> T) : (forall i, P' i -> P i) -> \big[min/x0]_(i <- r | P i) F i <= \big[min/x0]_(i <- r | P' i) F i.
proof: Proof. exact: (sub_le_big ge_refl). Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)