AFTD Auto-Formalizing Theoretical Domains

TT.inhabited

instanceimported Lean

TT.inhabited

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Classical in
variable (n l : ℕ+) (i : Fin n) in
noncomputable instance TT.inhabited : Inhabited (TT n l)
Defined in
EconCSLib, `TT.inhabited`
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.
What was changed in TT.inhabited
--- EconCSLib/Math/FixedPoint/Brouwer.lean:85 (TT.inhabited)
+++ as compiled here
@@ -1,5 +1,9 @@
-instance TT.inhabited : Inhabited (TT n l) where
+set_option autoImplicit true in
+set_option relaxedAutoImplicit true in
+open Classical in
+variable (n l : ℕ+) (i : Fin n) in
+noncomputable instance TT.inhabited : Inhabited (TT n l) where
   default :=
     ⟨ fun i => if i = 0 then Fin.last l else 0,  by
-      simp only [TT, Set.mem_setOf_eq]
+      show ∑ j : Fin n, ((if j = 0 then Fin.last l else 0 : Fin (l+1)) : ℕ) = l
       rw [Finset.sum_eq_single (0 : Fin n)]
Verified
08 Oct 2026
Axioms
none listed
Built on 2
Used by 9

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Classical in
variable (n l : ℕ+) (i : Fin n) in
noncomputable instance TT.inhabited : Inhabited (TT n l) where
  default :=
    ⟨ fun i => if i = 0 then Fin.last l else 0,  by
      show ∑ j : Fin n, ((if j = 0 then Fin.last l else 0 : Fin (l+1)) : ℕ) = l
      rw [Finset.sum_eq_single (0 : Fin n)]
      · simp
      · intro b _ hb; simp [hb]
      · simp [Fin.val_last] ⟩
See it in the graphDiscuss this resultChallenge it