MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  islmhmd Structured version   Visualization version   GIF version

Theorem islmhmd 21029
Description: Deduction for a module homomorphism. (Contributed by Stefan O'Rear, 4-Feb-2015.)
Hypotheses
Ref Expression
islmhmd.x 𝑋 = (Base‘𝑆)
islmhmd.a · = ( ·𝑠𝑆)
islmhmd.b × = ( ·𝑠𝑇)
islmhmd.k 𝐾 = (Scalar‘𝑆)
islmhmd.j 𝐽 = (Scalar‘𝑇)
islmhmd.n 𝑁 = (Base‘𝐾)
islmhmd.s (𝜑𝑆 ∈ LMod)
islmhmd.t (𝜑𝑇 ∈ LMod)
islmhmd.c (𝜑𝐽 = 𝐾)
islmhmd.f (𝜑𝐹 ∈ (𝑆 GrpHom 𝑇))
islmhmd.l ((𝜑 ∧ (𝑥𝑁𝑦𝑋)) → (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹𝑦)))
Assertion
Ref Expression
islmhmd (𝜑𝐹 ∈ (𝑆 LMHom 𝑇))
Distinct variable groups:   𝜑,𝑥,𝑦   𝑥,𝐹,𝑦   𝑥,𝑆,𝑦   𝑥,𝑇,𝑦   𝑥,𝑋,𝑦   𝑥,𝐽,𝑦   𝑥,𝑁,𝑦   𝑥,𝐾,𝑦
Allowed substitution hints:   · (𝑥,𝑦)   × (𝑥,𝑦)

Proof of Theorem islmhmd
StepHypRef Expression
1 islmhmd.s . 2 (𝜑𝑆 ∈ LMod)
2 islmhmd.t . 2 (𝜑𝑇 ∈ LMod)
3 islmhmd.f . . 3 (𝜑𝐹 ∈ (𝑆 GrpHom 𝑇))
4 islmhmd.c . . 3 (𝜑𝐽 = 𝐾)
5 islmhmd.l . . . 4 ((𝜑 ∧ (𝑥𝑁𝑦𝑋)) → (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹𝑦)))
65ralrimivva 3181 . . 3 (𝜑 → ∀𝑥𝑁𝑦𝑋 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹𝑦)))
73, 4, 63jca 1129 . 2 (𝜑 → (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐽 = 𝐾 ∧ ∀𝑥𝑁𝑦𝑋 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹𝑦))))
8 islmhmd.k . . 3 𝐾 = (Scalar‘𝑆)
9 islmhmd.j . . 3 𝐽 = (Scalar‘𝑇)
10 islmhmd.n . . 3 𝑁 = (Base‘𝐾)
11 islmhmd.x . . 3 𝑋 = (Base‘𝑆)
12 islmhmd.a . . 3 · = ( ·𝑠𝑆)
13 islmhmd.b . . 3 × = ( ·𝑠𝑇)
148, 9, 10, 11, 12, 13islmhm 21017 . 2 (𝐹 ∈ (𝑆 LMHom 𝑇) ↔ ((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐽 = 𝐾 ∧ ∀𝑥𝑁𝑦𝑋 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹𝑦)))))
151, 2, 7, 14syl21anbrc 1346 1 (𝜑𝐹 ∈ (𝑆 LMHom 𝑇))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087   = wceq 1542  wcel 2114  wral 3052  cfv 6493  (class class class)co 7361  Basecbs 17173  Scalarcsca 17217   ·𝑠 cvsca 17218   GrpHom cghm 19181  LModclmod 20849   LMHom clmhm 21009
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5232  ax-nul 5242  ax-pr 5371
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-sbc 3730  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-iota 6449  df-fun 6495  df-fv 6501  df-ov 7364  df-oprab 7365  df-mpo 7366  df-lmhm 21012
This theorem is referenced by:  0lmhm  21030  idlmhm  21031  invlmhm  21032  lmhmco  21033  lmhmplusg  21034  lmhmvsca  21035  lmhmf1o  21036  reslmhm2  21043  reslmhm2b  21044  pwsdiaglmhm  21047  pwssplit3  21051  frlmup1  21791  imaslmhm  33435  quslmhm  33437  lmhmqusker  33495  frlmsnic  43002
  Copyright terms: Public domain W3C validator