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 21141 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝐹:𝐾⟶𝐶) |
8 | eqid 2824 | . . . . . 6 ⊢ (Base‘𝐴) = (Base‘𝐴) | |
9 | 1, 2, 8, 3, 4, 6 | scmatscmid 21118 | . . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑦 ∈ 𝐶) → ∃𝑐 ∈ 𝐾 𝑦 = (𝑐 ∗ 1 )) |
10 | 9 | 3expa 1114 | . . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑦 ∈ 𝐶) → ∃𝑐 ∈ 𝐾 𝑦 = (𝑐 ∗ 1 )) |
11 | 1, 2, 3, 4, 5 | scmatrhmval 21139 | . . . . . . . . . 10 ⊢ ((𝑅 ∈ Ring ∧ 𝑐 ∈ 𝐾) → (𝐹‘𝑐) = (𝑐 ∗ 1 )) |
12 | 11 | adantll 712 | . . . . . . . . 9 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑐 ∈ 𝐾) → (𝐹‘𝑐) = (𝑐 ∗ 1 )) |
13 | 12 | eqcomd 2830 | . . . . . . . 8 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑐 ∈ 𝐾) → (𝑐 ∗ 1 ) = (𝐹‘𝑐)) |
14 | 13 | eqeq2d 2835 | . . . . . . 7 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑐 ∈ 𝐾) → (𝑦 = (𝑐 ∗ 1 ) ↔ 𝑦 = (𝐹‘𝑐))) |
15 | 14 | biimpd 231 | . . . . . 6 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑐 ∈ 𝐾) → (𝑦 = (𝑐 ∗ 1 ) → 𝑦 = (𝐹‘𝑐))) |
16 | 15 | reximdva 3277 | . . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (∃𝑐 ∈ 𝐾 𝑦 = (𝑐 ∗ 1 ) → ∃𝑐 ∈ 𝐾 𝑦 = (𝐹‘𝑐))) |
17 | 16 | adantr 483 | . . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑦 ∈ 𝐶) → (∃𝑐 ∈ 𝐾 𝑦 = (𝑐 ∗ 1 ) → ∃𝑐 ∈ 𝐾 𝑦 = (𝐹‘𝑐))) |
18 | 10, 17 | mpd 15 | . . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑦 ∈ 𝐶) → ∃𝑐 ∈ 𝐾 𝑦 = (𝐹‘𝑐)) |
19 | 18 | ralrimiva 3185 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → ∀𝑦 ∈ 𝐶 ∃𝑐 ∈ 𝐾 𝑦 = (𝐹‘𝑐)) |
20 | dffo3 6871 | . 2 ⊢ (𝐹:𝐾–onto→𝐶 ↔ (𝐹:𝐾⟶𝐶 ∧ ∀𝑦 ∈ 𝐶 ∃𝑐 ∈ 𝐾 𝑦 = (𝐹‘𝑐))) | |
21 | 7, 19, 20 | sylanbrc 585 | 1 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝐹:𝐾–onto→𝐶) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1536 ∈ wcel 2113 ∀wral 3141 ∃wrex 3142 ↦ cmpt 5149 ⟶wf 6354 –onto→wfo 6356 ‘cfv 6358 (class class class)co 7159 Fincfn 8512 Basecbs 16486 ·𝑠 cvsca 16572 1rcur 19254 Ringcrg 19300 Mat cmat 21019 ScMat cscmat 21101 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-rep 5193 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 ax-cnex 10596 ax-resscn 10597 ax-1cn 10598 ax-icn 10599 ax-addcl 10600 ax-addrcl 10601 ax-mulcl 10602 ax-mulrcl 10603 ax-mulcom 10604 ax-addass 10605 ax-mulass 10606 ax-distr 10607 ax-i2m1 10608 ax-1ne0 10609 ax-1rid 10610 ax-rnegex 10611 ax-rrecex 10612 ax-cnre 10613 ax-pre-lttri 10614 ax-pre-lttrn 10615 ax-pre-ltadd 10616 ax-pre-mulgt0 10617 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-nel 3127 df-ral 3146 df-rex 3147 df-reu 3148 df-rmo 3149 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-pss 3957 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-tp 4575 df-op 4577 df-ot 4579 df-uni 4842 df-int 4880 df-iun 4924 df-iin 4925 df-br 5070 df-opab 5132 df-mpt 5150 df-tr 5176 df-id 5463 df-eprel 5468 df-po 5477 df-so 5478 df-fr 5517 df-se 5518 df-we 5519 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-pred 6151 df-ord 6197 df-on 6198 df-lim 6199 df-suc 6200 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-isom 6367 df-riota 7117 df-ov 7162 df-oprab 7163 df-mpo 7164 df-of 7412 df-om 7584 df-1st 7692 df-2nd 7693 df-supp 7834 df-wrecs 7950 df-recs 8011 df-rdg 8049 df-1o 8105 df-oadd 8109 df-er 8292 df-map 8411 df-ixp 8465 df-en 8513 df-dom 8514 df-sdom 8515 df-fin 8516 df-fsupp 8837 df-sup 8909 df-oi 8977 df-card 9371 df-pnf 10680 df-mnf 10681 df-xr 10682 df-ltxr 10683 df-le 10684 df-sub 10875 df-neg 10876 df-nn 11642 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 16488 df-ndx 16489 df-slot 16490 df-base 16492 df-sets 16493 df-ress 16494 df-plusg 16581 df-mulr 16582 df-sca 16584 df-vsca 16585 df-ip 16586 df-tset 16587 df-ple 16588 df-ds 16590 df-hom 16592 df-cco 16593 df-0g 16718 df-gsum 16719 df-prds 16724 df-pws 16726 df-mre 16860 df-mrc 16861 df-acs 16863 df-mgm 17855 df-sgrp 17904 df-mnd 17915 df-mhm 17959 df-submnd 17960 df-grp 18109 df-minusg 18110 df-sbg 18111 df-mulg 18228 df-subg 18279 df-ghm 18359 df-cntz 18450 df-cmn 18911 df-abl 18912 df-mgp 19243 df-ur 19255 df-ring 19302 df-subrg 19536 df-lmod 19639 df-lss 19707 df-sra 19947 df-rgmod 19948 df-dsmm 20879 df-frlm 20894 df-mamu 20998 df-mat 21020 df-scmat 21103 |
This theorem is referenced by: scmatf1o 21144 |
Copyright terms: Public domain | W3C validator |