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 2739 | . . 3 ⊢ (1r‘𝐴) = (1r‘𝐴) | |
5 | eqid 2739 | . . 3 ⊢ ( ·𝑠 ‘𝐴) = ( ·𝑠 ‘𝐴) | |
6 | scmatmat.s | . . 3 ⊢ 𝑆 = (𝑁 ScMat 𝑅) | |
7 | 1, 2, 3, 4, 5, 6 | scmatval 21267 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝑆 = {𝑚 ∈ 𝐵 ∣ ∃𝑐 ∈ 𝐾 𝑚 = (𝑐( ·𝑠 ‘𝐴)(1r‘𝐴))}) |
8 | simpr 488 | . . . . . . 7 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) → 𝑚 ∈ 𝐵) | |
9 | 8 | adantr 484 | . . . . . 6 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) ∧ 𝑐 ∈ 𝐾) → 𝑚 ∈ 𝐵) |
10 | simpll 767 | . . . . . . 7 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) ∧ 𝑐 ∈ 𝐾) → (𝑁 ∈ Fin ∧ 𝑅 ∈ Ring)) | |
11 | 2 | matring 21206 | . . . . . . . . . 10 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝐴 ∈ Ring) |
12 | 3, 4 | ringidcl 19452 | . . . . . . . . . 10 ⊢ (𝐴 ∈ Ring → (1r‘𝐴) ∈ 𝐵) |
13 | 11, 12 | syl 17 | . . . . . . . . 9 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (1r‘𝐴) ∈ 𝐵) |
14 | 13 | adantr 484 | . . . . . . . 8 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) → (1r‘𝐴) ∈ 𝐵) |
15 | 14 | anim1ci 619 | . . . . . . 7 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) ∧ 𝑐 ∈ 𝐾) → (𝑐 ∈ 𝐾 ∧ (1r‘𝐴) ∈ 𝐵)) |
16 | 1, 2, 3, 5 | matvscl 21194 | . . . . . . 7 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑐 ∈ 𝐾 ∧ (1r‘𝐴) ∈ 𝐵)) → (𝑐( ·𝑠 ‘𝐴)(1r‘𝐴)) ∈ 𝐵) |
17 | 10, 15, 16 | syl2anc 587 | . . . . . 6 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) ∧ 𝑐 ∈ 𝐾) → (𝑐( ·𝑠 ‘𝐴)(1r‘𝐴)) ∈ 𝐵) |
18 | 2, 3 | eqmat 21187 | . . . . . 6 ⊢ ((𝑚 ∈ 𝐵 ∧ (𝑐( ·𝑠 ‘𝐴)(1r‘𝐴)) ∈ 𝐵) → (𝑚 = (𝑐( ·𝑠 ‘𝐴)(1r‘𝐴)) ↔ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑚𝑗) = (𝑖(𝑐( ·𝑠 ‘𝐴)(1r‘𝐴))𝑗))) |
19 | 9, 17, 18 | syl2anc 587 | . . . . 5 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) ∧ 𝑐 ∈ 𝐾) → (𝑚 = (𝑐( ·𝑠 ‘𝐴)(1r‘𝐴)) ↔ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑚𝑗) = (𝑖(𝑐( ·𝑠 ‘𝐴)(1r‘𝐴))𝑗))) |
20 | simplll 775 | . . . . . . . . 9 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) ∧ 𝑐 ∈ 𝐾) → 𝑁 ∈ Fin) | |
21 | simpllr 776 | . . . . . . . . 9 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) ∧ 𝑐 ∈ 𝐾) → 𝑅 ∈ Ring) | |
22 | simpr 488 | . . . . . . . . 9 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) ∧ 𝑐 ∈ 𝐾) → 𝑐 ∈ 𝐾) | |
23 | 20, 21, 22 | 3jca 1129 | . . . . . . . 8 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) ∧ 𝑐 ∈ 𝐾) → (𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑐 ∈ 𝐾)) |
24 | scmate.0 | . . . . . . . . 9 ⊢ 0 = (0g‘𝑅) | |
25 | 2, 1, 24, 4, 5 | scmatscmide 21270 | . . . . . . . 8 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑐 ∈ 𝐾) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (𝑖(𝑐( ·𝑠 ‘𝐴)(1r‘𝐴))𝑗) = if(𝑖 = 𝑗, 𝑐, 0 )) |
26 | 23, 25 | sylan 583 | . . . . . . 7 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) ∧ 𝑐 ∈ 𝐾) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (𝑖(𝑐( ·𝑠 ‘𝐴)(1r‘𝐴))𝑗) = if(𝑖 = 𝑗, 𝑐, 0 )) |
27 | 26 | eqeq2d 2750 | . . . . . 6 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) ∧ 𝑐 ∈ 𝐾) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → ((𝑖𝑚𝑗) = (𝑖(𝑐( ·𝑠 ‘𝐴)(1r‘𝐴))𝑗) ↔ (𝑖𝑚𝑗) = if(𝑖 = 𝑗, 𝑐, 0 ))) |
28 | 27 | 2ralbidva 3111 | . . . . 5 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) ∧ 𝑐 ∈ 𝐾) → (∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑚𝑗) = (𝑖(𝑐( ·𝑠 ‘𝐴)(1r‘𝐴))𝑗) ↔ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑚𝑗) = if(𝑖 = 𝑗, 𝑐, 0 ))) |
29 | 19, 28 | bitrd 282 | . . . 4 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) ∧ 𝑐 ∈ 𝐾) → (𝑚 = (𝑐( ·𝑠 ‘𝐴)(1r‘𝐴)) ↔ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑚𝑗) = if(𝑖 = 𝑗, 𝑐, 0 ))) |
30 | 29 | rexbidva 3207 | . . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑚 ∈ 𝐵) → (∃𝑐 ∈ 𝐾 𝑚 = (𝑐( ·𝑠 ‘𝐴)(1r‘𝐴)) ↔ ∃𝑐 ∈ 𝐾 ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑚𝑗) = if(𝑖 = 𝑗, 𝑐, 0 ))) |
31 | 30 | rabbidva 3380 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → {𝑚 ∈ 𝐵 ∣ ∃𝑐 ∈ 𝐾 𝑚 = (𝑐( ·𝑠 ‘𝐴)(1r‘𝐴))} = {𝑚 ∈ 𝐵 ∣ ∃𝑐 ∈ 𝐾 ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑚𝑗) = if(𝑖 = 𝑗, 𝑐, 0 )}) |
32 | 7, 31 | eqtrd 2774 | 1 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝑆 = {𝑚 ∈ 𝐵 ∣ ∃𝑐 ∈ 𝐾 ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑚𝑗) = if(𝑖 = 𝑗, 𝑐, 0 )}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∧ w3a 1088 = wceq 1542 ∈ wcel 2114 ∀wral 3054 ∃wrex 3055 {crab 3058 ifcif 4424 ‘cfv 6349 (class class class)co 7182 Fincfn 8567 Basecbs 16598 ·𝑠 cvsca 16684 0gc0g 16828 1rcur 19382 Ringcrg 19428 Mat cmat 21170 ScMat cscmat 21252 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2020 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2162 ax-12 2179 ax-ext 2711 ax-rep 5164 ax-sep 5177 ax-nul 5184 ax-pow 5242 ax-pr 5306 ax-un 7491 ax-cnex 10683 ax-resscn 10684 ax-1cn 10685 ax-icn 10686 ax-addcl 10687 ax-addrcl 10688 ax-mulcl 10689 ax-mulrcl 10690 ax-mulcom 10691 ax-addass 10692 ax-mulass 10693 ax-distr 10694 ax-i2m1 10695 ax-1ne0 10696 ax-1rid 10697 ax-rnegex 10698 ax-rrecex 10699 ax-cnre 10700 ax-pre-lttri 10701 ax-pre-lttrn 10702 ax-pre-ltadd 10703 ax-pre-mulgt0 10704 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2075 df-mo 2541 df-eu 2571 df-clab 2718 df-cleq 2731 df-clel 2812 df-nfc 2882 df-ne 2936 df-nel 3040 df-ral 3059 df-rex 3060 df-reu 3061 df-rmo 3062 df-rab 3063 df-v 3402 df-sbc 3686 df-csb 3801 df-dif 3856 df-un 3858 df-in 3860 df-ss 3870 df-pss 3872 df-nul 4222 df-if 4425 df-pw 4500 df-sn 4527 df-pr 4529 df-tp 4531 df-op 4533 df-ot 4535 df-uni 4807 df-int 4847 df-iun 4893 df-iin 4894 df-br 5041 df-opab 5103 df-mpt 5121 df-tr 5147 df-id 5439 df-eprel 5444 df-po 5452 df-so 5453 df-fr 5493 df-se 5494 df-we 5495 df-xp 5541 df-rel 5542 df-cnv 5543 df-co 5544 df-dm 5545 df-rn 5546 df-res 5547 df-ima 5548 df-pred 6139 df-ord 6185 df-on 6186 df-lim 6187 df-suc 6188 df-iota 6307 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-isom 6358 df-riota 7139 df-ov 7185 df-oprab 7186 df-mpo 7187 df-of 7437 df-om 7612 df-1st 7726 df-2nd 7727 df-supp 7869 df-wrecs 7988 df-recs 8049 df-rdg 8087 df-1o 8143 df-er 8332 df-map 8451 df-ixp 8520 df-en 8568 df-dom 8569 df-sdom 8570 df-fin 8571 df-fsupp 8919 df-sup 8991 df-oi 9059 df-card 9453 df-pnf 10767 df-mnf 10768 df-xr 10769 df-ltxr 10770 df-le 10771 df-sub 10962 df-neg 10963 df-nn 11729 df-2 11791 df-3 11792 df-4 11793 df-5 11794 df-6 11795 df-7 11796 df-8 11797 df-9 11798 df-n0 11989 df-z 12075 df-dec 12192 df-uz 12337 df-fz 12994 df-fzo 13137 df-seq 13473 df-hash 13795 df-struct 16600 df-ndx 16601 df-slot 16602 df-base 16604 df-sets 16605 df-ress 16606 df-plusg 16693 df-mulr 16694 df-sca 16696 df-vsca 16697 df-ip 16698 df-tset 16699 df-ple 16700 df-ds 16702 df-hom 16704 df-cco 16705 df-0g 16830 df-gsum 16831 df-prds 16836 df-pws 16838 df-mre 16972 df-mrc 16973 df-acs 16975 df-mgm 17980 df-sgrp 18029 df-mnd 18040 df-mhm 18084 df-submnd 18085 df-grp 18234 df-minusg 18235 df-sbg 18236 df-mulg 18355 df-subg 18406 df-ghm 18486 df-cntz 18577 df-cmn 19038 df-abl 19039 df-mgp 19371 df-ur 19383 df-ring 19430 df-subrg 19664 df-lmod 19767 df-lss 19835 df-sra 20075 df-rgmod 20076 df-dsmm 20560 df-frlm 20575 df-mamu 21149 df-mat 21171 df-scmat 21254 |
This theorem is referenced by: scmateALT 21275 scmatdmat 21278 |
Copyright terms: Public domain | W3C validator |