proposition: Lemma bigminIr (A B : {set I}) F : \big[min/x]_(i in B) F i <= \big[min/x]_(i in A :&: B) F i.
proof: Proof. by under [leRHS]eq_bigl do rewrite setIC; apply: bigminIl. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)