| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > scmateALT | Structured version Visualization version GIF version | ||
| Description: Alternate proof of scmate 22466: An entry of an 𝑁 x 𝑁 scalar matrix over the ring 𝑅. This prove makes use of scmatmats 22467 but is longer and requires more distinct variables. (Contributed by AV, 19-Dec-2019.) (New usage is discouraged.) (Proof modification is discouraged.) |
| Ref | Expression |
|---|---|
| scmatmat.a | ⊢ 𝐴 = (𝑁 Mat 𝑅) |
| scmatmat.b | ⊢ 𝐵 = (Base‘𝐴) |
| scmatmat.s | ⊢ 𝑆 = (𝑁 ScMat 𝑅) |
| scmate.k | ⊢ 𝐾 = (Base‘𝑅) |
| scmate.0 | ⊢ 0 = (0g‘𝑅) |
| Ref | Expression |
|---|---|
| scmateALT | ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝑆) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → ∃𝑐 ∈ 𝐾 (𝐼𝑀𝐽) = if(𝐼 = 𝐽, 𝑐, 0 )) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | scmatmat.a | . . . . . 6 ⊢ 𝐴 = (𝑁 Mat 𝑅) | |
| 2 | scmatmat.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐴) | |
| 3 | scmatmat.s | . . . . . 6 ⊢ 𝑆 = (𝑁 ScMat 𝑅) | |
| 4 | scmate.k | . . . . . 6 ⊢ 𝐾 = (Base‘𝑅) | |
| 5 | scmate.0 | . . . . . 6 ⊢ 0 = (0g‘𝑅) | |
| 6 | 1, 2, 3, 4, 5 | scmatmats 22467 | . . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝑆 = {𝑚 ∈ 𝐵 ∣ ∃𝑐 ∈ 𝐾 ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑚𝑗) = if(𝑖 = 𝑗, 𝑐, 0 )}) |
| 7 | 6 | eleq2d 2823 | . . . 4 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑀 ∈ 𝑆 ↔ 𝑀 ∈ {𝑚 ∈ 𝐵 ∣ ∃𝑐 ∈ 𝐾 ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑚𝑗) = if(𝑖 = 𝑗, 𝑐, 0 )})) |
| 8 | oveq 7374 | . . . . . . . . 9 ⊢ (𝑚 = 𝑀 → (𝑖𝑚𝑗) = (𝑖𝑀𝑗)) | |
| 9 | 8 | eqeq1d 2739 | . . . . . . . 8 ⊢ (𝑚 = 𝑀 → ((𝑖𝑚𝑗) = if(𝑖 = 𝑗, 𝑐, 0 ) ↔ (𝑖𝑀𝑗) = if(𝑖 = 𝑗, 𝑐, 0 ))) |
| 10 | 9 | 2ralbidv 3202 | . . . . . . 7 ⊢ (𝑚 = 𝑀 → (∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑚𝑗) = if(𝑖 = 𝑗, 𝑐, 0 ) ↔ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑀𝑗) = if(𝑖 = 𝑗, 𝑐, 0 ))) |
| 11 | 10 | rexbidv 3162 | . . . . . 6 ⊢ (𝑚 = 𝑀 → (∃𝑐 ∈ 𝐾 ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑚𝑗) = if(𝑖 = 𝑗, 𝑐, 0 ) ↔ ∃𝑐 ∈ 𝐾 ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑀𝑗) = if(𝑖 = 𝑗, 𝑐, 0 ))) |
| 12 | 11 | elrab 3648 | . . . . 5 ⊢ (𝑀 ∈ {𝑚 ∈ 𝐵 ∣ ∃𝑐 ∈ 𝐾 ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑚𝑗) = if(𝑖 = 𝑗, 𝑐, 0 )} ↔ (𝑀 ∈ 𝐵 ∧ ∃𝑐 ∈ 𝐾 ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑀𝑗) = if(𝑖 = 𝑗, 𝑐, 0 ))) |
| 13 | oveq1 7375 | . . . . . . . . . . 11 ⊢ (𝑖 = 𝐼 → (𝑖𝑀𝑗) = (𝐼𝑀𝑗)) | |
| 14 | eqeq1 2741 | . . . . . . . . . . . 12 ⊢ (𝑖 = 𝐼 → (𝑖 = 𝑗 ↔ 𝐼 = 𝑗)) | |
| 15 | 14 | ifbid 4505 | . . . . . . . . . . 11 ⊢ (𝑖 = 𝐼 → if(𝑖 = 𝑗, 𝑐, 0 ) = if(𝐼 = 𝑗, 𝑐, 0 )) |
| 16 | 13, 15 | eqeq12d 2753 | . . . . . . . . . 10 ⊢ (𝑖 = 𝐼 → ((𝑖𝑀𝑗) = if(𝑖 = 𝑗, 𝑐, 0 ) ↔ (𝐼𝑀𝑗) = if(𝐼 = 𝑗, 𝑐, 0 ))) |
| 17 | oveq2 7376 | . . . . . . . . . . 11 ⊢ (𝑗 = 𝐽 → (𝐼𝑀𝑗) = (𝐼𝑀𝐽)) | |
| 18 | eqeq2 2749 | . . . . . . . . . . . 12 ⊢ (𝑗 = 𝐽 → (𝐼 = 𝑗 ↔ 𝐼 = 𝐽)) | |
| 19 | 18 | ifbid 4505 | . . . . . . . . . . 11 ⊢ (𝑗 = 𝐽 → if(𝐼 = 𝑗, 𝑐, 0 ) = if(𝐼 = 𝐽, 𝑐, 0 )) |
| 20 | 17, 19 | eqeq12d 2753 | . . . . . . . . . 10 ⊢ (𝑗 = 𝐽 → ((𝐼𝑀𝑗) = if(𝐼 = 𝑗, 𝑐, 0 ) ↔ (𝐼𝑀𝐽) = if(𝐼 = 𝐽, 𝑐, 0 ))) |
| 21 | 16, 20 | rspc2v 3589 | . . . . . . . . 9 ⊢ ((𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁) → (∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑀𝑗) = if(𝑖 = 𝑗, 𝑐, 0 ) → (𝐼𝑀𝐽) = if(𝐼 = 𝐽, 𝑐, 0 ))) |
| 22 | 21 | reximdv 3153 | . . . . . . . 8 ⊢ ((𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁) → (∃𝑐 ∈ 𝐾 ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑀𝑗) = if(𝑖 = 𝑗, 𝑐, 0 ) → ∃𝑐 ∈ 𝐾 (𝐼𝑀𝐽) = if(𝐼 = 𝐽, 𝑐, 0 ))) |
| 23 | 22 | com12 32 | . . . . . . 7 ⊢ (∃𝑐 ∈ 𝐾 ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑀𝑗) = if(𝑖 = 𝑗, 𝑐, 0 ) → ((𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁) → ∃𝑐 ∈ 𝐾 (𝐼𝑀𝐽) = if(𝐼 = 𝐽, 𝑐, 0 ))) |
| 24 | 23 | adantl 481 | . . . . . 6 ⊢ ((𝑀 ∈ 𝐵 ∧ ∃𝑐 ∈ 𝐾 ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑀𝑗) = if(𝑖 = 𝑗, 𝑐, 0 )) → ((𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁) → ∃𝑐 ∈ 𝐾 (𝐼𝑀𝐽) = if(𝐼 = 𝐽, 𝑐, 0 ))) |
| 25 | 24 | a1i 11 | . . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → ((𝑀 ∈ 𝐵 ∧ ∃𝑐 ∈ 𝐾 ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑀𝑗) = if(𝑖 = 𝑗, 𝑐, 0 )) → ((𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁) → ∃𝑐 ∈ 𝐾 (𝐼𝑀𝐽) = if(𝐼 = 𝐽, 𝑐, 0 )))) |
| 26 | 12, 25 | biimtrid 242 | . . . 4 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑀 ∈ {𝑚 ∈ 𝐵 ∣ ∃𝑐 ∈ 𝐾 ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑚𝑗) = if(𝑖 = 𝑗, 𝑐, 0 )} → ((𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁) → ∃𝑐 ∈ 𝐾 (𝐼𝑀𝐽) = if(𝐼 = 𝐽, 𝑐, 0 )))) |
| 27 | 7, 26 | sylbid 240 | . . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑀 ∈ 𝑆 → ((𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁) → ∃𝑐 ∈ 𝐾 (𝐼𝑀𝐽) = if(𝐼 = 𝐽, 𝑐, 0 )))) |
| 28 | 27 | ex 412 | . 2 ⊢ (𝑁 ∈ Fin → (𝑅 ∈ Ring → (𝑀 ∈ 𝑆 → ((𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁) → ∃𝑐 ∈ 𝐾 (𝐼𝑀𝐽) = if(𝐼 = 𝐽, 𝑐, 0 ))))) |
| 29 | 28 | 3imp1 1349 | 1 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝑆) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → ∃𝑐 ∈ 𝐾 (𝐼𝑀𝐽) = if(𝐼 = 𝐽, 𝑐, 0 )) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ∀wral 3052 ∃wrex 3062 {crab 3401 ifcif 4481 ‘cfv 6500 (class class class)co 7368 Fincfn 8895 Basecbs 17148 0gc0g 17371 Ringcrg 20180 Mat cmat 22363 ScMat cscmat 22445 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-tp 4587 df-op 4589 df-ot 4591 df-uni 4866 df-int 4905 df-iun 4950 df-iin 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-se 5586 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-isom 6509 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-of 7632 df-om 7819 df-1st 7943 df-2nd 7944 df-supp 8113 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-1o 8407 df-2o 8408 df-er 8645 df-map 8777 df-ixp 8848 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-fsupp 9277 df-sup 9357 df-oi 9427 df-card 9863 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-nn 12158 df-2 12220 df-3 12221 df-4 12222 df-5 12223 df-6 12224 df-7 12225 df-8 12226 df-9 12227 df-n0 12414 df-z 12501 df-dec 12620 df-uz 12764 df-fz 13436 df-fzo 13583 df-seq 13937 df-hash 14266 df-struct 17086 df-sets 17103 df-slot 17121 df-ndx 17133 df-base 17149 df-ress 17170 df-plusg 17202 df-mulr 17203 df-sca 17205 df-vsca 17206 df-ip 17207 df-tset 17208 df-ple 17209 df-ds 17211 df-hom 17213 df-cco 17214 df-0g 17373 df-gsum 17374 df-prds 17379 df-pws 17381 df-mre 17517 df-mrc 17518 df-acs 17520 df-mgm 18577 df-sgrp 18656 df-mnd 18672 df-mhm 18720 df-submnd 18721 df-grp 18878 df-minusg 18879 df-sbg 18880 df-mulg 19010 df-subg 19065 df-ghm 19154 df-cntz 19258 df-cmn 19723 df-abl 19724 df-mgp 20088 df-rng 20100 df-ur 20129 df-ring 20182 df-subrg 20515 df-lmod 20825 df-lss 20895 df-sra 21137 df-rgmod 21138 df-dsmm 21699 df-frlm 21714 df-mamu 22347 df-mat 22364 df-scmat 22447 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |