![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > 0lmhm | Structured version Visualization version GIF version |
Description: The constant zero linear function between two modules. (Contributed by Stefan O'Rear, 5-Sep-2015.) |
Ref | Expression |
---|---|
0lmhm.z | ⊢ 0 = (0g‘𝑁) |
0lmhm.b | ⊢ 𝐵 = (Base‘𝑀) |
0lmhm.s | ⊢ 𝑆 = (Scalar‘𝑀) |
0lmhm.t | ⊢ 𝑇 = (Scalar‘𝑁) |
Ref | Expression |
---|---|
0lmhm | ⊢ ((𝑀 ∈ LMod ∧ 𝑁 ∈ LMod ∧ 𝑆 = 𝑇) → (𝐵 × { 0 }) ∈ (𝑀 LMHom 𝑁)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0lmhm.b | . 2 ⊢ 𝐵 = (Base‘𝑀) | |
2 | eqid 2734 | . 2 ⊢ ( ·𝑠 ‘𝑀) = ( ·𝑠 ‘𝑀) | |
3 | eqid 2734 | . 2 ⊢ ( ·𝑠 ‘𝑁) = ( ·𝑠 ‘𝑁) | |
4 | 0lmhm.s | . 2 ⊢ 𝑆 = (Scalar‘𝑀) | |
5 | 0lmhm.t | . 2 ⊢ 𝑇 = (Scalar‘𝑁) | |
6 | eqid 2734 | . 2 ⊢ (Base‘𝑆) = (Base‘𝑆) | |
7 | simp1 1135 | . 2 ⊢ ((𝑀 ∈ LMod ∧ 𝑁 ∈ LMod ∧ 𝑆 = 𝑇) → 𝑀 ∈ LMod) | |
8 | simp2 1136 | . 2 ⊢ ((𝑀 ∈ LMod ∧ 𝑁 ∈ LMod ∧ 𝑆 = 𝑇) → 𝑁 ∈ LMod) | |
9 | simp3 1137 | . . 3 ⊢ ((𝑀 ∈ LMod ∧ 𝑁 ∈ LMod ∧ 𝑆 = 𝑇) → 𝑆 = 𝑇) | |
10 | 9 | eqcomd 2740 | . 2 ⊢ ((𝑀 ∈ LMod ∧ 𝑁 ∈ LMod ∧ 𝑆 = 𝑇) → 𝑇 = 𝑆) |
11 | lmodgrp 20881 | . . . 4 ⊢ (𝑀 ∈ LMod → 𝑀 ∈ Grp) | |
12 | lmodgrp 20881 | . . . 4 ⊢ (𝑁 ∈ LMod → 𝑁 ∈ Grp) | |
13 | 0lmhm.z | . . . . 5 ⊢ 0 = (0g‘𝑁) | |
14 | 13, 1 | 0ghm 19260 | . . . 4 ⊢ ((𝑀 ∈ Grp ∧ 𝑁 ∈ Grp) → (𝐵 × { 0 }) ∈ (𝑀 GrpHom 𝑁)) |
15 | 11, 12, 14 | syl2an 596 | . . 3 ⊢ ((𝑀 ∈ LMod ∧ 𝑁 ∈ LMod) → (𝐵 × { 0 }) ∈ (𝑀 GrpHom 𝑁)) |
16 | 15 | 3adant3 1131 | . 2 ⊢ ((𝑀 ∈ LMod ∧ 𝑁 ∈ LMod ∧ 𝑆 = 𝑇) → (𝐵 × { 0 }) ∈ (𝑀 GrpHom 𝑁)) |
17 | simpl2 1191 | . . . 4 ⊢ (((𝑀 ∈ LMod ∧ 𝑁 ∈ LMod ∧ 𝑆 = 𝑇) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ 𝐵)) → 𝑁 ∈ LMod) | |
18 | simprl 771 | . . . . 5 ⊢ (((𝑀 ∈ LMod ∧ 𝑁 ∈ LMod ∧ 𝑆 = 𝑇) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ 𝐵)) → 𝑥 ∈ (Base‘𝑆)) | |
19 | simpl3 1192 | . . . . . 6 ⊢ (((𝑀 ∈ LMod ∧ 𝑁 ∈ LMod ∧ 𝑆 = 𝑇) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ 𝐵)) → 𝑆 = 𝑇) | |
20 | 19 | fveq2d 6910 | . . . . 5 ⊢ (((𝑀 ∈ LMod ∧ 𝑁 ∈ LMod ∧ 𝑆 = 𝑇) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ 𝐵)) → (Base‘𝑆) = (Base‘𝑇)) |
21 | 18, 20 | eleqtrd 2840 | . . . 4 ⊢ (((𝑀 ∈ LMod ∧ 𝑁 ∈ LMod ∧ 𝑆 = 𝑇) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ 𝐵)) → 𝑥 ∈ (Base‘𝑇)) |
22 | eqid 2734 | . . . . 5 ⊢ (Base‘𝑇) = (Base‘𝑇) | |
23 | 5, 3, 22, 13 | lmodvs0 20910 | . . . 4 ⊢ ((𝑁 ∈ LMod ∧ 𝑥 ∈ (Base‘𝑇)) → (𝑥( ·𝑠 ‘𝑁) 0 ) = 0 ) |
24 | 17, 21, 23 | syl2anc 584 | . . 3 ⊢ (((𝑀 ∈ LMod ∧ 𝑁 ∈ LMod ∧ 𝑆 = 𝑇) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ 𝐵)) → (𝑥( ·𝑠 ‘𝑁) 0 ) = 0 ) |
25 | 13 | fvexi 6920 | . . . . . 6 ⊢ 0 ∈ V |
26 | 25 | fvconst2 7223 | . . . . 5 ⊢ (𝑦 ∈ 𝐵 → ((𝐵 × { 0 })‘𝑦) = 0 ) |
27 | 26 | oveq2d 7446 | . . . 4 ⊢ (𝑦 ∈ 𝐵 → (𝑥( ·𝑠 ‘𝑁)((𝐵 × { 0 })‘𝑦)) = (𝑥( ·𝑠 ‘𝑁) 0 )) |
28 | 27 | ad2antll 729 | . . 3 ⊢ (((𝑀 ∈ LMod ∧ 𝑁 ∈ LMod ∧ 𝑆 = 𝑇) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ 𝐵)) → (𝑥( ·𝑠 ‘𝑁)((𝐵 × { 0 })‘𝑦)) = (𝑥( ·𝑠 ‘𝑁) 0 )) |
29 | simpl1 1190 | . . . . 5 ⊢ (((𝑀 ∈ LMod ∧ 𝑁 ∈ LMod ∧ 𝑆 = 𝑇) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ 𝐵)) → 𝑀 ∈ LMod) | |
30 | simprr 773 | . . . . 5 ⊢ (((𝑀 ∈ LMod ∧ 𝑁 ∈ LMod ∧ 𝑆 = 𝑇) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ 𝐵)) → 𝑦 ∈ 𝐵) | |
31 | 1, 4, 2, 6 | lmodvscl 20892 | . . . . 5 ⊢ ((𝑀 ∈ LMod ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ 𝐵) → (𝑥( ·𝑠 ‘𝑀)𝑦) ∈ 𝐵) |
32 | 29, 18, 30, 31 | syl3anc 1370 | . . . 4 ⊢ (((𝑀 ∈ LMod ∧ 𝑁 ∈ LMod ∧ 𝑆 = 𝑇) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ 𝐵)) → (𝑥( ·𝑠 ‘𝑀)𝑦) ∈ 𝐵) |
33 | 25 | fvconst2 7223 | . . . 4 ⊢ ((𝑥( ·𝑠 ‘𝑀)𝑦) ∈ 𝐵 → ((𝐵 × { 0 })‘(𝑥( ·𝑠 ‘𝑀)𝑦)) = 0 ) |
34 | 32, 33 | syl 17 | . . 3 ⊢ (((𝑀 ∈ LMod ∧ 𝑁 ∈ LMod ∧ 𝑆 = 𝑇) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ 𝐵)) → ((𝐵 × { 0 })‘(𝑥( ·𝑠 ‘𝑀)𝑦)) = 0 ) |
35 | 24, 28, 34 | 3eqtr4rd 2785 | . 2 ⊢ (((𝑀 ∈ LMod ∧ 𝑁 ∈ LMod ∧ 𝑆 = 𝑇) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ 𝐵)) → ((𝐵 × { 0 })‘(𝑥( ·𝑠 ‘𝑀)𝑦)) = (𝑥( ·𝑠 ‘𝑁)((𝐵 × { 0 })‘𝑦))) |
36 | 1, 2, 3, 4, 5, 6, 7, 8, 10, 16, 35 | islmhmd 21055 | 1 ⊢ ((𝑀 ∈ LMod ∧ 𝑁 ∈ LMod ∧ 𝑆 = 𝑇) → (𝐵 × { 0 }) ∈ (𝑀 LMHom 𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1536 ∈ wcel 2105 {csn 4630 × cxp 5686 ‘cfv 6562 (class class class)co 7430 Basecbs 17244 Scalarcsca 17300 ·𝑠 cvsca 17301 0gc0g 17485 Grpcgrp 18963 GrpHom cghm 19242 LModclmod 20874 LMHom clmhm 21035 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1791 ax-4 1805 ax-5 1907 ax-6 1964 ax-7 2004 ax-8 2107 ax-9 2115 ax-10 2138 ax-11 2154 ax-12 2174 ax-ext 2705 ax-sep 5301 ax-nul 5311 ax-pow 5370 ax-pr 5437 ax-un 7753 ax-cnex 11208 ax-resscn 11209 ax-1cn 11210 ax-icn 11211 ax-addcl 11212 ax-addrcl 11213 ax-mulcl 11214 ax-mulrcl 11215 ax-mulcom 11216 ax-addass 11217 ax-mulass 11218 ax-distr 11219 ax-i2m1 11220 ax-1ne0 11221 ax-1rid 11222 ax-rnegex 11223 ax-rrecex 11224 ax-cnre 11225 ax-pre-lttri 11226 ax-pre-lttrn 11227 ax-pre-ltadd 11228 ax-pre-mulgt0 11229 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1539 df-fal 1549 df-ex 1776 df-nf 1780 df-sb 2062 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2726 df-clel 2813 df-nfc 2889 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-rmo 3377 df-reu 3378 df-rab 3433 df-v 3479 df-sbc 3791 df-csb 3908 df-dif 3965 df-un 3967 df-in 3969 df-ss 3979 df-pss 3982 df-nul 4339 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4912 df-iun 4997 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5582 df-eprel 5588 df-po 5596 df-so 5597 df-fr 5640 df-we 5642 df-xp 5694 df-rel 5695 df-cnv 5696 df-co 5697 df-dm 5698 df-rn 5699 df-res 5700 df-ima 5701 df-pred 6322 df-ord 6388 df-on 6389 df-lim 6390 df-suc 6391 df-iota 6515 df-fun 6564 df-fn 6565 df-f 6566 df-f1 6567 df-fo 6568 df-f1o 6569 df-fv 6570 df-riota 7387 df-ov 7433 df-oprab 7434 df-mpo 7435 df-om 7887 df-1st 8012 df-2nd 8013 df-frecs 8304 df-wrecs 8335 df-recs 8409 df-rdg 8448 df-er 8743 df-map 8866 df-en 8984 df-dom 8985 df-sdom 8986 df-pnf 11294 df-mnf 11295 df-xr 11296 df-ltxr 11297 df-le 11298 df-sub 11491 df-neg 11492 df-nn 12264 df-2 12326 df-sets 17197 df-slot 17215 df-ndx 17227 df-base 17245 df-plusg 17310 df-0g 17487 df-mgm 18665 df-sgrp 18744 df-mnd 18760 df-mhm 18808 df-grp 18966 df-minusg 18967 df-ghm 19243 df-cmn 19814 df-abl 19815 df-mgp 20152 df-rng 20170 df-ur 20199 df-ring 20252 df-lmod 20876 df-lmhm 21038 |
This theorem is referenced by: 0nmhm 24791 mendring 43176 |
Copyright terms: Public domain | W3C validator |