AFTD Auto-Formalizing Theoretical Domains

IndexedLOrder.parity_lemma

theoremverifiedformalizationimported Lean

IndexedLOrder.parity_lemma

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Classical in
variable {T : Type*} [Inhabited T] in
variable {I : Type*} in
variable [IST : IndexedLOrder I T] in
set_option quotPrecheck false in
variable (σ : Finset T) (C : Finset I) in
variable [DecidableEq T] [DecidableEq I] in
open Classical in
variable (c : T → I) (σ : Finset T) (C : Finset I) in
variable {c σ C} in
variable [Fintype T] [Fintype I] in
variable (c) in
lemma IndexedLOrder.parity_lemma {a b c d : ℕ } (h1 : Odd a) (h2 : Even b) (h3 : Even d) (h4 : a + b = c + d ): Odd c
Formalizes
EconCSLib, `IndexedLOrder.parity_lemma`
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 2

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Classical invariable {T : Type*} [Inhabited T] invariable {I : Type*} invariable [IST : IndexedLOrder I T] inset_option quotPrecheck false invariable (σ : Finset T) (C : Finset I) invariable [DecidableEq T] [DecidableEq I] inopen Classical invariable (c : T → I) (σ : Finset T) (C : Finset I) invariable {c σ C} invariable [Fintype T] [Fintype I] invariable (c) inlemma IndexedLOrder.parity_lemma {a b c d : ℕ } (h1 : Odd a) (h2 : Even b) (h3 : Even d) (h4 : a + b = c + d ): Odd c := by  by_contra h0  replace h0 := Nat.not_odd_iff_even.1 h0  have oddab := Even.odd_add h2 h1  rw [h4] at oddab  have evencd := Even.add h0 h3  exact Nat.not_odd_iff_even.2 evencd oddab
See it in the graphDiscuss this resultChallenge it