LinearPMap.sub_le_of_le_add
theoremverifiedformalizationimported Lean
LinearPMap.sub_le_of_le_add
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.sub_le_of_le_add (h : g ≤ g₁ + g₂) : g - g₂ ≤ g₁
- Formalizes
- Physlib, `LinearPMap.sub_le_of_le_add`
- 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_le_of_le_add← LinearPMap.sub_le_of_le_add (Physlib/Mathematics/ForMathlib/LinearPMap.lean:94): verbatim
- Verified
- 09 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Used by 1
- LinearPMap.add_le_of_le_subLinearPMap.add_le_of_le_sub
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
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.sub_le_of_le_add (h : g ≤ g₁ + g₂) : g - g₂ ≤ g₁ := by constructor · exact (inf_le_of_left_le le_rfl).trans (le_inf_iff.mp <| add_domain g₁ g₂ ▸ h.1).1 · intro ⟨x, hx⟩ ⟨y, hy⟩ rfl simp [sub_apply, @h.2 ⟨x, hx.1⟩ ⟨x, ⟨hy, hx.2⟩⟩ rfl, add_apply]