Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > m2cpmmhm | Structured version Visualization version GIF version |
Description: The transformation of matrices into constant polynomial matrices is a homomorphism of multiplicative monoids. (Contributed by AV, 18-Nov-2019.) |
Ref | Expression |
---|---|
m2cpm.s | ⊢ 𝑆 = (𝑁 ConstPolyMat 𝑅) |
m2cpm.t | ⊢ 𝑇 = (𝑁 matToPolyMat 𝑅) |
m2cpm.a | ⊢ 𝐴 = (𝑁 Mat 𝑅) |
m2cpm.b | ⊢ 𝐵 = (Base‘𝐴) |
m2cpmghm.p | ⊢ 𝑃 = (Poly1‘𝑅) |
m2cpmghm.c | ⊢ 𝐶 = (𝑁 Mat 𝑃) |
m2cpmghm.u | ⊢ 𝑈 = (𝐶 ↾s 𝑆) |
Ref | Expression |
---|---|
m2cpmmhm | ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing) → 𝑇 ∈ ((mulGrp‘𝐴) MndHom (mulGrp‘𝑈))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | m2cpm.t | . . 3 ⊢ 𝑇 = (𝑁 matToPolyMat 𝑅) | |
2 | m2cpm.a | . . 3 ⊢ 𝐴 = (𝑁 Mat 𝑅) | |
3 | m2cpm.b | . . 3 ⊢ 𝐵 = (Base‘𝐴) | |
4 | m2cpmghm.p | . . 3 ⊢ 𝑃 = (Poly1‘𝑅) | |
5 | m2cpmghm.c | . . 3 ⊢ 𝐶 = (𝑁 Mat 𝑃) | |
6 | eqid 2818 | . . 3 ⊢ (Base‘𝐶) = (Base‘𝐶) | |
7 | 1, 2, 3, 4, 5, 6 | mat2pmatmhm 21269 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing) → 𝑇 ∈ ((mulGrp‘𝐴) MndHom (mulGrp‘𝐶))) |
8 | crngring 19237 | . . . . 5 ⊢ (𝑅 ∈ CRing → 𝑅 ∈ Ring) | |
9 | 8 | anim2i 616 | . . . 4 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing) → (𝑁 ∈ Fin ∧ 𝑅 ∈ Ring)) |
10 | m2cpm.s | . . . . 5 ⊢ 𝑆 = (𝑁 ConstPolyMat 𝑅) | |
11 | 10, 4, 5 | cpmatsrgpmat 21257 | . . . 4 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝑆 ∈ (SubRing‘𝐶)) |
12 | eqid 2818 | . . . . 5 ⊢ (mulGrp‘𝐶) = (mulGrp‘𝐶) | |
13 | 12 | subrgsubm 19477 | . . . 4 ⊢ (𝑆 ∈ (SubRing‘𝐶) → 𝑆 ∈ (SubMnd‘(mulGrp‘𝐶))) |
14 | 9, 11, 13 | 3syl 18 | . . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing) → 𝑆 ∈ (SubMnd‘(mulGrp‘𝐶))) |
15 | 10, 1, 2, 3 | m2cpmf 21278 | . . . 4 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝑇:𝐵⟶𝑆) |
16 | frn 6513 | . . . 4 ⊢ (𝑇:𝐵⟶𝑆 → ran 𝑇 ⊆ 𝑆) | |
17 | 9, 15, 16 | 3syl 18 | . . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing) → ran 𝑇 ⊆ 𝑆) |
18 | 5 | ovexi 7179 | . . . . . 6 ⊢ 𝐶 ∈ V |
19 | 10 | ovexi 7179 | . . . . . 6 ⊢ 𝑆 ∈ V |
20 | m2cpmghm.u | . . . . . . 7 ⊢ 𝑈 = (𝐶 ↾s 𝑆) | |
21 | 20, 12 | mgpress 19179 | . . . . . 6 ⊢ ((𝐶 ∈ V ∧ 𝑆 ∈ V) → ((mulGrp‘𝐶) ↾s 𝑆) = (mulGrp‘𝑈)) |
22 | 18, 19, 21 | mp2an 688 | . . . . 5 ⊢ ((mulGrp‘𝐶) ↾s 𝑆) = (mulGrp‘𝑈) |
23 | 22 | eqcomi 2827 | . . . 4 ⊢ (mulGrp‘𝑈) = ((mulGrp‘𝐶) ↾s 𝑆) |
24 | 23 | resmhm2b 17975 | . . 3 ⊢ ((𝑆 ∈ (SubMnd‘(mulGrp‘𝐶)) ∧ ran 𝑇 ⊆ 𝑆) → (𝑇 ∈ ((mulGrp‘𝐴) MndHom (mulGrp‘𝐶)) ↔ 𝑇 ∈ ((mulGrp‘𝐴) MndHom (mulGrp‘𝑈)))) |
25 | 14, 17, 24 | syl2anc 584 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing) → (𝑇 ∈ ((mulGrp‘𝐴) MndHom (mulGrp‘𝐶)) ↔ 𝑇 ∈ ((mulGrp‘𝐴) MndHom (mulGrp‘𝑈)))) |
26 | 7, 25 | mpbid 233 | 1 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing) → 𝑇 ∈ ((mulGrp‘𝐴) MndHom (mulGrp‘𝑈))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1528 ∈ wcel 2105 Vcvv 3492 ⊆ wss 3933 ran crn 5549 ⟶wf 6344 ‘cfv 6348 (class class class)co 7145 Fincfn 8497 Basecbs 16471 ↾s cress 16472 MndHom cmhm 17942 SubMndcsubmnd 17943 mulGrpcmgp 19168 Ringcrg 19226 CRingccrg 19227 SubRingcsubrg 19460 Poly1cpl1 20273 Mat cmat 20944 ConstPolyMat ccpmat 21239 matToPolyMat cmat2pmat 21240 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-rep 5181 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-cnex 10581 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 ax-pre-mulgt0 10602 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-fal 1541 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rmo 3143 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-ot 4566 df-uni 4831 df-int 4868 df-iun 4912 df-iin 4913 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-se 5508 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-isom 6357 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-of 7398 df-ofr 7399 df-om 7570 df-1st 7678 df-2nd 7679 df-supp 7820 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-1o 8091 df-2o 8092 df-oadd 8095 df-er 8278 df-map 8397 df-pm 8398 df-ixp 8450 df-en 8498 df-dom 8499 df-sdom 8500 df-fin 8501 df-fsupp 8822 df-sup 8894 df-oi 8962 df-card 9356 df-pnf 10665 df-mnf 10666 df-xr 10667 df-ltxr 10668 df-le 10669 df-sub 10860 df-neg 10861 df-nn 11627 df-2 11688 df-3 11689 df-4 11690 df-5 11691 df-6 11692 df-7 11693 df-8 11694 df-9 11695 df-n0 11886 df-z 11970 df-dec 12087 df-uz 12232 df-fz 12881 df-fzo 13022 df-seq 13358 df-hash 13679 df-struct 16473 df-ndx 16474 df-slot 16475 df-base 16477 df-sets 16478 df-ress 16479 df-plusg 16566 df-mulr 16567 df-sca 16569 df-vsca 16570 df-ip 16571 df-tset 16572 df-ple 16573 df-ds 16575 df-hom 16577 df-cco 16578 df-0g 16703 df-gsum 16704 df-prds 16709 df-pws 16711 df-mre 16845 df-mrc 16846 df-acs 16848 df-mgm 17840 df-sgrp 17889 df-mnd 17900 df-mhm 17944 df-submnd 17945 df-grp 18044 df-minusg 18045 df-sbg 18046 df-mulg 18163 df-subg 18214 df-ghm 18294 df-cntz 18385 df-cmn 18837 df-abl 18838 df-mgp 19169 df-ur 19181 df-srg 19185 df-ring 19228 df-cring 19229 df-rnghom 19396 df-subrg 19462 df-lmod 19565 df-lss 19633 df-sra 19873 df-rgmod 19874 df-assa 20013 df-ascl 20015 df-psr 20064 df-mvr 20065 df-mpl 20066 df-opsr 20068 df-psr1 20276 df-vr1 20277 df-ply1 20278 df-coe1 20279 df-dsmm 20804 df-frlm 20819 df-mamu 20923 df-mat 20945 df-cpmat 21242 df-mat2pmat 21243 |
This theorem is referenced by: m2cpmrhm 21282 |
Copyright terms: Public domain | W3C validator |