AFTD Auto-Formalizing Theoretical Domains

Pi.Lex.finite

instanceimported Lean

A dependent product of finite, indexed by finite, is a finite.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Classical in
instance Pi.Lex.finite {I : Type*} {X : I → Type*} [DecidableEq I] [Finite I]
    [∀ a, Finite (X a)] : Finite (Πₗ a, X a)
Defined in
EconCSLib, `Pi.Lex.finite`
Lean proof
By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at 1a88f809b538 (Copyright (c) 2026 EconCSLib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.
Verified
08 Oct 2026
Axioms
none listed
Used by 3

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Classical in
/-- A dependent product of finite, indexed by finite, is a finite. -/
instance Pi.Lex.finite {I : Type*} {X : I → Type*} [DecidableEq I] [Finite I]
    [∀ a, Finite (X a)] : Finite (Πₗ a, X a) :=
        (Equiv.finite_iff toLex).1 Pi.finite
See it in the graphDiscuss this resultChallenge it