| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > scmatmats | Structured version Visualization version GIF version | ||
| Description: The set of an 𝑁 x 𝑁 scalar matrices over the ring 𝑅 expressed as a subset of 𝑁 x 𝑁 matrices over the ring 𝑅 with certain properties for their entries. (Contributed by AV, 31-Oct-2019.) (Revised by AV, 19-Dec-2019.) |
| Ref | Expression |
|---|---|
| scmatmat.a | ⊢ 𝐴 = (𝑁 Mat 𝑅) |
| scmatmat.b | ⊢ 𝐵 = (Base‘𝐴) |
| scmatmat.s | ⊢ 𝑆 = (𝑁 ScMat 𝑅) |
| scmate.k | ⊢ 𝐾 = (Base‘𝑅) |
| scmate.0 | ⊢ 0 = (0g‘𝑅) |
| Ref | Expression |
|---|---|
| scmatmats | ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝑆 = {𝑚 ∈ 𝐵 ∣ ∃𝑐 ∈ 𝐾 ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑚𝑗) = if(𝑖 = 𝑗, 𝑐, 0 )}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | scmate.k | . . 3 ⊢ 𝐾 = (Base‘𝑅) | |
| 2 | scmatmat.a | . . 3 ⊢ 𝐴 = (𝑁 Mat 𝑅) | |
| 3 | scmatmat.b | . . 3 ⊢ 𝐵 = (Base‘𝐴) | |
| 4 | eqid 2730 | . . 3 ⊢ (1r‘𝐴) = (1r‘𝐴) | |
| 5 | eqid 2730 | . . 3 ⊢ ( ·𝑠 ‘𝐴) = ( ·𝑠 ‘𝐴) | |
| 6 | scmatmat.s | . . 3 ⊢ 𝑆 = (𝑁 ScMat 𝑅) | |
| 7 | 1, 2, 3, 4, 5, 6 | scmatval 22412 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝑆 = {𝑚 ∈ 𝐵 ∣ ∃𝑐 ∈ 𝐾 𝑚 = (𝑐( ·𝑠 ‘𝐴)(1r‘𝐴))}) |
| 8 | simpr 484 | . . . . . . 7 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) → 𝑚 ∈ 𝐵) | |
| 9 | 8 | adantr 480 | . . . . . 6 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) ∧ 𝑐 ∈ 𝐾) → 𝑚 ∈ 𝐵) |
| 10 | simpll 766 | . . . . . . 7 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) ∧ 𝑐 ∈ 𝐾) → (𝑁 ∈ Fin ∧ 𝑅 ∈ Ring)) | |
| 11 | 2 | matring 22351 | . . . . . . . . . 10 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝐴 ∈ Ring) |
| 12 | 3, 4 | ringidcl 20176 | . . . . . . . . . 10 ⊢ (𝐴 ∈ Ring → (1r‘𝐴) ∈ 𝐵) |
| 13 | 11, 12 | syl 17 | . . . . . . . . 9 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (1r‘𝐴) ∈ 𝐵) |
| 14 | 13 | adantr 480 | . . . . . . . 8 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) → (1r‘𝐴) ∈ 𝐵) |
| 15 | 14 | anim1ci 616 | . . . . . . 7 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) ∧ 𝑐 ∈ 𝐾) → (𝑐 ∈ 𝐾 ∧ (1r‘𝐴) ∈ 𝐵)) |
| 16 | 1, 2, 3, 5 | matvscl 22339 | . . . . . . 7 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑐 ∈ 𝐾 ∧ (1r‘𝐴) ∈ 𝐵)) → (𝑐( ·𝑠 ‘𝐴)(1r‘𝐴)) ∈ 𝐵) |
| 17 | 10, 15, 16 | syl2anc 584 | . . . . . 6 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) ∧ 𝑐 ∈ 𝐾) → (𝑐( ·𝑠 ‘𝐴)(1r‘𝐴)) ∈ 𝐵) |
| 18 | 2, 3 | eqmat 22332 | . . . . . 6 ⊢ ((𝑚 ∈ 𝐵 ∧ (𝑐( ·𝑠 ‘𝐴)(1r‘𝐴)) ∈ 𝐵) → (𝑚 = (𝑐( ·𝑠 ‘𝐴)(1r‘𝐴)) ↔ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑚𝑗) = (𝑖(𝑐( ·𝑠 ‘𝐴)(1r‘𝐴))𝑗))) |
| 19 | 9, 17, 18 | syl2anc 584 | . . . . 5 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) ∧ 𝑐 ∈ 𝐾) → (𝑚 = (𝑐( ·𝑠 ‘𝐴)(1r‘𝐴)) ↔ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑚𝑗) = (𝑖(𝑐( ·𝑠 ‘𝐴)(1r‘𝐴))𝑗))) |
| 20 | simplll 774 | . . . . . . . . 9 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) ∧ 𝑐 ∈ 𝐾) → 𝑁 ∈ Fin) | |
| 21 | simpllr 775 | . . . . . . . . 9 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) ∧ 𝑐 ∈ 𝐾) → 𝑅 ∈ Ring) | |
| 22 | simpr 484 | . . . . . . . . 9 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) ∧ 𝑐 ∈ 𝐾) → 𝑐 ∈ 𝐾) | |
| 23 | 20, 21, 22 | 3jca 1128 | . . . . . . . 8 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) ∧ 𝑐 ∈ 𝐾) → (𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑐 ∈ 𝐾)) |
| 24 | scmate.0 | . . . . . . . . 9 ⊢ 0 = (0g‘𝑅) | |
| 25 | 2, 1, 24, 4, 5 | scmatscmide 22415 | . . . . . . . 8 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑐 ∈ 𝐾) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (𝑖(𝑐( ·𝑠 ‘𝐴)(1r‘𝐴))𝑗) = if(𝑖 = 𝑗, 𝑐, 0 )) |
| 26 | 23, 25 | sylan 580 | . . . . . . 7 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) ∧ 𝑐 ∈ 𝐾) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (𝑖(𝑐( ·𝑠 ‘𝐴)(1r‘𝐴))𝑗) = if(𝑖 = 𝑗, 𝑐, 0 )) |
| 27 | 26 | eqeq2d 2741 | . . . . . 6 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) ∧ 𝑐 ∈ 𝐾) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → ((𝑖𝑚𝑗) = (𝑖(𝑐( ·𝑠 ‘𝐴)(1r‘𝐴))𝑗) ↔ (𝑖𝑚𝑗) = if(𝑖 = 𝑗, 𝑐, 0 ))) |
| 28 | 27 | 2ralbidva 3192 | . . . . 5 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) ∧ 𝑐 ∈ 𝐾) → (∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑚𝑗) = (𝑖(𝑐( ·𝑠 ‘𝐴)(1r‘𝐴))𝑗) ↔ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑚𝑗) = if(𝑖 = 𝑗, 𝑐, 0 ))) |
| 29 | 19, 28 | bitrd 279 | . . . 4 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) ∧ 𝑐 ∈ 𝐾) → (𝑚 = (𝑐( ·𝑠 ‘𝐴)(1r‘𝐴)) ↔ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑚𝑗) = if(𝑖 = 𝑗, 𝑐, 0 ))) |
| 30 | 29 | rexbidva 3152 | . . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) → (∃𝑐 ∈ 𝐾 𝑚 = (𝑐( ·𝑠 ‘𝐴)(1r‘𝐴)) ↔ ∃𝑐 ∈ 𝐾 ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑚𝑗) = if(𝑖 = 𝑗, 𝑐, 0 ))) |
| 31 | 30 | rabbidva 3399 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → {𝑚 ∈ 𝐵 ∣ ∃𝑐 ∈ 𝐾 𝑚 = (𝑐( ·𝑠 ‘𝐴)(1r‘𝐴))} = {𝑚 ∈ 𝐵 ∣ ∃𝑐 ∈ 𝐾 ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑚𝑗) = if(𝑖 = 𝑗, 𝑐, 0 )}) |
| 32 | 7, 31 | eqtrd 2765 | 1 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝑆 = {𝑚 ∈ 𝐵 ∣ ∃𝑐 ∈ 𝐾 ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑚𝑗) = if(𝑖 = 𝑗, 𝑐, 0 )}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2110 ∀wral 3045 ∃wrex 3054 {crab 3393 ifcif 4473 ‘cfv 6477 (class class class)co 7341 Fincfn 8864 Basecbs 17112 ·𝑠 cvsca 17157 0gc0g 17335 1rcur 20092 Ringcrg 20144 Mat cmat 22315 ScMat cscmat 22397 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2112 ax-9 2120 ax-10 2143 ax-11 2159 ax-12 2179 ax-ext 2702 ax-rep 5215 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7663 ax-cnex 11054 ax-resscn 11055 ax-1cn 11056 ax-icn 11057 ax-addcl 11058 ax-addrcl 11059 ax-mulcl 11060 ax-mulrcl 11061 ax-mulcom 11062 ax-addass 11063 ax-mulass 11064 ax-distr 11065 ax-i2m1 11066 ax-1ne0 11067 ax-1rid 11068 ax-rnegex 11069 ax-rrecex 11070 ax-cnre 11071 ax-pre-lttri 11072 ax-pre-lttrn 11073 ax-pre-ltadd 11074 ax-pre-mulgt0 11075 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-rmo 3344 df-reu 3345 df-rab 3394 df-v 3436 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-pss 3920 df-nul 4282 df-if 4474 df-pw 4550 df-sn 4575 df-pr 4577 df-tp 4579 df-op 4581 df-ot 4583 df-uni 4858 df-int 4896 df-iun 4941 df-iin 4942 df-br 5090 df-opab 5152 df-mpt 5171 df-tr 5197 df-id 5509 df-eprel 5514 df-po 5522 df-so 5523 df-fr 5567 df-se 5568 df-we 5569 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-pred 6244 df-ord 6305 df-on 6306 df-lim 6307 df-suc 6308 df-iota 6433 df-fun 6479 df-fn 6480 df-f 6481 df-f1 6482 df-fo 6483 df-f1o 6484 df-fv 6485 df-isom 6486 df-riota 7298 df-ov 7344 df-oprab 7345 df-mpo 7346 df-of 7605 df-om 7792 df-1st 7916 df-2nd 7917 df-supp 8086 df-frecs 8206 df-wrecs 8237 df-recs 8286 df-rdg 8324 df-1o 8380 df-2o 8381 df-er 8617 df-map 8747 df-ixp 8817 df-en 8865 df-dom 8866 df-sdom 8867 df-fin 8868 df-fsupp 9241 df-sup 9321 df-oi 9391 df-card 9824 df-pnf 11140 df-mnf 11141 df-xr 11142 df-ltxr 11143 df-le 11144 df-sub 11338 df-neg 11339 df-nn 12118 df-2 12180 df-3 12181 df-4 12182 df-5 12183 df-6 12184 df-7 12185 df-8 12186 df-9 12187 df-n0 12374 df-z 12461 df-dec 12581 df-uz 12725 df-fz 13400 df-fzo 13547 df-seq 13901 df-hash 14230 df-struct 17050 df-sets 17067 df-slot 17085 df-ndx 17097 df-base 17113 df-ress 17134 df-plusg 17166 df-mulr 17167 df-sca 17169 df-vsca 17170 df-ip 17171 df-tset 17172 df-ple 17173 df-ds 17175 df-hom 17177 df-cco 17178 df-0g 17337 df-gsum 17338 df-prds 17343 df-pws 17345 df-mre 17480 df-mrc 17481 df-acs 17483 df-mgm 18540 df-sgrp 18619 df-mnd 18635 df-mhm 18683 df-submnd 18684 df-grp 18841 df-minusg 18842 df-sbg 18843 df-mulg 18973 df-subg 19028 df-ghm 19118 df-cntz 19222 df-cmn 19687 df-abl 19688 df-mgp 20052 df-rng 20064 df-ur 20093 df-ring 20146 df-subrg 20478 df-lmod 20788 df-lss 20858 df-sra 21100 df-rgmod 21101 df-dsmm 21662 df-frlm 21677 df-mamu 22299 df-mat 22316 df-scmat 22399 |
| This theorem is referenced by: scmateALT 22420 scmatdmat 22423 |
| Copyright terms: Public domain | W3C validator |