AFTD Auto-Formalizing Theoretical Domains

instFunLikeIndexedLOrderLinearOrder

instanceimported Lean

instFunLikeIndexedLOrderLinearOrder

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Classical in
open Finset in
variable {T : Type*} [Inhabited T] in
variable {I : Type*} in
instance instFunLikeIndexedLOrderLinearOrder : FunLike (IndexedLOrder I T) I (LinearOrder T)
Defined in
EconCSLib, `instFunLikeIndexedLOrderLinearOrder`
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 instFunLikeIndexedLOrderLinearOrder
--- EconCSLib/Math/FixedPoint/Scarf.lean:158 ()
+++ as compiled here
@@ -1,3 +1,9 @@
-instance : FunLike (IndexedLOrder I T) I (LinearOrder T) where
+set_option autoImplicit true in
+set_option relaxedAutoImplicit true in
+open Classical in
+open Finset in
+variable {T : Type*} [Inhabited T] in
+variable {I : Type*} in
+instance instFunLikeIndexedLOrderLinearOrder : FunLike (IndexedLOrder I T) I (LinearOrder T) where
   coe := fun a => a.IST
-  coe_injective' := fun f g h => by cases f; cases g; congr
+  coe_injective := fun f g h => by cases f; cases g; congr
Verified
08 Oct 2026
Axioms
none listed
Built on 1
  • IndexedLOrderA family of linear orders on T indexed by I. Each i : I provides a linear order IST i : LinearOrder T on the type T. This is the…
Used by 42

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Classical in
open Finset in
variable {T : Type*} [Inhabited T] in
variable {I : Type*} in
instance instFunLikeIndexedLOrderLinearOrder : FunLike (IndexedLOrder I T) I (LinearOrder T) where
  coe := fun a => a.IST
  coe_injective := fun f g h => by cases f; cases g; congr
See it in the graphDiscuss this resultChallenge it