| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > scmatfo | Structured version Visualization version GIF version | ||
| Description: There is a function from a ring onto any ring of scalar matrices over this ring. (Contributed by AV, 26-Dec-2019.) |
| Ref | Expression |
|---|---|
| scmatrhmval.k | ⊢ 𝐾 = (Base‘𝑅) |
| scmatrhmval.a | ⊢ 𝐴 = (𝑁 Mat 𝑅) |
| scmatrhmval.o | ⊢ 1 = (1r‘𝐴) |
| scmatrhmval.t | ⊢ ∗ = ( ·𝑠 ‘𝐴) |
| scmatrhmval.f | ⊢ 𝐹 = (𝑥 ∈ 𝐾 ↦ (𝑥 ∗ 1 )) |
| scmatrhmval.c | ⊢ 𝐶 = (𝑁 ScMat 𝑅) |
| Ref | Expression |
|---|---|
| scmatfo | ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝐹:𝐾–onto→𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | scmatrhmval.k | . . 3 ⊢ 𝐾 = (Base‘𝑅) | |
| 2 | scmatrhmval.a | . . 3 ⊢ 𝐴 = (𝑁 Mat 𝑅) | |
| 3 | scmatrhmval.o | . . 3 ⊢ 1 = (1r‘𝐴) | |
| 4 | scmatrhmval.t | . . 3 ⊢ ∗ = ( ·𝑠 ‘𝐴) | |
| 5 | scmatrhmval.f | . . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐾 ↦ (𝑥 ∗ 1 )) | |
| 6 | scmatrhmval.c | . . 3 ⊢ 𝐶 = (𝑁 ScMat 𝑅) | |
| 7 | 1, 2, 3, 4, 5, 6 | scmatf 22445 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝐹:𝐾⟶𝐶) |
| 8 | eqid 2733 | . . . . . 6 ⊢ (Base‘𝐴) = (Base‘𝐴) | |
| 9 | 1, 2, 8, 3, 4, 6 | scmatscmid 22422 | . . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑦 ∈ 𝐶) → ∃𝑐 ∈ 𝐾 𝑦 = (𝑐 ∗ 1 )) |
| 10 | 9 | 3expa 1118 | . . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑦 ∈ 𝐶) → ∃𝑐 ∈ 𝐾 𝑦 = (𝑐 ∗ 1 )) |
| 11 | 1, 2, 3, 4, 5 | scmatrhmval 22443 | . . . . . . . . . 10 ⊢ ((𝑅 ∈ Ring ∧ 𝑐 ∈ 𝐾) → (𝐹‘𝑐) = (𝑐 ∗ 1 )) |
| 12 | 11 | adantll 714 | . . . . . . . . 9 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑐 ∈ 𝐾) → (𝐹‘𝑐) = (𝑐 ∗ 1 )) |
| 13 | 12 | eqcomd 2739 | . . . . . . . 8 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑐 ∈ 𝐾) → (𝑐 ∗ 1 ) = (𝐹‘𝑐)) |
| 14 | 13 | eqeq2d 2744 | . . . . . . 7 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑐 ∈ 𝐾) → (𝑦 = (𝑐 ∗ 1 ) ↔ 𝑦 = (𝐹‘𝑐))) |
| 15 | 14 | biimpd 229 | . . . . . 6 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑐 ∈ 𝐾) → (𝑦 = (𝑐 ∗ 1 ) → 𝑦 = (𝐹‘𝑐))) |
| 16 | 15 | reximdva 3146 | . . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (∃𝑐 ∈ 𝐾 𝑦 = (𝑐 ∗ 1 ) → ∃𝑐 ∈ 𝐾 𝑦 = (𝐹‘𝑐))) |
| 17 | 16 | adantr 480 | . . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑦 ∈ 𝐶) → (∃𝑐 ∈ 𝐾 𝑦 = (𝑐 ∗ 1 ) → ∃𝑐 ∈ 𝐾 𝑦 = (𝐹‘𝑐))) |
| 18 | 10, 17 | mpd 15 | . . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑦 ∈ 𝐶) → ∃𝑐 ∈ 𝐾 𝑦 = (𝐹‘𝑐)) |
| 19 | 18 | ralrimiva 3125 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → ∀𝑦 ∈ 𝐶 ∃𝑐 ∈ 𝐾 𝑦 = (𝐹‘𝑐)) |
| 20 | dffo3 7041 | . 2 ⊢ (𝐹:𝐾–onto→𝐶 ↔ (𝐹:𝐾⟶𝐶 ∧ ∀𝑦 ∈ 𝐶 ∃𝑐 ∈ 𝐾 𝑦 = (𝐹‘𝑐))) | |
| 21 | 7, 19, 20 | sylanbrc 583 | 1 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝐹:𝐾–onto→𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∀wral 3048 ∃wrex 3057 ↦ cmpt 5174 ⟶wf 6482 –onto→wfo 6484 ‘cfv 6486 (class class class)co 7352 Fincfn 8875 Basecbs 17122 ·𝑠 cvsca 17167 1rcur 20101 Ringcrg 20153 Mat cmat 22323 ScMat cscmat 22405 |
| 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 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-rep 5219 ax-sep 5236 ax-nul 5246 ax-pow 5305 ax-pr 5372 ax-un 7674 ax-cnex 11069 ax-resscn 11070 ax-1cn 11071 ax-icn 11072 ax-addcl 11073 ax-addrcl 11074 ax-mulcl 11075 ax-mulrcl 11076 ax-mulcom 11077 ax-addass 11078 ax-mulass 11079 ax-distr 11080 ax-i2m1 11081 ax-1ne0 11082 ax-1rid 11083 ax-rnegex 11084 ax-rrecex 11085 ax-cnre 11086 ax-pre-lttri 11087 ax-pre-lttrn 11088 ax-pre-ltadd 11089 ax-pre-mulgt0 11090 |
| 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 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-nel 3034 df-ral 3049 df-rex 3058 df-rmo 3347 df-reu 3348 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4283 df-if 4475 df-pw 4551 df-sn 4576 df-pr 4578 df-tp 4580 df-op 4582 df-ot 4584 df-uni 4859 df-int 4898 df-iun 4943 df-iin 4944 df-br 5094 df-opab 5156 df-mpt 5175 df-tr 5201 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-se 5573 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6253 df-ord 6314 df-on 6315 df-lim 6316 df-suc 6317 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-isom 6495 df-riota 7309 df-ov 7355 df-oprab 7356 df-mpo 7357 df-of 7616 df-om 7803 df-1st 7927 df-2nd 7928 df-supp 8097 df-frecs 8217 df-wrecs 8248 df-recs 8297 df-rdg 8335 df-1o 8391 df-2o 8392 df-er 8628 df-map 8758 df-ixp 8828 df-en 8876 df-dom 8877 df-sdom 8878 df-fin 8879 df-fsupp 9253 df-sup 9333 df-oi 9403 df-card 9839 df-pnf 11155 df-mnf 11156 df-xr 11157 df-ltxr 11158 df-le 11159 df-sub 11353 df-neg 11354 df-nn 12133 df-2 12195 df-3 12196 df-4 12197 df-5 12198 df-6 12199 df-7 12200 df-8 12201 df-9 12202 df-n0 12389 df-z 12476 df-dec 12595 df-uz 12739 df-fz 13410 df-fzo 13557 df-seq 13911 df-hash 14240 df-struct 17060 df-sets 17077 df-slot 17095 df-ndx 17107 df-base 17123 df-ress 17144 df-plusg 17176 df-mulr 17177 df-sca 17179 df-vsca 17180 df-ip 17181 df-tset 17182 df-ple 17183 df-ds 17185 df-hom 17187 df-cco 17188 df-0g 17347 df-gsum 17348 df-prds 17353 df-pws 17355 df-mre 17490 df-mrc 17491 df-acs 17493 df-mgm 18550 df-sgrp 18629 df-mnd 18645 df-mhm 18693 df-submnd 18694 df-grp 18851 df-minusg 18852 df-sbg 18853 df-mulg 18983 df-subg 19038 df-ghm 19127 df-cntz 19231 df-cmn 19696 df-abl 19697 df-mgp 20061 df-rng 20073 df-ur 20102 df-ring 20155 df-subrg 20487 df-lmod 20797 df-lss 20867 df-sra 21109 df-rgmod 21110 df-dsmm 21671 df-frlm 21686 df-mamu 22307 df-mat 22324 df-scmat 22407 |
| This theorem is referenced by: scmatf1o 22448 |
| Copyright terms: Public domain | W3C validator |