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

Theorem islmhmd 21365
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 3209 . . 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 21353 . 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 2147  ∀wral 3080  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  Scalarcsca 17475   ·𝑠 cvsca 17476   GrpHom cghm 19477  LModclmod 21186   LMHom clmhm 21345
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 5255  ax-nul 5266  ax-pr 5398
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 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-lmhm 21348
This theorem is used by:  0lmhm  21366  idlmhm  21367  invlmhm  21368  lmhmco  21369  lmhmplusg  21370  lmhmvsca  21371  lmhmf1o  21372  reslmhm2  21379  reslmhm2b  21380  pwsdiaglmhm  21383  pwssplit3  21387  frlmup1  22159  imaslmhm  34022  quslmhm  34024  lmhmqusker  34072  frlmsnic  43870
  Copyright terms: Public domain W3C validator