Theorem lmhmlin 21340

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 2763	. . . . . 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 21332	. . . . 5 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) ↔ ((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ (Scalar‘𝑇) = 𝐾 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐸 (𝐹‘(𝑎 · 𝑏)) = (𝑎 × (𝐹‘𝑏)))))
8	7	simprbi 503	. . . 4 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ (Scalar‘𝑇) = 𝐾 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐸 (𝐹‘(𝑎 · 𝑏)) = (𝑎 × (𝐹‘𝑏))))
9	8	simp3d 1162	. . 3 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐸 (𝐹‘(𝑎 · 𝑏)) = (𝑎 × (𝐹‘𝑏)))
10		fvoveq1 7466	. . . . 5 ⊢ (𝑎 = 𝑋 → (𝐹‘(𝑎 · 𝑏)) = (𝐹‘(𝑋 · 𝑏)))
11		oveq1 7450	. . . . 5 ⊢ (𝑎 = 𝑋 → (𝑎 × (𝐹‘𝑏)) = (𝑋 × (𝐹‘𝑏)))
12	10, 11	eqeq12d 2779	. . . 4 ⊢ (𝑎 = 𝑋 → ((𝐹‘(𝑎 · 𝑏)) = (𝑎 × (𝐹‘𝑏)) ↔ (𝐹‘(𝑋 · 𝑏)) = (𝑋 × (𝐹‘𝑏))))
13		oveq2 7451	. . . . . 6 ⊢ (𝑏 = 𝑌 → (𝑋 · 𝑏) = (𝑋 · 𝑌))
14	13	fveq2d 6912	. . . . 5 ⊢ (𝑏 = 𝑌 → (𝐹‘(𝑋 · 𝑏)) = (𝐹‘(𝑋 · 𝑌)))
15		fveq2 6908	. . . . . 6 ⊢ (𝑏 = 𝑌 → (𝐹‘𝑏) = (𝐹‘𝑌))
16	15	oveq2d 7459	. . . . 5 ⊢ (𝑏 = 𝑌 → (𝑋 × (𝐹‘𝑏)) = (𝑋 × (𝐹‘𝑌)))
17	14, 16	eqeq12d 2779	. . . 4 ⊢ (𝑏 = 𝑌 → ((𝐹‘(𝑋 · 𝑏)) = (𝑋 × (𝐹‘𝑏)) ↔ (𝐹‘(𝑋 · 𝑌)) = (𝑋 × (𝐹‘𝑌))))
18	12, 17	rspc2v 3590	. . 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 2147  ∀wral 3080  ‘cfv 6558  (class class class)co 7443  Basecbs 17416  Scalarcsca 17460   ·_𝑠 cvsca 17461   GrpHom cghm 19456  LModclmod 21165   LMHom clmhm 21324

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6512  df-fun 6560  df-fv 6566  df-ov 7446  df-oprab 7447  df-mpo 7448  df-lmhm 21327

This theorem is used by:  islmhm2  21343  lmhmco  21348  lmhmplusg  21349  lmhmvsca  21350  lmhmf1o  21351  lmhmima  21352  lmhmpreima  21353  reslmhm  21357  reslmhm2  21358  reslmhm2b  21359  lmhmeql  21360  ipass  21981  lindfmm  22163  nmoleub2lem3  25466  nmoleub3  25470  lmhmimasvsca  33669  lmhmqusker  34038  mendassa  44384