Theorem lmhmlin 21290

Description: A homomorphism of left modules is 𝐾-linear. (Contributed by Stefan O'Rear, 1-Jan-2015.)

Hypotheses

Ref	Expression
lmhmlin.k	⊢ 𝐾 = (Scalar‘𝑆)
lmhmlin.b	⊢ 𝐵 = (Base‘𝐾)
lmhmlin.e	⊢ 𝐸 = (Base‘𝑆)
lmhmlin.m	⊢ · = ( ·𝑠 ‘𝑆)
lmhmlin.n	⊢ × = ( ·𝑠 ‘𝑇)

Assertion

Ref	Expression
lmhmlin	⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐸) → (𝐹‘(𝑋 · 𝑌)) = (𝑋 × (𝐹‘𝑌)))

Proof of Theorem lmhmlin

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		lmhmlin.k	. . . . . 6 ⊢ 𝐾 = (Scalar‘𝑆)
2		eqid 2761	. . . . . 6 ⊢ (Scalar‘𝑇) = (Scalar‘𝑇)
3		lmhmlin.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐾)
4		lmhmlin.e	. . . . . 6 ⊢ 𝐸 = (Base‘𝑆)
5		lmhmlin.m	. . . . . 6 ⊢ · = ( ·𝑠 ‘𝑆)
6		lmhmlin.n	. . . . . 6 ⊢ × = ( ·𝑠 ‘𝑇)
7	1, 2, 3, 4, 5, 6	islmhm 21282	. . . . 5 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) ↔ ((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ (Scalar‘𝑇) = 𝐾 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐸 (𝐹‘(𝑎 · 𝑏)) = (𝑎 × (𝐹‘𝑏)))))
8	7	simprbi 503	. . . 4 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ (Scalar‘𝑇) = 𝐾 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐸 (𝐹‘(𝑎 · 𝑏)) = (𝑎 × (𝐹‘𝑏))))
9	8	simp3d 1162	. . 3 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐸 (𝐹‘(𝑎 · 𝑏)) = (𝑎 × (𝐹‘𝑏)))
10		fvoveq1 7435	. . . . 5 ⊢ (𝑎 = 𝑋 → (𝐹‘(𝑎 · 𝑏)) = (𝐹‘(𝑋 · 𝑏)))
11		oveq1 7419	. . . . 5 ⊢ (𝑎 = 𝑋 → (𝑎 × (𝐹‘𝑏)) = (𝑋 × (𝐹‘𝑏)))
12	10, 11	eqeq12d 2777	. . . 4 ⊢ (𝑎 = 𝑋 → ((𝐹‘(𝑎 · 𝑏)) = (𝑎 × (𝐹‘𝑏)) ↔ (𝐹‘(𝑋 · 𝑏)) = (𝑋 × (𝐹‘𝑏))))
13		oveq2 7420	. . . . . 6 ⊢ (𝑏 = 𝑌 → (𝑋 · 𝑏) = (𝑋 · 𝑌))
14	13	fveq2d 6881	. . . . 5 ⊢ (𝑏 = 𝑌 → (𝐹‘(𝑋 · 𝑏)) = (𝐹‘(𝑋 · 𝑌)))
15		fveq2 6877	. . . . . 6 ⊢ (𝑏 = 𝑌 → (𝐹‘𝑏) = (𝐹‘𝑌))
16	15	oveq2d 7428	. . . . 5 ⊢ (𝑏 = 𝑌 → (𝑋 × (𝐹‘𝑏)) = (𝑋 × (𝐹‘𝑌)))
17	14, 16	eqeq12d 2777	. . . 4 ⊢ (𝑏 = 𝑌 → ((𝐹‘(𝑋 · 𝑏)) = (𝑋 × (𝐹‘𝑏)) ↔ (𝐹‘(𝑋 · 𝑌)) = (𝑋 × (𝐹‘𝑌))))
18	12, 17	rspc2v 3587	. . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐸) → (∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐸 (𝐹‘(𝑎 · 𝑏)) = (𝑎 × (𝐹‘𝑏)) → (𝐹‘(𝑋 · 𝑌)) = (𝑋 × (𝐹‘𝑌))))
19	9, 18	syl5com 32	. 2 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐸) → (𝐹‘(𝑋 · 𝑌)) = (𝑋 × (𝐹‘𝑌))))
20	19	3impib 1134	1 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐸) → (𝐹‘(𝑋 · 𝑌)) = (𝑋 × (𝐹‘𝑌)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ‘cfv 6531  (class class class)co 7412  Basecbs 17367  Scalarcsca 17411   ·_𝑠 cvsca 17412   GrpHom cghm 19407  LModclmod 21115   LMHom clmhm 21274

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6487  df-fun 6533  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-lmhm 21277

This theorem is used by:  islmhm2  21293  lmhmco  21298  lmhmplusg  21299  lmhmvsca  21300  lmhmf1o  21301  lmhmima  21302  lmhmpreima  21303  reslmhm  21307  reslmhm2  21308  reslmhm2b  21309  lmhmeql  21310  ipass  21931  lindfmm  22113  nmoleub2lem3  25416  nmoleub3  25420  lmhmimasvsca  33581  lmhmqusker  33950  mendassa  44150