| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > islmhmd | Structured version Visualization version GIF version | ||
| Description: Deduction for a module homomorphism. (Contributed by Stefan O'Rear, 4-Feb-2015.) |
| 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 | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑁 ∧ 𝑦 ∈ 𝑋)) → (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦))) |
| Ref | Expression |
|---|---|
| islmhmd | ⊢ (𝜑 → 𝐹 ∈ (𝑆 LMHom 𝑇)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | islmhmd.s | . 2 ⊢ (𝜑 → 𝑆 ∈ LMod) | |
| 2 | islmhmd.t | . 2 ⊢ (𝜑 → 𝑇 ∈ LMod) | |
| 3 | islmhmd.f | . . 3 ⊢ (𝜑 → 𝐹 ∈ (𝑆 GrpHom 𝑇)) | |
| 4 | islmhmd.c | . . 3 ⊢ (𝜑 → 𝐽 = 𝐾) | |
| 5 | islmhmd.l | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑁 ∧ 𝑦 ∈ 𝑋)) → (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦))) | |
| 6 | 5 | ralrimivva 3214 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑋 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦))) |
| 7 | 3, 4, 6 | 3jca 1144 | . 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 ⊢ × = ( ·𝑠 ‘𝑇) | |
| 14 | 8, 9, 10, 11, 12, 13 | islmhm 21125 | . 2 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) ↔ ((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐽 = 𝐾 ∧ ∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑋 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦))))) |
| 15 | 1, 2, 7, 14 | syl21anbrc 1361 | 1 ⊢ (𝜑 → 𝐹 ∈ (𝑆 LMHom 𝑇)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ∀wral 3085 ‘cfv 6537 (class class class)co 7411 Basecbs 17268 Scalarcsca 17312 ·𝑠 cvsca 17313 GrpHom cghm 19282 LModclmod 20958 LMHom clmhm 21117 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pr 5405 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-sbc 3754 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-opab 5178 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-iota 6493 df-fun 6539 df-fv 6545 df-ov 7414 df-oprab 7415 df-mpo 7416 df-lmhm 21120 |
| This theorem is referenced by: 0lmhm 21138 idlmhm 21139 invlmhm 21140 lmhmco 21141 lmhmplusg 21142 lmhmvsca 21143 lmhmf1o 21144 reslmhm2 21151 reslmhm2b 21152 pwsdiaglmhm 21155 pwssplit3 21159 frlmup1 21916 imaslmhm 33619 quslmhm 33621 lmhmqusker 33669 frlmsnic 43199 |
| Copyright terms: Public domain | W3C validator |