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

Theorem cpm2mval 22706
Description: The result of an inverse matrix transformation. (Contributed by AV, 12-Nov-2019.) (Revised by AV, 14-Dec-2019.)
Hypotheses
Ref Expression
cpm2mfval.i 𝐼 = (𝑁 cPolyMatToMat 𝑅)
cpm2mfval.s 𝑆 = (𝑁 ConstPolyMat 𝑅)
Assertion
Ref Expression
cpm2mval ((𝑁 ∈ Fin ∧ 𝑅𝑉𝑀𝑆) → (𝐼𝑀) = (𝑥𝑁, 𝑦𝑁 ↦ ((coe1‘(𝑥𝑀𝑦))‘0)))
Distinct variable groups:   𝑥,𝑁,𝑦   𝑥,𝑅,𝑦   𝑥,𝑀,𝑦
Allowed substitution hints:   𝑆(𝑥,𝑦)   𝐼(𝑥,𝑦)   𝑉(𝑥,𝑦)

Proof of Theorem cpm2mval
Dummy variable 𝑚 is distinct from all other variables.
StepHypRef Expression
1 cpm2mfval.i . . . 4 𝐼 = (𝑁 cPolyMatToMat 𝑅)
2 cpm2mfval.s . . . 4 𝑆 = (𝑁 ConstPolyMat 𝑅)
31, 2cpm2mfval 22705 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → 𝐼 = (𝑚𝑆 ↦ (𝑥𝑁, 𝑦𝑁 ↦ ((coe1‘(𝑥𝑚𝑦))‘0))))
433adant3 1133 . 2 ((𝑁 ∈ Fin ∧ 𝑅𝑉𝑀𝑆) → 𝐼 = (𝑚𝑆 ↦ (𝑥𝑁, 𝑦𝑁 ↦ ((coe1‘(𝑥𝑚𝑦))‘0))))
5 oveq 7374 . . . . . 6 (𝑚 = 𝑀 → (𝑥𝑚𝑦) = (𝑥𝑀𝑦))
65fveq2d 6846 . . . . 5 (𝑚 = 𝑀 → (coe1‘(𝑥𝑚𝑦)) = (coe1‘(𝑥𝑀𝑦)))
76fveq1d 6844 . . . 4 (𝑚 = 𝑀 → ((coe1‘(𝑥𝑚𝑦))‘0) = ((coe1‘(𝑥𝑀𝑦))‘0))
87mpoeq3dv 7447 . . 3 (𝑚 = 𝑀 → (𝑥𝑁, 𝑦𝑁 ↦ ((coe1‘(𝑥𝑚𝑦))‘0)) = (𝑥𝑁, 𝑦𝑁 ↦ ((coe1‘(𝑥𝑀𝑦))‘0)))
98adantl 481 . 2 (((𝑁 ∈ Fin ∧ 𝑅𝑉𝑀𝑆) ∧ 𝑚 = 𝑀) → (𝑥𝑁, 𝑦𝑁 ↦ ((coe1‘(𝑥𝑚𝑦))‘0)) = (𝑥𝑁, 𝑦𝑁 ↦ ((coe1‘(𝑥𝑀𝑦))‘0)))
10 simp3 1139 . 2 ((𝑁 ∈ Fin ∧ 𝑅𝑉𝑀𝑆) → 𝑀𝑆)
11 simp1 1137 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉𝑀𝑆) → 𝑁 ∈ Fin)
12 mpoexga 8031 . . 3 ((𝑁 ∈ Fin ∧ 𝑁 ∈ Fin) → (𝑥𝑁, 𝑦𝑁 ↦ ((coe1‘(𝑥𝑀𝑦))‘0)) ∈ V)
1311, 11, 12syl2anc 585 . 2 ((𝑁 ∈ Fin ∧ 𝑅𝑉𝑀𝑆) → (𝑥𝑁, 𝑦𝑁 ↦ ((coe1‘(𝑥𝑀𝑦))‘0)) ∈ V)
144, 9, 10, 13fvmptd 6957 1 ((𝑁 ∈ Fin ∧ 𝑅𝑉𝑀𝑆) → (𝐼𝑀) = (𝑥𝑁, 𝑦𝑁 ↦ ((coe1‘(𝑥𝑀𝑦))‘0)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1087   = wceq 1542  wcel 2114  Vcvv 3442  cmpt 5181  cfv 6500  (class class class)co 7368  cmpo 7370  Fincfn 8895  0cc0 11038  coe1cco1 22130   ConstPolyMat ccpmat 22659   cPolyMatToMat ccpmat2mat 22661
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 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  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-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-ov 7371  df-oprab 7372  df-mpo 7373  df-1st 7943  df-2nd 7944  df-cpmat2mat 22664
This theorem is referenced by:  cpm2mvalel  22707  m2cpminvid  22709  m2cpminvid2  22711
  Copyright terms: Public domain W3C validator