Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > marrepcl | Structured version Visualization version GIF version |
Description: Closure of the row replacement function for square matrices. (Contributed by AV, 13-Feb-2019.) |
Ref | Expression |
---|---|
marrepcl.a | ⊢ 𝐴 = (𝑁 Mat 𝑅) |
marrepcl.b | ⊢ 𝐵 = (Base‘𝐴) |
Ref | Expression |
---|---|
marrepcl | ⊢ (((𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵 ∧ 𝑆 ∈ (Base‘𝑅)) ∧ (𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁)) → (𝐾(𝑀(𝑁 matRRep 𝑅)𝑆)𝐿) ∈ 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | marrepcl.a | . . . 4 ⊢ 𝐴 = (𝑁 Mat 𝑅) | |
2 | marrepcl.b | . . . 4 ⊢ 𝐵 = (Base‘𝐴) | |
3 | eqid 2736 | . . . 4 ⊢ (𝑁 matRRep 𝑅) = (𝑁 matRRep 𝑅) | |
4 | eqid 2736 | . . . 4 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
5 | 1, 2, 3, 4 | marrepval 21756 | . . 3 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝑆 ∈ (Base‘𝑅)) ∧ (𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁)) → (𝐾(𝑀(𝑁 matRRep 𝑅)𝑆)𝐿) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 𝑆, (0g‘𝑅)), (𝑖𝑀𝑗)))) |
6 | 5 | 3adantl1 1166 | . 2 ⊢ (((𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵 ∧ 𝑆 ∈ (Base‘𝑅)) ∧ (𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁)) → (𝐾(𝑀(𝑁 matRRep 𝑅)𝑆)𝐿) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 𝑆, (0g‘𝑅)), (𝑖𝑀𝑗)))) |
7 | eqid 2736 | . . 3 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
8 | 1, 2 | matrcl 21604 | . . . . . 6 ⊢ (𝑀 ∈ 𝐵 → (𝑁 ∈ Fin ∧ 𝑅 ∈ V)) |
9 | 8 | simpld 496 | . . . . 5 ⊢ (𝑀 ∈ 𝐵 → 𝑁 ∈ Fin) |
10 | 9 | 3ad2ant2 1134 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵 ∧ 𝑆 ∈ (Base‘𝑅)) → 𝑁 ∈ Fin) |
11 | 10 | adantr 482 | . . 3 ⊢ (((𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵 ∧ 𝑆 ∈ (Base‘𝑅)) ∧ (𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁)) → 𝑁 ∈ Fin) |
12 | simpl1 1191 | . . 3 ⊢ (((𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵 ∧ 𝑆 ∈ (Base‘𝑅)) ∧ (𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁)) → 𝑅 ∈ Ring) | |
13 | simp3 1138 | . . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵 ∧ 𝑆 ∈ (Base‘𝑅)) → 𝑆 ∈ (Base‘𝑅)) | |
14 | 7, 4 | ring0cl 19853 | . . . . . . . 8 ⊢ (𝑅 ∈ Ring → (0g‘𝑅) ∈ (Base‘𝑅)) |
15 | 14 | 3ad2ant1 1133 | . . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵 ∧ 𝑆 ∈ (Base‘𝑅)) → (0g‘𝑅) ∈ (Base‘𝑅)) |
16 | 13, 15 | ifcld 4511 | . . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵 ∧ 𝑆 ∈ (Base‘𝑅)) → if(𝑗 = 𝐿, 𝑆, (0g‘𝑅)) ∈ (Base‘𝑅)) |
17 | 16 | adantr 482 | . . . . 5 ⊢ (((𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵 ∧ 𝑆 ∈ (Base‘𝑅)) ∧ (𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁)) → if(𝑗 = 𝐿, 𝑆, (0g‘𝑅)) ∈ (Base‘𝑅)) |
18 | 17 | 3ad2ant1 1133 | . . . 4 ⊢ ((((𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵 ∧ 𝑆 ∈ (Base‘𝑅)) ∧ (𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → if(𝑗 = 𝐿, 𝑆, (0g‘𝑅)) ∈ (Base‘𝑅)) |
19 | simp2 1137 | . . . . 5 ⊢ ((((𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵 ∧ 𝑆 ∈ (Base‘𝑅)) ∧ (𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → 𝑖 ∈ 𝑁) | |
20 | simp3 1138 | . . . . 5 ⊢ ((((𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵 ∧ 𝑆 ∈ (Base‘𝑅)) ∧ (𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → 𝑗 ∈ 𝑁) | |
21 | 2 | eleq2i 2828 | . . . . . . . . 9 ⊢ (𝑀 ∈ 𝐵 ↔ 𝑀 ∈ (Base‘𝐴)) |
22 | 21 | biimpi 215 | . . . . . . . 8 ⊢ (𝑀 ∈ 𝐵 → 𝑀 ∈ (Base‘𝐴)) |
23 | 22 | 3ad2ant2 1134 | . . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵 ∧ 𝑆 ∈ (Base‘𝑅)) → 𝑀 ∈ (Base‘𝐴)) |
24 | 23 | adantr 482 | . . . . . 6 ⊢ (((𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵 ∧ 𝑆 ∈ (Base‘𝑅)) ∧ (𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁)) → 𝑀 ∈ (Base‘𝐴)) |
25 | 24 | 3ad2ant1 1133 | . . . . 5 ⊢ ((((𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵 ∧ 𝑆 ∈ (Base‘𝑅)) ∧ (𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → 𝑀 ∈ (Base‘𝐴)) |
26 | 1, 7 | matecl 21619 | . . . . 5 ⊢ ((𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁 ∧ 𝑀 ∈ (Base‘𝐴)) → (𝑖𝑀𝑗) ∈ (Base‘𝑅)) |
27 | 19, 20, 25, 26 | syl3anc 1371 | . . . 4 ⊢ ((((𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵 ∧ 𝑆 ∈ (Base‘𝑅)) ∧ (𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → (𝑖𝑀𝑗) ∈ (Base‘𝑅)) |
28 | 18, 27 | ifcld 4511 | . . 3 ⊢ ((((𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵 ∧ 𝑆 ∈ (Base‘𝑅)) ∧ (𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → if(𝑖 = 𝐾, if(𝑗 = 𝐿, 𝑆, (0g‘𝑅)), (𝑖𝑀𝑗)) ∈ (Base‘𝑅)) |
29 | 1, 7, 2, 11, 12, 28 | matbas2d 21617 | . 2 ⊢ (((𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵 ∧ 𝑆 ∈ (Base‘𝑅)) ∧ (𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁)) → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 𝑆, (0g‘𝑅)), (𝑖𝑀𝑗))) ∈ 𝐵) |
30 | 6, 29 | eqeltrd 2837 | 1 ⊢ (((𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵 ∧ 𝑆 ∈ (Base‘𝑅)) ∧ (𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁)) → (𝐾(𝑀(𝑁 matRRep 𝑅)𝑆)𝐿) ∈ 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 397 ∧ w3a 1087 = wceq 1539 ∈ wcel 2104 Vcvv 3437 ifcif 4465 ‘cfv 6458 (class class class)co 7307 ∈ cmpo 7309 Fincfn 8764 Basecbs 16957 0gc0g 17195 Ringcrg 19828 Mat cmat 21599 matRRep cmarrep 21750 |
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 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2707 ax-rep 5218 ax-sep 5232 ax-nul 5239 ax-pow 5297 ax-pr 5361 ax-un 7620 ax-cnex 10973 ax-resscn 10974 ax-1cn 10975 ax-icn 10976 ax-addcl 10977 ax-addrcl 10978 ax-mulcl 10979 ax-mulrcl 10980 ax-mulcom 10981 ax-addass 10982 ax-mulass 10983 ax-distr 10984 ax-i2m1 10985 ax-1ne0 10986 ax-1rid 10987 ax-rnegex 10988 ax-rrecex 10989 ax-cnre 10990 ax-pre-lttri 10991 ax-pre-lttrn 10992 ax-pre-ltadd 10993 ax-pre-mulgt0 10994 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3or 1088 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2887 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3285 df-reu 3286 df-rab 3287 df-v 3439 df-sbc 3722 df-csb 3838 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-pss 3911 df-nul 4263 df-if 4466 df-pw 4541 df-sn 4566 df-pr 4568 df-tp 4570 df-op 4572 df-ot 4574 df-uni 4845 df-iun 4933 df-br 5082 df-opab 5144 df-mpt 5165 df-tr 5199 df-id 5500 df-eprel 5506 df-po 5514 df-so 5515 df-fr 5555 df-we 5557 df-xp 5606 df-rel 5607 df-cnv 5608 df-co 5609 df-dm 5610 df-rn 5611 df-res 5612 df-ima 5613 df-pred 6217 df-ord 6284 df-on 6285 df-lim 6286 df-suc 6287 df-iota 6410 df-fun 6460 df-fn 6461 df-f 6462 df-f1 6463 df-fo 6464 df-f1o 6465 df-fv 6466 df-riota 7264 df-ov 7310 df-oprab 7311 df-mpo 7312 df-om 7745 df-1st 7863 df-2nd 7864 df-supp 8009 df-frecs 8128 df-wrecs 8159 df-recs 8233 df-rdg 8272 df-1o 8328 df-er 8529 df-map 8648 df-ixp 8717 df-en 8765 df-dom 8766 df-sdom 8767 df-fin 8768 df-fsupp 9173 df-sup 9245 df-pnf 11057 df-mnf 11058 df-xr 11059 df-ltxr 11060 df-le 11061 df-sub 11253 df-neg 11254 df-nn 12020 df-2 12082 df-3 12083 df-4 12084 df-5 12085 df-6 12086 df-7 12087 df-8 12088 df-9 12089 df-n0 12280 df-z 12366 df-dec 12484 df-uz 12629 df-fz 13286 df-struct 16893 df-sets 16910 df-slot 16928 df-ndx 16940 df-base 16958 df-ress 16987 df-plusg 17020 df-mulr 17021 df-sca 17023 df-vsca 17024 df-ip 17025 df-tset 17026 df-ple 17027 df-ds 17029 df-hom 17031 df-cco 17032 df-0g 17197 df-prds 17203 df-pws 17205 df-mgm 18371 df-sgrp 18420 df-mnd 18431 df-grp 18625 df-ring 19830 df-sra 20479 df-rgmod 20480 df-dsmm 20984 df-frlm 20999 df-mat 21600 df-marrep 21752 |
This theorem is referenced by: minmar1cl 21845 smadiadetg 21867 submatminr1 31805 |
Copyright terms: Public domain | W3C validator |