AFTD Auto-Formalizing Theoretical Domains

VNM.NotComplete.not_complete

theoremverifiedformalizationimported Lean

VNM.NotComplete.not_complete

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
open VNM in
theorem VNM.NotComplete.not_complete : ยฌ Completeness pref
Formalizes
EconCSLib, `VNM.NotComplete.not_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.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 6
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Finset BigOperators inopen VNM intheorem VNM.NotComplete.not_complete : ยฌ Completeness pref := by  intro h  have := h (Lottery.pure (๐•œ := โ„š) (0 : Fin 3)) (Lottery.pure (๐•œ := โ„š) (1 : Fin 3))  simp only [pref] at this  rcases this with h | h <;> {    have := congr_arg (fun L => L.val (0 : Fin 3)) h    simp [Lottery.pure] at this  }
See it in the graphDiscuss this resultChallenge it