AFTD Auto-Formalizing Theoretical Domains

stdSimplex.pure_apply

theoremverifiedformalizationimported Lean

stdSimplex.pure_apply

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators Matrix in
variable {π•œ : Type*} [Field π•œ] [LinearOrder π•œ] [IsStrictOrderedRing π•œ] in
variable {I : Type*} [Fintype I] in
set_option linter.unusedSectionVars false in
@[simp]
theorem stdSimplex.pure_apply [DecidableEq I] (iβ‚€ i : I) :
    (stdSimplex.pure (π•œ := π•œ) iβ‚€).val i = if i = iβ‚€ then 1 else 0
Formalizes
EconCSLib, `stdSimplex.pure_apply`
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 1
Used by 27

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators Matrix in
variable {π•œ : Type*} [Field π•œ] [LinearOrder π•œ] [IsStrictOrderedRing π•œ] in
variable {I : Type*} [Fintype I] in
set_option linter.unusedSectionVars false in
@[simp]
theorem stdSimplex.pure_apply [DecidableEq I] (iβ‚€ i : I) :
    (stdSimplex.pure (π•œ := π•œ) iβ‚€).val i = if i = iβ‚€ then 1 else 0 := rfl
See it in the graphDiscuss this resultChallenge it