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