Theorem lmhmlin 21193

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 2766	. . . . . 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 21185	. . . . 5 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) ↔ ((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ (Scalar‘𝑇) = 𝐾 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐸 (𝐹‘(𝑎 · 𝑏)) = (𝑎 × (𝐹‘𝑏)))))
8	7	simprbi 503	. . . 4 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ (Scalar‘𝑇) = 𝐾 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐸 (𝐹‘(𝑎 · 𝑏)) = (𝑎 × (𝐹‘𝑏))))
9	8	simp3d 1162	. . 3 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐸 (𝐹‘(𝑎 · 𝑏)) = (𝑎 × (𝐹‘𝑏)))
10		fvoveq1 7446	. . . . 5 ⊢ (𝑎 = 𝑋 → (𝐹‘(𝑎 · 𝑏)) = (𝐹‘(𝑋 · 𝑏)))
11		oveq1 7430	. . . . 5 ⊢ (𝑎 = 𝑋 → (𝑎 × (𝐹‘𝑏)) = (𝑋 × (𝐹‘𝑏)))
12	10, 11	eqeq12d 2782	. . . 4 ⊢ (𝑎 = 𝑋 → ((𝐹‘(𝑎 · 𝑏)) = (𝑎 × (𝐹‘𝑏)) ↔ (𝐹‘(𝑋 · 𝑏)) = (𝑋 × (𝐹‘𝑏))))
13		oveq2 7431	. . . . . 6 ⊢ (𝑏 = 𝑌 → (𝑋 · 𝑏) = (𝑋 · 𝑌))
14	13	fveq2d 6892	. . . . 5 ⊢ (𝑏 = 𝑌 → (𝐹‘(𝑋 · 𝑏)) = (𝐹‘(𝑋 · 𝑌)))
15		fveq2 6888	. . . . . 6 ⊢ (𝑏 = 𝑌 → (𝐹‘𝑏) = (𝐹‘𝑌))
16	15	oveq2d 7439	. . . . 5 ⊢ (𝑏 = 𝑌 → (𝑋 × (𝐹‘𝑏)) = (𝑋 × (𝐹‘𝑌)))
17	14, 16	eqeq12d 2782	. . . 4 ⊢ (𝑏 = 𝑌 → ((𝐹‘(𝑋 · 𝑏)) = (𝑋 × (𝐹‘𝑏)) ↔ (𝐹‘(𝑋 · 𝑌)) = (𝑋 × (𝐹‘𝑌))))
18	12, 17	rspc2v 3595	. . 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 2146  ∀wral 3082  ‘cfv 6543  (class class class)co 7423  Basecbs 17294  Scalarcsca 17338   ·_𝑠 cvsca 17339   GrpHom cghm 19314  LModclmod 21018   LMHom clmhm 21177

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pr 5409

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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-sbc 3748  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-iota 6499  df-fun 6545  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428  df-lmhm 21180

This theorem is used by:  islmhm2  21196  lmhmco  21201  lmhmplusg  21202  lmhmvsca  21203  lmhmf1o  21204  lmhmima  21205  lmhmpreima  21206  reslmhm  21210  reslmhm2  21211  reslmhm2b  21212  lmhmeql  21213  ipass  21832  lindfmm  22014  nmoleub2lem3  25311  nmoleub3  25315  lmhmimasvsca  33389  lmhmqusker  33757  mendassa  43958