| 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 3210 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑋 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦))) |
| 7 | 3, 4, 6 | 3jca 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 ⊢ × = ( ·𝑠 ‘𝑇) | |
| 14 | 8, 9, 10, 11, 12, 13 | islmhm 21200 | . 2 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) ↔ ((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐽 = 𝐾 ∧ ∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑋 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦))))) |
| 15 | 1, 2, 7, 14 | syl21anbrc 1363 | 1 ⊢ (𝜑 → 𝐹 ∈ (𝑆 LMHom 𝑇)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ∀wral 3081 ‘cfv 6540 (class class class)co 7419 Basecbs 17293 Scalarcsca 17337 ·𝑠 cvsca 17338 GrpHom cghm 19329 LModclmod 21033 LMHom clmhm 21192 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pr 5406 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-sbc 3747 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-iota 6496 df-fun 6542 df-fv 6548 df-ov 7422 df-oprab 7423 df-mpo 7424 df-lmhm 21195 |
| This theorem is used by: 0lmhm 21213 idlmhm 21214 invlmhm 21215 lmhmco 21216 lmhmplusg 21217 lmhmvsca 21218 lmhmf1o 21219 reslmhm2 21226 reslmhm2b 21227 pwsdiaglmhm 21230 pwssplit3 21234 frlmup1 22000 imaslmhm 33743 quslmhm 33745 lmhmqusker 33792 frlmsnic 43368 |
| Copyright terms: Public domain | W3C validator |