TT.IST
instanceimported Lean
TT.IST
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Classical in variable (n l : ℕ+) (i : Fin n) in noncomputable instance TT.IST : IsStrictTotalOrder (TT n l) (TT.Ilt i)
- Defined in
- EconCSLib, `TT.IST`
- 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.TT.IST← TT.IST (EconCSLib/Math/FixedPoint/Brouwer.lean:118): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 6
- TT.inhabitedTT.inhabited
- TT.IltTT.Ilt
- TT.funlikeTT.funlike
- TT.CoestdSimplexTT.CoestdSimplex
- TTTT
- TT.finiteTT.finite
- Used by 4
- TT.ILOTT.ILO
- TT.Ilt_keypropTT.Ilt_keyprop
- TT.Ilt_defTT.Ilt_def
- FcolorFcolor
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.IST : IsStrictTotalOrder (TT n l) (TT.Ilt i) where trichotomous := by intro a b h_ab h_ba unfold TT.Ilt at h_ab h_ba have h_eq : toLex (a i, a) = toLex (b i, b) := le_antisymm (le_of_not_gt h_ba) (le_of_not_gt h_ab) have h_pair : (a i, a) = (b i, b) := (EquivLike.injective (toLex : (Fin (l + 1) × TT n l) ≃ Lex (Fin (l + 1) × TT n l))) h_eq exact congrArg Prod.snd h_pair irrefl := by intro a unfold TT.Ilt exact lt_irrefl _ trans := by intro a b c h_ab h_bc unfold TT.Ilt at * exact lt_trans h_ab h_bc