| 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 3205 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑋 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦))) |
| 7 | 3, 4, 6 | 3jca 1141 | . 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 21094 | . 2 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) ↔ ((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐽 = 𝐾 ∧ ∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑋 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦))))) |
| 15 | 1, 2, 7, 14 | syl21anbrc 1358 | 1 ⊢ (𝜑 → 𝐹 ∈ (𝑆 LMHom 𝑇)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1098 = wceq 1560 ∈ wcel 2142 ∀wral 3076 ‘cfv 6521 (class class class)co 7396 Basecbs 17245 Scalarcsca 17289 ·𝑠 cvsca 17290 GrpHom cghm 19253 LModclmod 20927 LMHom clmhm 21086 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5246 ax-nul 5256 ax-pr 5390 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3077 df-rex 3087 df-rab 3415 df-v 3456 df-sbc 3745 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-iota 6477 df-fun 6523 df-fv 6529 df-ov 7399 df-oprab 7400 df-mpo 7401 df-lmhm 21089 |
| This theorem is referenced by: 0lmhm 21107 idlmhm 21108 invlmhm 21109 lmhmco 21110 lmhmplusg 21111 lmhmvsca 21112 lmhmf1o 21113 reslmhm2 21120 reslmhm2b 21121 pwsdiaglmhm 21124 pwssplit3 21128 frlmup1 21850 imaslmhm 33543 quslmhm 33545 lmhmqusker 33603 frlmsnic 43158 |
| Copyright terms: Public domain | W3C validator |