fact: Definition finstructonforall {X : UU} (P : X -> UU) (sx : finstruct X) (fs : ∏ x : X , finstruct (P x)) : finstruct (∏ x : X , P x) := make_finstruct _ (nelstructonforall P _ sx fs).
imports: UniMath.MoreFoundations.Tactics UniMath.MoreFoundations.DecidablePropositions UniMath.MoreFoundations.NegativePropositions UniMath.Combinatorics.StandardFiniteSets UniMath.MoreFoundations.Subtypes