AFTD Auto-Formalizing Theoretical Domains

IsPositiveAffineOf.trans

theoremverifiedformalizationimported Lean

Positive affine transformation is transitive.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {X π•œ : Type*} [Field π•œ] [LinearOrder π•œ] [IsStrictOrderedRing π•œ] in
theorem IsPositiveAffineOf.trans {u v w : X β†’ π•œ}
    (h₁ : IsPositiveAffineOf u v) (hβ‚‚ : IsPositiveAffineOf v w) :
    IsPositiveAffineOf u w
Formalizes
EconCSLib, `IsPositiveAffineOf.trans`
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
Quot.soundpropext
Built on 3
  • TotalPreorderA total preorder: a preorder where ≀ is total (complete). This is weaker than LinearOrder β€” it does NOT require antisymmetry or…
  • IsPositiveAffineOfv is a positive affine transformation of u: v(x) = a Β· u(x) + b with a > 0. Two utility functions related by a positive affine…
  • LinearOrder.toTotalPreorderEvery LinearOrder is a TotalPreorder.

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {X π•œ : Type*} [Field π•œ] [LinearOrder π•œ] [IsStrictOrderedRing π•œ] in/-- Positive affine transformation is transitive. -/theorem IsPositiveAffineOf.trans {u v w : X β†’ π•œ}    (h₁ : IsPositiveAffineOf u v) (hβ‚‚ : IsPositiveAffineOf v w) :    IsPositiveAffineOf u w := by  obtain ⟨a₁, b₁, ha₁, hv⟩ := h₁  obtain ⟨aβ‚‚, bβ‚‚, haβ‚‚, hw⟩ := hβ‚‚  exact ⟨aβ‚‚ * a₁, aβ‚‚ * b₁ + bβ‚‚, mul_pos haβ‚‚ ha₁, fun x => by rw [hw, hv]; ring⟩
See it in the graphDiscuss this resultChallenge it