AFTD Auto-Formalizing Theoretical Domains

LinearPMap.le_iff_neg_le_neg

theoremverifiedformalizationimported Lean

LinearPMap.le_iff_neg_le_neg

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Submodule in
variable {R : Type*} [Ring R] in
variable {E : Type*} [AddCommGroup E] [Module R E] in
variable {F : Type*} [AddCommGroup F] [Module R F] in
variable (f f₁ f₂ f₃ : E →ₗ.[R] F) {g g₁ g₂ : E →ₗ.[R] F} in
lemma LinearPMap.le_iff_neg_le_neg : g₁ ≤ g₂ ↔ -g₁ ≤ -g₂
Formalizes
Physlib, `LinearPMap.le_iff_neg_le_neg`
Lean proof
By Gregory J. Loges, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2026 Gregory J. Loges. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.
Verified
09 Oct 2026
Axioms
Quot.soundpropext
Used by 2

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Submodule invariable {R : Type*} [Ring R] invariable {E : Type*} [AddCommGroup E] [Module R E] invariable {F : Type*} [AddCommGroup F] [Module R F] invariable (f f₁ f₂ f₃ : E →ₗ.[R] F) {g g₁ g₂ : E →ₗ.[R] F} inlemma LinearPMap.le_iff_neg_le_neg : g₁ ≤ g₂ ↔ -g₁ ≤ -g₂ :=  ⟨fun ⟨h, h'⟩ ↦ ⟨h, fun _ _ h'' ↦ by simp [h' h'']⟩, fun ⟨h, _⟩ ↦ ⟨h, fun _ _ _ ↦ by aesop⟩⟩
See it in the graphDiscuss this resultChallenge it