proposition: Lemma bigmin_eq_id P F : (forall i, P i -> x <= F i) -> \big[min/x]_(i <- r | P i) F i = x.
proof: Proof. by move=> x_le; apply: le_anti; rewrite bigmin_le_id le_bigmin. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)