AFTD Auto-Formalizing Theoretical Domains

LinearPMap.smul_compRestricted

theoremverifiedformalizationimported Lean

LinearPMap.smul_compRestricted

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
@[simp]
lemma LinearPMap.smul_compRestricted {M : Type*} [Monoid M] [DistribMulAction M G] [SMulCommClass R M G]
    (c : M) (g : F →ₗ.[R] G) (f : E →ₗ.[R] F) :
    (c • g) ∘ᵣ f = c • (g ∘ᵣ f)
Formalizes
Physlib, `LinearPMap.smul_compRestricted`
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
Classical.choiceQuot.soundpropext
Built on 5

Lean source view module on GitHub

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} in@[simp]lemma LinearPMap.smul_compRestricted {M : Type*} [Monoid M] [DistribMulAction M G] [SMulCommClass R M G]    (c : M) (g : F →ₗ.[R] G) (f : E →ₗ.[R] F) :    (c • g) ∘ᵣ f = c • (g ∘ᵣ f) := by  ext  · simp [compRestricted_domain]  · simp
See it in the graphDiscuss this resultChallenge it