Theorem lmhmlin 21315

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 2760	. . . . . 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 21307	. . . . 5 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) ↔ ((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ (Scalar‘𝑇) = 𝐾 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐸 (𝐹‘(𝑎 · 𝑏)) = (𝑎 × (𝐹‘𝑏)))))
8	7	simprbi 503	. . . 4 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ (Scalar‘𝑇) = 𝐾 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐸 (𝐹‘(𝑎 · 𝑏)) = (𝑎 × (𝐹‘𝑏))))
9	8	simp3d 1162	. . 3 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐸 (𝐹‘(𝑎 · 𝑏)) = (𝑎 × (𝐹‘𝑏)))
10		fvoveq1 7443	. . . . 5 ⊢ (𝑎 = 𝑋 → (𝐹‘(𝑎 · 𝑏)) = (𝐹‘(𝑋 · 𝑏)))
11		oveq1 7427	. . . . 5 ⊢ (𝑎 = 𝑋 → (𝑎 × (𝐹‘𝑏)) = (𝑋 × (𝐹‘𝑏)))
12	10, 11	eqeq12d 2776	. . . 4 ⊢ (𝑎 = 𝑋 → ((𝐹‘(𝑎 · 𝑏)) = (𝑎 × (𝐹‘𝑏)) ↔ (𝐹‘(𝑋 · 𝑏)) = (𝑋 × (𝐹‘𝑏))))
13		oveq2 7428	. . . . . 6 ⊢ (𝑏 = 𝑌 → (𝑋 · 𝑏) = (𝑋 · 𝑌))
14	13	fveq2d 6889	. . . . 5 ⊢ (𝑏 = 𝑌 → (𝐹‘(𝑋 · 𝑏)) = (𝐹‘(𝑋 · 𝑌)))
15		fveq2 6885	. . . . . 6 ⊢ (𝑏 = 𝑌 → (𝐹‘𝑏) = (𝐹‘𝑌))
16	15	oveq2d 7436	. . . . 5 ⊢ (𝑏 = 𝑌 → (𝑋 × (𝐹‘𝑏)) = (𝑋 × (𝐹‘𝑌)))
17	14, 16	eqeq12d 2776	. . . 4 ⊢ (𝑏 = 𝑌 → ((𝐹‘(𝑋 · 𝑏)) = (𝑋 × (𝐹‘𝑏)) ↔ (𝐹‘(𝑋 · 𝑌)) = (𝑋 × (𝐹‘𝑌))))
18	12, 17	rspc2v 3586	. . 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 1569   ∈ wcel 2144  ∀wral 3076  ‘cfv 6538  (class class class)co 7420  Basecbs 17392  Scalarcsca 17436   ·_𝑠 cvsca 17437   GrpHom cghm 19432  LModclmod 21140   LMHom clmhm 21299

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-iota 6494  df-fun 6540  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-lmhm 21302

This theorem is used by:  islmhm2  21318  lmhmco  21323  lmhmplusg  21324  lmhmvsca  21325  lmhmf1o  21326  lmhmima  21327  lmhmpreima  21328  reslmhm  21332  reslmhm2  21333  reslmhm2b  21334  lmhmeql  21335  ipass  21956  lindfmm  22138  nmoleub2lem3  25441  nmoleub3  25445  lmhmimasvsca  33645  lmhmqusker  34014  mendassa  44285