![]() |
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 3208 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑋 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦))) |
7 | 3, 4, 6 | 3jca 1128 | . 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 21049 | . 2 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) ↔ ((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐽 = 𝐾 ∧ ∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑋 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦))))) |
15 | 1, 2, 7, 14 | syl21anbrc 1344 | 1 ⊢ (𝜑 → 𝐹 ∈ (𝑆 LMHom 𝑇)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1537 ∈ wcel 2108 ∀wral 3067 ‘cfv 6573 (class class class)co 7448 Basecbs 17258 Scalarcsca 17314 ·𝑠 cvsca 17315 GrpHom cghm 19252 LModclmod 20880 LMHom clmhm 21041 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pr 5447 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-rab 3444 df-v 3490 df-sbc 3805 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-br 5167 df-opab 5229 df-id 5593 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-iota 6525 df-fun 6575 df-fv 6581 df-ov 7451 df-oprab 7452 df-mpo 7453 df-lmhm 21044 |
This theorem is referenced by: 0lmhm 21062 idlmhm 21063 invlmhm 21064 lmhmco 21065 lmhmplusg 21066 lmhmvsca 21067 lmhmf1o 21068 reslmhm2 21075 reslmhm2b 21076 pwsdiaglmhm 21079 pwssplit3 21083 frlmup1 21841 imaslmhm 33350 quslmhm 33352 lmhmqusker 33410 frlmsnic 42495 |
Copyright terms: Public domain | W3C validator |