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

Theorem islmhmd 21314
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 3206 . . 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 21302 . 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 1570   ∈ wcel 2145  ∀wral 3077  ‘cfv 6538  (class class class)co 7420  Basecbs 17387  Scalarcsca 17431   ·𝑠 cvsca 17432   GrpHom cghm 19427  LModclmod 21135   LMHom clmhm 21294
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6494  df-fun 6540  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-lmhm 21297
This theorem is used by:  0lmhm  21315  idlmhm  21316  invlmhm  21317  lmhmco  21318  lmhmplusg  21319  lmhmvsca  21320  lmhmf1o  21321  reslmhm2  21328  reslmhm2b  21329  pwsdiaglmhm  21332  pwssplit3  21336  frlmup1  22104  imaslmhm  33918  quslmhm  33920  lmhmqusker  33968  frlmsnic  43604
  Copyright terms: Public domain W3C validator