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

Theorem islmhmd 21323
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 3205 . . 3 (𝜑 → ∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑋 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦)))
73, 4, 63jca 1146 . 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 21311 . 2 (𝐹 ∈ (𝑆 LMHom 𝑇) ↔ ((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐽 = 𝐾 ∧ ∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑋 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦)))))
151, 2, 7, 14syl21anbrc 1363 1 (𝜑 → 𝐹 ∈ (𝑆 LMHom 𝑇))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ‘cfv 6543  (class class class)co 7424  Basecbs 17396  Scalarcsca 17440   ·𝑠 cvsca 17441   GrpHom cghm 19436  LModclmod 21144   LMHom clmhm 21303
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 5391
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 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  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 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6497  df-fun 6545  df-fv 6551  df-ov 7427  df-oprab 7428  df-mpo 7429  df-lmhm 21306
This theorem is used by:  0lmhm  21324  idlmhm  21325  invlmhm  21326  lmhmco  21327  lmhmplusg  21328  lmhmvsca  21329  lmhmf1o  21330  reslmhm2  21337  reslmhm2b  21338  pwsdiaglmhm  21341  pwssplit3  21345  frlmup1  22113  imaslmhm  33968  quslmhm  33970  lmhmqusker  34018  frlmsnic  43741
  Copyright terms: Public domain W3C validator