| 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 22858: An entry of an 𝑁 x 𝑁 scalar matrix over the ring 𝑅. This prove makes use of scmatmats 22859 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 22859 | . . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝑆 = {𝑚 ∈ 𝐵 ∣ ∃𝑐 ∈ 𝐾 ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑚𝑗) = if(𝑖 = 𝑗, 𝑐, 0 )}) |
| 7 | 6 | eleq2d 2850 | . . . 4 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑀 ∈ 𝑆 ↔ 𝑀 ∈ {𝑚 ∈ 𝐵 ∣ ∃𝑐 ∈ 𝐾 ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑚𝑗) = if(𝑖 = 𝑗, 𝑐, 0 )})) |
| 8 | oveq 7452 | . . . . . . . . 9 ⊢ (𝑚 = 𝑀 → (𝑖𝑚𝑗) = (𝑖𝑀𝑗)) | |
| 9 | 8 | eqeq1d 2765 | . . . . . . . 8 ⊢ (𝑚 = 𝑀 → ((𝑖𝑚𝑗) = if(𝑖 = 𝑗, 𝑐, 0 ) ↔ (𝑖𝑀𝑗) = if(𝑖 = 𝑗, 𝑐, 0 ))) |
| 10 | 9 | 2ralbidv 3230 | . . . . . . 7 ⊢ (𝑚 = 𝑀 → (∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑚𝑗) = if(𝑖 = 𝑗, 𝑐, 0 ) ↔ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑀𝑗) = if(𝑖 = 𝑗, 𝑐, 0 ))) |
| 11 | 10 | rexbidv 3190 | . . . . . 6 ⊢ (𝑚 = 𝑀 → (∃𝑐 ∈ 𝐾 ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑚𝑗) = if(𝑖 = 𝑗, 𝑐, 0 ) ↔ ∃𝑐 ∈ 𝐾 ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑀𝑗) = if(𝑖 = 𝑗, 𝑐, 0 ))) |
| 12 | 11 | elrab 3648 | . . . . 5 ⊢ (𝑀 ∈ {𝑚 ∈ 𝐵 ∣ ∃𝑐 ∈ 𝐾 ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑚𝑗) = if(𝑖 = 𝑗, 𝑐, 0 )} ↔ (𝑀 ∈ 𝐵 ∧ ∃𝑐 ∈ 𝐾 ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑀𝑗) = if(𝑖 = 𝑗, 𝑐, 0 ))) |
| 13 | oveq1 7453 | . . . . . . . . . . 11 ⊢ (𝑖 = 𝐼 → (𝑖𝑀𝑗) = (𝐼𝑀𝑗)) | |
| 14 | eqeq1 2767 | . . . . . . . . . . . 12 ⊢ (𝑖 = 𝐼 → (𝑖 = 𝑗 ↔ 𝐼 = 𝑗)) | |
| 15 | 14 | ifbid 4509 | . . . . . . . . . . 11 ⊢ (𝑖 = 𝐼 → if(𝑖 = 𝑗, 𝑐, 0 ) = if(𝐼 = 𝑗, 𝑐, 0 )) |
| 16 | 13, 15 | eqeq12d 2779 | . . . . . . . . . 10 ⊢ (𝑖 = 𝐼 → ((𝑖𝑀𝑗) = if(𝑖 = 𝑗, 𝑐, 0 ) ↔ (𝐼𝑀𝑗) = if(𝐼 = 𝑗, 𝑐, 0 ))) |
| 17 | oveq2 7454 | . . . . . . . . . . 11 ⊢ (𝑗 = 𝐽 → (𝐼𝑀𝑗) = (𝐼𝑀𝐽)) | |
| 18 | eqeq2 2775 | . . . . . . . . . . . 12 ⊢ (𝑗 = 𝐽 → (𝐼 = 𝑗 ↔ 𝐼 = 𝐽)) | |
| 19 | 18 | ifbid 4509 | . . . . . . . . . . 11 ⊢ (𝑗 = 𝐽 → if(𝐼 = 𝑗, 𝑐, 0 ) = if(𝐼 = 𝐽, 𝑐, 0 )) |
| 20 | 17, 19 | eqeq12d 2779 | . . . . . . . . . 10 ⊢ (𝑗 = 𝐽 → ((𝐼𝑀𝑗) = if(𝐼 = 𝑗, 𝑐, 0 ) ↔ (𝐼𝑀𝐽) = if(𝐼 = 𝐽, 𝑐, 0 ))) |
| 21 | 16, 20 | rspc2v 3590 | . . . . . . . . 9 ⊢ ((𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁) → (∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑀𝑗) = if(𝑖 = 𝑗, 𝑐, 0 ) → (𝐼𝑀𝐽) = if(𝐼 = 𝐽, 𝑐, 0 ))) |
| 22 | 21 | reximdv 3181 | . . . . . . . 8 ⊢ ((𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁) → (∃𝑐 ∈ 𝐾 ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑀𝑗) = if(𝑖 = 𝑗, 𝑐, 0 ) → ∃𝑐 ∈ 𝐾 (𝐼𝑀𝐽) = if(𝐼 = 𝐽, 𝑐, 0 ))) |
| 23 | 22 | com12 33 | . . . . . . 7 ⊢ (∃𝑐 ∈ 𝐾 ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑀𝑗) = if(𝑖 = 𝑗, 𝑐, 0 ) → ((𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁) → ∃𝑐 ∈ 𝐾 (𝐼𝑀𝐽) = if(𝐼 = 𝐽, 𝑐, 0 ))) |
| 24 | 23 | adantl 487 | . . . . . 6 ⊢ ((𝑀 ∈ 𝐵 ∧ ∃𝑐 ∈ 𝐾 ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑀𝑗) = if(𝑖 = 𝑗, 𝑐, 0 )) → ((𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁) → ∃𝑐 ∈ 𝐾 (𝐼𝑀𝐽) = if(𝐼 = 𝐽, 𝑐, 0 ))) |
| 25 | 24 | a1i 11 | . . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → ((𝑀 ∈ 𝐵 ∧ ∃𝑐 ∈ 𝐾 ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑀𝑗) = if(𝑖 = 𝑗, 𝑐, 0 )) → ((𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁) → ∃𝑐 ∈ 𝐾 (𝐼𝑀𝐽) = if(𝐼 = 𝐽, 𝑐, 0 )))) |
| 26 | 12, 25 | biimtrid 245 | . . . 4 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑀 ∈ {𝑚 ∈ 𝐵 ∣ ∃𝑐 ∈ 𝐾 ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑚𝑗) = if(𝑖 = 𝑗, 𝑐, 0 )} → ((𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁) → ∃𝑐 ∈ 𝐾 (𝐼𝑀𝐽) = if(𝐼 = 𝐽, 𝑐, 0 )))) |
| 27 | 7, 26 | sylbid 243 | . . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑀 ∈ 𝑆 → ((𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁) → ∃𝑐 ∈ 𝐾 (𝐼𝑀𝐽) = if(𝐼 = 𝐽, 𝑐, 0 )))) |
| 28 | 27 | ex 418 | . 2 ⊢ (𝑁 ∈ Fin → (𝑅 ∈ Ring → (𝑀 ∈ 𝑆 → ((𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁) → ∃𝑐 ∈ 𝐾 (𝐼𝑀𝐽) = if(𝐼 = 𝐽, 𝑐, 0 ))))) |
| 29 | 28 | 3imp1 1366 | 1 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝑆) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → ∃𝑐 ∈ 𝐾 (𝐼𝑀𝐽) = if(𝐼 = 𝐽, 𝑐, 0 )) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ∀wral 3080 ∃wrex 3090 {crab 3416 ifcif 4485 ‘cfv 6561 (class class class)co 7446 Fincfn 9004 Basecbs 17419 0gc0g 17642 Ringcrg 20492 Mat cmat 22755 ScMat cscmat 22837 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5236 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7778 ax-cnex 11286 ax-resscn 11287 ax-1cn 11288 ax-icn 11289 ax-addcl 11290 ax-addrcl 11291 ax-mulcl 11292 ax-mulrcl 11293 ax-mulcom 11294 ax-addass 11295 ax-mulass 11296 ax-distr 11297 ax-i2m1 11298 ax-1ne0 11299 ax-1rid 11300 ax-rnegex 11301 ax-rrecex 11302 ax-cnre 11303 ax-pre-lttri 11304 ax-pre-lttrn 11305 ax-pre-ltadd 11306 ax-pre-mulgt0 11307 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4839 df-ot 4862 df-uni 4871 df-int 4911 df-iun 4956 df-iin 4957 df-br 5107 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5551 df-eprel 5556 df-po 5564 df-so 5565 df-fr 5609 df-se 5610 df-we 5611 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-pred 6325 df-ord 6386 df-on 6387 df-lim 6388 df-suc 6389 df-iota 6515 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-isom 6570 df-riota 7403 df-ov 7449 df-oprab 7450 df-mpo 7451 df-of 7720 df-om 7905 df-1st 8028 df-2nd 8029 df-supp 8208 df-frecs 8330 df-wrecs 8361 df-recs 8410 df-rdg 8449 df-1o 8507 df-2o 8508 df-er 8748 df-map 8880 df-ixp 8957 df-en 9005 df-dom 9006 df-sdom 9007 df-fin 9008 df-fsupp 9385 df-sup 9464 df-oi 9534 df-card 10050 df-pnf 11375 df-mnf 11376 df-xr 11377 df-ltxr 11378 df-le 11379 df-sub 11573 df-neg 11574 df-nn 12366 df-2 12435 df-3 12436 df-4 12437 df-5 12438 df-6 12439 df-7 12440 df-8 12441 df-9 12442 df-n0 12637 df-z 12724 df-dec 12845 df-uz 12996 df-fz 13670 df-fzo 13819 df-seq 14175 df-hash 14505 df-struct 17357 df-sets 17374 df-slot 17392 df-ndx 17404 df-base 17420 df-ress 17441 df-plusg 17473 df-mulr 17474 df-sca 17476 df-vsca 17477 df-ip 17478 df-tset 17479 df-ple 17480 df-ds 17482 df-hom 17484 df-cco 17485 df-0g 17644 df-gsum 17645 df-prds 17650 df-pws 17652 df-mre 17788 df-mrc 17789 df-acs 17791 df-mgm 18848 df-sgrp 18940 df-mnd 18956 df-mhm 19010 df-submnd 19011 df-grp 19179 df-minusg 19180 df-sbg 19181 df-mulg 19310 df-subg 19365 df-ghm 19460 df-cntz 19564 df-cmn 20029 df-abl 20030 df-mgp 20394 df-rng 20408 df-ur 20441 df-ring 20494 df-subrg 20855 df-lmod 21170 df-lss 21240 df-sra 21481 df-rgmod 21482 df-dsmm 22071 df-frlm 22086 df-mamu 22739 df-mat 22756 df-scmat 22839 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |