fact: Definition isfiniteforall {X : UU} (P : X -> UU) (sx : isfinite X) (fs : ∏ x : X , isfinite (P x)) : isfinite (∏ (x : X) , P x).
imports: UniMath.MoreFoundations.Tactics UniMath.MoreFoundations.DecidablePropositions UniMath.MoreFoundations.NegativePropositions UniMath.Combinatorics.StandardFiniteSets UniMath.MoreFoundations.Subtypes