VNM.NotTransitive.complete
theoremverifiedformalizationimported Lean
VNM.NotTransitive.complete
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators in open VNM in theorem VNM.NotTransitive.complete : Completeness pref
- Formalizes
- EconCSLib, `VNM.NotTransitive.complete`
- 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.VNM.NotTransitive.complete← VNM.NotTransitive.complete (EconCSLib/Foundation/Utility/VNMAxioms.lean:251): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- VNM.NotContinuous.prefVNM.NotContinuous.pref
- LotteryA lottery over outcomes
O: a probability distribution. JuststdSimplex 𝕜 Owith a game-theoretic name. - VNM.NotTransitive.prefVNM.NotTransitive.pref
- VNM.CompletenessCompleteness: every pair is comparable.
- Used by 1
- VNM.NotTransitive.transitivity_independentVNM.NotTransitive.transitivity_independent
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Finset BigOperators inopen VNM intheorem VNM.NotTransitive.complete : Completeness pref := by intro L₁ L₂ simp only [pref] -- Either L₁(0) ≥ L₂(0) or L₂(0) ≥ L₁(0); the first gives left-left, the second gives right-left rcases le_total (L₂.val 0) (L₁.val 0) with h | h · left; left; exact h · right; left; exact h