| 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 3180 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑋 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦))) |
| 7 | 3, 4, 6 | 3jca 1129 | . 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 21022 | . 2 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) ↔ ((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐽 = 𝐾 ∧ ∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑋 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦))))) |
| 15 | 1, 2, 7, 14 | syl21anbrc 1346 | 1 ⊢ (𝜑 → 𝐹 ∈ (𝑆 LMHom 𝑇)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ∀wral 3051 ‘cfv 6498 (class class class)co 7367 Basecbs 17179 Scalarcsca 17223 ·𝑠 cvsca 17224 GrpHom cghm 19187 LModclmod 20855 LMHom clmhm 21014 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pr 5375 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-rab 3390 df-v 3431 df-sbc 3729 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-br 5086 df-opab 5148 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-iota 6454 df-fun 6500 df-fv 6506 df-ov 7370 df-oprab 7371 df-mpo 7372 df-lmhm 21017 |
| This theorem is referenced by: 0lmhm 21035 idlmhm 21036 invlmhm 21037 lmhmco 21038 lmhmplusg 21039 lmhmvsca 21040 lmhmf1o 21041 reslmhm2 21048 reslmhm2b 21049 pwsdiaglmhm 21052 pwssplit3 21056 frlmup1 21778 imaslmhm 33417 quslmhm 33419 lmhmqusker 33477 frlmsnic 42985 |
| Copyright terms: Public domain | W3C validator |