m2cpminvid - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > m2cpminvid		Structured version Visualization version GIF version

Theorem m2cpminvid 22702

Description: The inverse transformation applied to the transformation of a matrix over a ring R results in the matrix itself. (Contributed by AV, 12-Nov-2019.) (Revised by AV, 13-Dec-2019.)

**Hypotheses**
Ref	Expression
m2cpminvid.i	⊢ 𝐼 = (𝑁 cPolyMatToMat 𝑅)
m2cpminvid.a	⊢ 𝐴 = (𝑁 Mat 𝑅)
m2cpminvid.k	⊢ 𝐾 = (Base‘𝐴)
m2cpminvid.t	⊢ 𝑇 = (𝑁 matToPolyMat 𝑅)

**Assertion**
Ref	Expression
m2cpminvid	⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐾) → (𝐼‘(𝑇‘𝑀)) = 𝑀)

Proof of Theorem m2cpminvid Dummy variables 𝑖 𝑗 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2737	. . . 4 ⊢ (𝑁 ConstPolyMat 𝑅) = (𝑁 ConstPolyMat 𝑅)
2		m2cpminvid.t	. . . 4 ⊢ 𝑇 = (𝑁 matToPolyMat 𝑅)
3		m2cpminvid.a	. . . 4 ⊢ 𝐴 = (𝑁 Mat 𝑅)
4		m2cpminvid.k	. . . 4 ⊢ 𝐾 = (Base‘𝐴)
5	1, 2, 3, 4	m2cpm 22690	. . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐾) → (𝑇‘𝑀) ∈ (𝑁 ConstPolyMat 𝑅))
6		m2cpminvid.i	. . . 4 ⊢ 𝐼 = (𝑁 cPolyMatToMat 𝑅)
7	6, 1	cpm2mval 22699	. . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ (𝑇‘𝑀) ∈ (𝑁 ConstPolyMat 𝑅)) → (𝐼‘(𝑇‘𝑀)) = (𝑥 ∈ 𝑁, 𝑦 ∈ 𝑁 ↦ ((coe₁‘(𝑥(𝑇‘𝑀)𝑦))‘0)))
8	5, 7	syld3an3 1412	. 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐾) → (𝐼‘(𝑇‘𝑀)) = (𝑥 ∈ 𝑁, 𝑦 ∈ 𝑁 ↦ ((coe₁‘(𝑥(𝑇‘𝑀)𝑦))‘0)))
9		eqid 2737	. . . . . . . 8 ⊢ (Poly₁‘𝑅) = (Poly₁‘𝑅)
10		eqid 2737	. . . . . . . 8 ⊢ (algSc‘(Poly₁‘𝑅)) = (algSc‘(Poly₁‘𝑅))
11	2, 3, 4, 9, 10	mat2pmatvalel 22674	. . . . . . 7 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐾) ∧ (𝑥 ∈ 𝑁 ∧ 𝑦 ∈ 𝑁)) → (𝑥(𝑇‘𝑀)𝑦) = ((algSc‘(Poly₁‘𝑅))‘(𝑥𝑀𝑦)))
12	11	3impb 1115	. . . . . 6 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐾) ∧ 𝑥 ∈ 𝑁 ∧ 𝑦 ∈ 𝑁) → (𝑥(𝑇‘𝑀)𝑦) = ((algSc‘(Poly₁‘𝑅))‘(𝑥𝑀𝑦)))
13	12	fveq2d 6839	. . . . 5 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐾) ∧ 𝑥 ∈ 𝑁 ∧ 𝑦 ∈ 𝑁) → (coe₁‘(𝑥(𝑇‘𝑀)𝑦)) = (coe₁‘((algSc‘(Poly₁‘𝑅))‘(𝑥𝑀𝑦))))
14	13	fveq1d 6837	. . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐾) ∧ 𝑥 ∈ 𝑁 ∧ 𝑦 ∈ 𝑁) → ((coe₁‘(𝑥(𝑇‘𝑀)𝑦))‘0) = ((coe₁‘((algSc‘(Poly₁‘𝑅))‘(𝑥𝑀𝑦)))‘0))
15		simp12 1206	. . . . 5 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐾) ∧ 𝑥 ∈ 𝑁 ∧ 𝑦 ∈ 𝑁) → 𝑅 ∈ Ring)
16		eqid 2737	. . . . . 6 ⊢ (Base‘𝑅) = (Base‘𝑅)
17		simp2 1138	. . . . . 6 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐾) ∧ 𝑥 ∈ 𝑁 ∧ 𝑦 ∈ 𝑁) → 𝑥 ∈ 𝑁)
18		simp3 1139	. . . . . 6 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐾) ∧ 𝑥 ∈ 𝑁 ∧ 𝑦 ∈ 𝑁) → 𝑦 ∈ 𝑁)
19		simp13 1207	. . . . . 6 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐾) ∧ 𝑥 ∈ 𝑁 ∧ 𝑦 ∈ 𝑁) → 𝑀 ∈ 𝐾)
20	3, 16, 4, 17, 18, 19	matecld 22375	. . . . 5 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐾) ∧ 𝑥 ∈ 𝑁 ∧ 𝑦 ∈ 𝑁) → (𝑥𝑀𝑦) ∈ (Base‘𝑅))
21	9, 10, 16	ply1sclid 22235	. . . . 5 ⊢ ((𝑅 ∈ Ring ∧ (𝑥𝑀𝑦) ∈ (Base‘𝑅)) → (𝑥𝑀𝑦) = ((coe₁‘((algSc‘(Poly₁‘𝑅))‘(𝑥𝑀𝑦)))‘0))
22	15, 20, 21	syl2anc 585	. . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐾) ∧ 𝑥 ∈ 𝑁 ∧ 𝑦 ∈ 𝑁) → (𝑥𝑀𝑦) = ((coe₁‘((algSc‘(Poly₁‘𝑅))‘(𝑥𝑀𝑦)))‘0))
23	14, 22	eqtr4d 2775	. . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐾) ∧ 𝑥 ∈ 𝑁 ∧ 𝑦 ∈ 𝑁) → ((coe₁‘(𝑥(𝑇‘𝑀)𝑦))‘0) = (𝑥𝑀𝑦))
24	23	mpoeq3dva 7438	. 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐾) → (𝑥 ∈ 𝑁, 𝑦 ∈ 𝑁 ↦ ((coe₁‘(𝑥(𝑇‘𝑀)𝑦))‘0)) = (𝑥 ∈ 𝑁, 𝑦 ∈ 𝑁 ↦ (𝑥𝑀𝑦)))
25		eqidd 2738	. . . . 5 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐾) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (𝑥 ∈ 𝑁, 𝑦 ∈ 𝑁 ↦ (𝑥𝑀𝑦)) = (𝑥 ∈ 𝑁, 𝑦 ∈ 𝑁 ↦ (𝑥𝑀𝑦)))
26		oveq12 7370	. . . . . 6 ⊢ ((𝑥 = 𝑖 ∧ 𝑦 = 𝑗) → (𝑥𝑀𝑦) = (𝑖𝑀𝑗))
27	26	adantl 481	. . . . 5 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐾) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ (𝑥 = 𝑖 ∧ 𝑦 = 𝑗)) → (𝑥𝑀𝑦) = (𝑖𝑀𝑗))
28		simprl 771	. . . . 5 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐾) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → 𝑖 ∈ 𝑁)
29		simprr 773	. . . . 5 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐾) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → 𝑗 ∈ 𝑁)
30		ovexd 7396	. . . . 5 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐾) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (𝑖𝑀𝑗) ∈ V)
31	25, 27, 28, 29, 30	ovmpod 7513	. . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐾) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (𝑖(𝑥 ∈ 𝑁, 𝑦 ∈ 𝑁 ↦ (𝑥𝑀𝑦))𝑗) = (𝑖𝑀𝑗))
32	31	ralrimivva 3180	. . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐾) → ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖(𝑥 ∈ 𝑁, 𝑦 ∈ 𝑁 ↦ (𝑥𝑀𝑦))𝑗) = (𝑖𝑀𝑗))
33		simp1 1137	. . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐾) → 𝑁 ∈ Fin)
34		simp2 1138	. . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐾) → 𝑅 ∈ Ring)
35	3, 16, 4, 33, 34, 20	matbas2d 22372	. . . 4 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐾) → (𝑥 ∈ 𝑁, 𝑦 ∈ 𝑁 ↦ (𝑥𝑀𝑦)) ∈ 𝐾)
36		simp3 1139	. . . 4 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐾) → 𝑀 ∈ 𝐾)
37	3, 4	eqmat 22373	. . . 4 ⊢ (((𝑥 ∈ 𝑁, 𝑦 ∈ 𝑁 ↦ (𝑥𝑀𝑦)) ∈ 𝐾 ∧ 𝑀 ∈ 𝐾) → ((𝑥 ∈ 𝑁, 𝑦 ∈ 𝑁 ↦ (𝑥𝑀𝑦)) = 𝑀 ↔ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖(𝑥 ∈ 𝑁, 𝑦 ∈ 𝑁 ↦ (𝑥𝑀𝑦))𝑗) = (𝑖𝑀𝑗)))
38	35, 36, 37	syl2anc 585	. . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐾) → ((𝑥 ∈ 𝑁, 𝑦 ∈ 𝑁 ↦ (𝑥𝑀𝑦)) = 𝑀 ↔ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖(𝑥 ∈ 𝑁, 𝑦 ∈ 𝑁 ↦ (𝑥𝑀𝑦))𝑗) = (𝑖𝑀𝑗)))
39	32, 38	mpbird 257	. 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐾) → (𝑥 ∈ 𝑁, 𝑦 ∈ 𝑁 ↦ (𝑥𝑀𝑦)) = 𝑀)
40	8, 24, 39	3eqtrd 2776	1 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐾) → (𝐼‘(𝑇‘𝑀)) = 𝑀)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ∀wral 3052 Vcvv 3441 ‘cfv 6493 (class class class)co 7361 ∈ cmpo 7363 Fincfn 8888 0cc0 11031 Basecbs 17141 Ringcrg 20173 algSccascl 21812 Poly₁cpl1 22122 coe₁cco1 22123 Mat cmat 22356 ConstPolyMat ccpmat 22652 matToPolyMat cmat2pmat 22653 cPolyMatToMat ccpmat2mat 22654

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 5225 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7683 ax-cnex 11087 ax-resscn 11088 ax-1cn 11089 ax-icn 11090 ax-addcl 11091 ax-addrcl 11092 ax-mulcl 11093 ax-mulrcl 11094 ax-mulcom 11095 ax-addass 11096 ax-mulass 11097 ax-distr 11098 ax-i2m1 11099 ax-1ne0 11100 ax-1rid 11101 ax-rnegex 11102 ax-rrecex 11103 ax-cnre 11104 ax-pre-lttri 11105 ax-pre-lttrn 11106 ax-pre-ltadd 11107 ax-pre-mulgt0 11108

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 3062 df-rmo 3351 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-tp 4586 df-op 4588 df-ot 4590 df-uni 4865 df-int 4904 df-iun 4949 df-iin 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-se 5579 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-isom 6502 df-riota 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-of 7625 df-ofr 7626 df-om 7812 df-1st 7936 df-2nd 7937 df-supp 8106 df-frecs 8226 df-wrecs 8257 df-recs 8306 df-rdg 8344 df-1o 8400 df-2o 8401 df-er 8638 df-map 8770 df-pm 8771 df-ixp 8841 df-en 8889 df-dom 8890 df-sdom 8891 df-fin 8892 df-fsupp 9270 df-sup 9350 df-oi 9420 df-card 9856 df-pnf 11173 df-mnf 11174 df-xr 11175 df-ltxr 11176 df-le 11177 df-sub 11371 df-neg 11372 df-nn 12151 df-2 12213 df-3 12214 df-4 12215 df-5 12216 df-6 12217 df-7 12218 df-8 12219 df-9 12220 df-n0 12407 df-z 12494 df-dec 12613 df-uz 12757 df-fz 13429 df-fzo 13576 df-seq 13930 df-hash 14259 df-struct 17079 df-sets 17096 df-slot 17114 df-ndx 17126 df-base 17142 df-ress 17163 df-plusg 17195 df-mulr 17196 df-sca 17198 df-vsca 17199 df-ip 17200 df-tset 17201 df-ple 17202 df-ds 17204 df-hom 17206 df-cco 17207 df-0g 17366 df-gsum 17367 df-prds 17372 df-pws 17374 df-mre 17510 df-mrc 17511 df-acs 17513 df-mgm 18570 df-sgrp 18649 df-mnd 18665 df-mhm 18713 df-submnd 18714 df-grp 18871 df-minusg 18872 df-sbg 18873 df-mulg 19003 df-subg 19058 df-ghm 19147 df-cntz 19251 df-cmn 19716 df-abl 19717 df-mgp 20081 df-rng 20093 df-ur 20122 df-ring 20175 df-subrng 20484 df-subrg 20508 df-lmod 20818 df-lss 20888 df-sra 21130 df-rgmod 21131 df-dsmm 21692 df-frlm 21707 df-ascl 21815 df-psr 21870 df-mvr 21871 df-mpl 21872 df-opsr 21874 df-psr1 22125 df-vr1 22126 df-ply1 22127 df-coe1 22128 df-mat 22357 df-cpmat 22655 df-mat2pmat 22656 df-cpmat2mat 22657

This theorem is referenced by: m2cpminv 22709 m2cpminv0 22710 cayhamlem4 22837

W3C validator