AFTD Auto-Formalizing Theoretical Domains

Indifferent.symm

theoremverifiedformalizationimported Lean

Indifference is symmetric.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {A : Type*} [Preorder A] in
theorem Indifferent.symm {a b : A} (h : Indifferent a b) : Indifferent b a
Formalizes
EconCSLib, `Indifferent.symm`
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
none — Lean reports it depends on no axioms
Built on 1
  • IndifferentTwo outcomes are indifferent under a preorder: a ≤ b ∧ b ≤ a. In a PartialOrder this implies a = b; in a general Preorder it does…

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {A : Type*} [Preorder A] in
/-- Indifference is symmetric. -/
theorem Indifferent.symm {a b : A} (h : Indifferent a b) : Indifferent b a := ⟨h.2, h.1⟩
See it in the graphDiscuss this resultChallenge it