Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > scmatscmide | Structured version Visualization version GIF version |
Description: An entry of a scalar matrix expressed as a multiplication of a scalar with the identity matrix. (Contributed by AV, 30-Oct-2019.) |
Ref | Expression |
---|---|
scmatscmide.a | ⊢ 𝐴 = (𝑁 Mat 𝑅) |
scmatscmide.b | ⊢ 𝐵 = (Base‘𝑅) |
scmatscmide.0 | ⊢ 0 = (0g‘𝑅) |
scmatscmide.1 | ⊢ 1 = (1r‘𝐴) |
scmatscmide.m | ⊢ ∗ = ( ·𝑠 ‘𝐴) |
Ref | Expression |
---|---|
scmatscmide | ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝐶 ∈ 𝐵) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → (𝐼(𝐶 ∗ 1 )𝐽) = if(𝐼 = 𝐽, 𝐶, 0 )) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpl2 1188 | . . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝐶 ∈ 𝐵) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → 𝑅 ∈ Ring) | |
2 | simp3 1134 | . . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝐶 ∈ 𝐵) → 𝐶 ∈ 𝐵) | |
3 | scmatscmide.a | . . . . . . . 8 ⊢ 𝐴 = (𝑁 Mat 𝑅) | |
4 | 3 | matring 21054 | . . . . . . 7 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝐴 ∈ Ring) |
5 | eqid 2823 | . . . . . . . 8 ⊢ (Base‘𝐴) = (Base‘𝐴) | |
6 | scmatscmide.1 | . . . . . . . 8 ⊢ 1 = (1r‘𝐴) | |
7 | 5, 6 | ringidcl 19320 | . . . . . . 7 ⊢ (𝐴 ∈ Ring → 1 ∈ (Base‘𝐴)) |
8 | 4, 7 | syl 17 | . . . . . 6 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 1 ∈ (Base‘𝐴)) |
9 | 8 | 3adant3 1128 | . . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝐶 ∈ 𝐵) → 1 ∈ (Base‘𝐴)) |
10 | 2, 9 | jca 514 | . . . 4 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝐶 ∈ 𝐵) → (𝐶 ∈ 𝐵 ∧ 1 ∈ (Base‘𝐴))) |
11 | 10 | adantr 483 | . . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝐶 ∈ 𝐵) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → (𝐶 ∈ 𝐵 ∧ 1 ∈ (Base‘𝐴))) |
12 | simpr 487 | . . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝐶 ∈ 𝐵) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) | |
13 | scmatscmide.b | . . . 4 ⊢ 𝐵 = (Base‘𝑅) | |
14 | scmatscmide.m | . . . 4 ⊢ ∗ = ( ·𝑠 ‘𝐴) | |
15 | eqid 2823 | . . . 4 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
16 | 3, 5, 13, 14, 15 | matvscacell 21047 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝐶 ∈ 𝐵 ∧ 1 ∈ (Base‘𝐴)) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → (𝐼(𝐶 ∗ 1 )𝐽) = (𝐶(.r‘𝑅)(𝐼 1 𝐽))) |
17 | 1, 11, 12, 16 | syl3anc 1367 | . 2 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝐶 ∈ 𝐵) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → (𝐼(𝐶 ∗ 1 )𝐽) = (𝐶(.r‘𝑅)(𝐼 1 𝐽))) |
18 | eqid 2823 | . . . 4 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
19 | scmatscmide.0 | . . . 4 ⊢ 0 = (0g‘𝑅) | |
20 | simpl1 1187 | . . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝐶 ∈ 𝐵) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → 𝑁 ∈ Fin) | |
21 | simprl 769 | . . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝐶 ∈ 𝐵) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → 𝐼 ∈ 𝑁) | |
22 | simprr 771 | . . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝐶 ∈ 𝐵) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → 𝐽 ∈ 𝑁) | |
23 | 3, 18, 19, 20, 1, 21, 22, 6 | mat1ov 21059 | . . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝐶 ∈ 𝐵) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → (𝐼 1 𝐽) = if(𝐼 = 𝐽, (1r‘𝑅), 0 )) |
24 | 23 | oveq2d 7174 | . 2 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝐶 ∈ 𝐵) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → (𝐶(.r‘𝑅)(𝐼 1 𝐽)) = (𝐶(.r‘𝑅)if(𝐼 = 𝐽, (1r‘𝑅), 0 ))) |
25 | ovif2 7254 | . . . 4 ⊢ (𝐶(.r‘𝑅)if(𝐼 = 𝐽, (1r‘𝑅), 0 )) = if(𝐼 = 𝐽, (𝐶(.r‘𝑅)(1r‘𝑅)), (𝐶(.r‘𝑅) 0 )) | |
26 | 13, 15, 18 | ringridm 19324 | . . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∈ 𝐵) → (𝐶(.r‘𝑅)(1r‘𝑅)) = 𝐶) |
27 | 26 | 3adant1 1126 | . . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝐶 ∈ 𝐵) → (𝐶(.r‘𝑅)(1r‘𝑅)) = 𝐶) |
28 | 13, 15, 19 | ringrz 19340 | . . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∈ 𝐵) → (𝐶(.r‘𝑅) 0 ) = 0 ) |
29 | 28 | 3adant1 1126 | . . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝐶 ∈ 𝐵) → (𝐶(.r‘𝑅) 0 ) = 0 ) |
30 | 27, 29 | ifeq12d 4489 | . . . 4 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝐶 ∈ 𝐵) → if(𝐼 = 𝐽, (𝐶(.r‘𝑅)(1r‘𝑅)), (𝐶(.r‘𝑅) 0 )) = if(𝐼 = 𝐽, 𝐶, 0 )) |
31 | 25, 30 | syl5eq 2870 | . . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝐶 ∈ 𝐵) → (𝐶(.r‘𝑅)if(𝐼 = 𝐽, (1r‘𝑅), 0 )) = if(𝐼 = 𝐽, 𝐶, 0 )) |
32 | 31 | adantr 483 | . 2 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝐶 ∈ 𝐵) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → (𝐶(.r‘𝑅)if(𝐼 = 𝐽, (1r‘𝑅), 0 )) = if(𝐼 = 𝐽, 𝐶, 0 )) |
33 | 17, 24, 32 | 3eqtrd 2862 | 1 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝐶 ∈ 𝐵) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → (𝐼(𝐶 ∗ 1 )𝐽) = if(𝐼 = 𝐽, 𝐶, 0 )) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ifcif 4469 ‘cfv 6357 (class class class)co 7158 Fincfn 8511 Basecbs 16485 .rcmulr 16568 ·𝑠 cvsca 16571 0gc0g 16715 1rcur 19253 Ringcrg 19299 Mat cmat 21018 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rmo 3148 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-ot 4578 df-uni 4841 df-int 4879 df-iun 4923 df-iin 4924 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-se 5517 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-isom 6366 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-of 7411 df-om 7583 df-1st 7691 df-2nd 7692 df-supp 7833 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-1o 8104 df-oadd 8108 df-er 8291 df-map 8410 df-ixp 8464 df-en 8512 df-dom 8513 df-sdom 8514 df-fin 8515 df-fsupp 8836 df-sup 8908 df-oi 8976 df-card 9370 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 df-nn 11641 df-2 11703 df-3 11704 df-4 11705 df-5 11706 df-6 11707 df-7 11708 df-8 11709 df-9 11710 df-n0 11901 df-z 11985 df-dec 12102 df-uz 12247 df-fz 12896 df-fzo 13037 df-seq 13373 df-hash 13694 df-struct 16487 df-ndx 16488 df-slot 16489 df-base 16491 df-sets 16492 df-ress 16493 df-plusg 16580 df-mulr 16581 df-sca 16583 df-vsca 16584 df-ip 16585 df-tset 16586 df-ple 16587 df-ds 16589 df-hom 16591 df-cco 16592 df-0g 16717 df-gsum 16718 df-prds 16723 df-pws 16725 df-mre 16859 df-mrc 16860 df-acs 16862 df-mgm 17854 df-sgrp 17903 df-mnd 17914 df-mhm 17958 df-submnd 17959 df-grp 18108 df-minusg 18109 df-sbg 18110 df-mulg 18227 df-subg 18278 df-ghm 18358 df-cntz 18449 df-cmn 18910 df-abl 18911 df-mgp 19242 df-ur 19254 df-ring 19301 df-subrg 19535 df-lmod 19638 df-lss 19706 df-sra 19946 df-rgmod 19947 df-dsmm 20878 df-frlm 20893 df-mamu 20997 df-mat 21019 |
This theorem is referenced by: scmatscmiddistr 21119 scmate 21121 scmatmats 21122 scmatf1 21142 pmatcollpwscmatlem1 21399 pmatcollpwscmatlem2 21400 |
Copyright terms: Public domain | W3C validator |