proposition: Lemma Cnat_prod_eq1 (I : finType) (P : pred I) (F : I -> algC) : (forall i, P i -> F i \in Cnat) -> \prod_(i | P i) F i = 1 -> forall i, P i -> F i = 1.
proof: Proof. exact: natr_prod_eq1. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrfun ssrnat eqtype seq choice) mathcomp(div fintype path bigop finset prime order ssralg) mathcomp(poly polydiv mxpoly generic_quotient countalg) mathcomp(ssrnum closed_field ssrint archimedean rat intdiv) mathcomp(algebraics_fundamentals)