LinearPMap.sub_left_le_of_le
theoremverifiedformalizationimported Lean
LinearPMap.sub_left_le_of_le
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open LinearPMap 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.sub_left_le_of_le (h : g₁ ≤ g₂) : f - g₁ ≤ f - g₂
- Formalizes
- Physlib, `LinearPMap.sub_left_le_of_le`
- 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.LinearPMap.sub_left_le_of_le← LinearPMap.sub_left_le_of_le (Physlib/Mathematics/ForMathlib/LinearPMap.lean:119): verbatim
- Verified
- 09 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- LinearPMap.le_iff_neg_le_negLinearPMap.le_iff_neg_le_neg
- LinearPMap.sub_right_le_of_leLinearPMap.sub_right_le_of_le
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open LinearPMap 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.sub_left_le_of_le (h : g₁ ≤ g₂) : f - g₁ ≤ f - g₂ := neg_sub g₁ f ▸ neg_sub g₂ f ▸ le_iff_neg_le_neg.mp (sub_right_le_of_le f h)