LinearPMap.compRestricted_sub_ge
theoremverifiedformalizationimported Lean
LinearPMap.compRestricted_sub_ge
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 {G : Type*} [AddCommGroup G] [Module R G] in variable (g g₁ g₂ : F →ₗ.[R] G) (f f₁ f₂ : E →ₗ.[R] F) in variable {v : F →ₗ.[R] G} {u : E →ₗ.[R] F} in lemma LinearPMap.compRestricted_sub_ge : g ∘ᵣ f₁ - g ∘ᵣ f₂ ≤ g ∘ᵣ (f₁ - f₂)
- Formalizes
- Physlib, `LinearPMap.compRestricted_sub_ge`
- 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.compRestricted_sub_ge← LinearPMap.compRestricted_sub_ge (Physlib/Mathematics/ForMathlib/LinearPMap.lean:294): verbatim
- Verified
- 09 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- LinearPMap.compRestricted_negLinearPMap.compRestricted_neg
- LinearPMap.compRestricted_add_geLinearPMap.compRestricted_add_ge
- LinearPMap.compRestricted
g ∘ᵣ fis the composition ofgwithfrestricted to a domain consisting of exactly thosex : f.domainfor whichf x ∈ g.domain. - LinearPMap.sum_applyLinearPMap.sum_apply
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 quotPrecheck falseopen LinearPMap@[inherit_doc compRestricted]local infixr:80 " ∘ᵣ " => compRestrictedset_option autoImplicit true inset_option relaxedAutoImplicit true inopen LinearPMap inopen Submodule invariable {R : Type*} [Ring R] invariable {E : Type*} [AddCommGroup E] [Module R E] invariable {F : Type*} [AddCommGroup F] [Module R F] invariable {G : Type*} [AddCommGroup G] [Module R G] invariable (g g₁ g₂ : F →ₗ.[R] G) (f f₁ f₂ : E →ₗ.[R] F) invariable {v : F →ₗ.[R] G} {u : E →ₗ.[R] F} inlemma LinearPMap.compRestricted_sub_ge : g ∘ᵣ f₁ - g ∘ᵣ f₂ ≤ g ∘ᵣ (f₁ - f₂) := by simp only [sub_eq_add_neg, ← compRestricted_neg] exact compRestricted_add_ge g f₁ (-f₂)