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

Theorem cpm2mfval 22669
Description: Value of the inverse matrix transformation. (Contributed by AV, 14-Dec-2019.)
Hypotheses
Ref Expression
cpm2mfval.i 𝐼 = (𝑁 cPolyMatToMat 𝑅)
cpm2mfval.s 𝑆 = (𝑁 ConstPolyMat 𝑅)
Assertion
Ref Expression
cpm2mfval ((𝑁 ∈ Fin ∧ 𝑅𝑉) → 𝐼 = (𝑚𝑆 ↦ (𝑥𝑁, 𝑦𝑁 ↦ ((coe1‘(𝑥𝑚𝑦))‘0))))
Distinct variable groups:   𝑚,𝑁,𝑥,𝑦   𝑅,𝑚,𝑥,𝑦   𝑆,𝑚
Allowed substitution hints:   𝑆(𝑥,𝑦)   𝐼(𝑥,𝑦,𝑚)   𝑉(𝑥,𝑦,𝑚)

Proof of Theorem cpm2mfval
Dummy variables 𝑛 𝑟 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cpm2mfval.i . 2 𝐼 = (𝑁 cPolyMatToMat 𝑅)
2 df-cpmat2mat 22628 . . . 4 cPolyMatToMat = (𝑛 ∈ Fin, 𝑟 ∈ V ↦ (𝑚 ∈ (𝑛 ConstPolyMat 𝑟) ↦ (𝑥𝑛, 𝑦𝑛 ↦ ((coe1‘(𝑥𝑚𝑦))‘0))))
32a1i 11 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → cPolyMatToMat = (𝑛 ∈ Fin, 𝑟 ∈ V ↦ (𝑚 ∈ (𝑛 ConstPolyMat 𝑟) ↦ (𝑥𝑛, 𝑦𝑛 ↦ ((coe1‘(𝑥𝑚𝑦))‘0)))))
4 oveq12 7425 . . . . . 6 ((𝑛 = 𝑁𝑟 = 𝑅) → (𝑛 ConstPolyMat 𝑟) = (𝑁 ConstPolyMat 𝑅))
5 cpm2mfval.s . . . . . 6 𝑆 = (𝑁 ConstPolyMat 𝑅)
64, 5eqtr4di 2783 . . . . 5 ((𝑛 = 𝑁𝑟 = 𝑅) → (𝑛 ConstPolyMat 𝑟) = 𝑆)
7 simpl 481 . . . . . 6 ((𝑛 = 𝑁𝑟 = 𝑅) → 𝑛 = 𝑁)
8 eqidd 2726 . . . . . 6 ((𝑛 = 𝑁𝑟 = 𝑅) → ((coe1‘(𝑥𝑚𝑦))‘0) = ((coe1‘(𝑥𝑚𝑦))‘0))
97, 7, 8mpoeq123dv 7492 . . . . 5 ((𝑛 = 𝑁𝑟 = 𝑅) → (𝑥𝑛, 𝑦𝑛 ↦ ((coe1‘(𝑥𝑚𝑦))‘0)) = (𝑥𝑁, 𝑦𝑁 ↦ ((coe1‘(𝑥𝑚𝑦))‘0)))
106, 9mpteq12dv 5234 . . . 4 ((𝑛 = 𝑁𝑟 = 𝑅) → (𝑚 ∈ (𝑛 ConstPolyMat 𝑟) ↦ (𝑥𝑛, 𝑦𝑛 ↦ ((coe1‘(𝑥𝑚𝑦))‘0))) = (𝑚𝑆 ↦ (𝑥𝑁, 𝑦𝑁 ↦ ((coe1‘(𝑥𝑚𝑦))‘0))))
1110adantl 480 . . 3 (((𝑁 ∈ Fin ∧ 𝑅𝑉) ∧ (𝑛 = 𝑁𝑟 = 𝑅)) → (𝑚 ∈ (𝑛 ConstPolyMat 𝑟) ↦ (𝑥𝑛, 𝑦𝑛 ↦ ((coe1‘(𝑥𝑚𝑦))‘0))) = (𝑚𝑆 ↦ (𝑥𝑁, 𝑦𝑁 ↦ ((coe1‘(𝑥𝑚𝑦))‘0))))
12 simpl 481 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → 𝑁 ∈ Fin)
13 elex 3482 . . . 4 (𝑅𝑉𝑅 ∈ V)
1413adantl 480 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → 𝑅 ∈ V)
155ovexi 7450 . . . 4 𝑆 ∈ V
16 mptexg 7229 . . . 4 (𝑆 ∈ V → (𝑚𝑆 ↦ (𝑥𝑁, 𝑦𝑁 ↦ ((coe1‘(𝑥𝑚𝑦))‘0))) ∈ V)
1715, 16mp1i 13 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → (𝑚𝑆 ↦ (𝑥𝑁, 𝑦𝑁 ↦ ((coe1‘(𝑥𝑚𝑦))‘0))) ∈ V)
183, 11, 12, 14, 17ovmpod 7570 . 2 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → (𝑁 cPolyMatToMat 𝑅) = (𝑚𝑆 ↦ (𝑥𝑁, 𝑦𝑁 ↦ ((coe1‘(𝑥𝑚𝑦))‘0))))
191, 18eqtrid 2777 1 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → 𝐼 = (𝑚𝑆 ↦ (𝑥𝑁, 𝑦𝑁 ↦ ((coe1‘(𝑥𝑚𝑦))‘0))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 394   = wceq 1533  wcel 2098  Vcvv 3463  cmpt 5226  cfv 6543  (class class class)co 7416  cmpo 7418  Fincfn 8962  0cc0 11138  coe1cco1 22105   ConstPolyMat ccpmat 22623   cPolyMatToMat ccpmat2mat 22625
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2696  ax-rep 5280  ax-sep 5294  ax-nul 5301  ax-pr 5423
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2703  df-cleq 2717  df-clel 2802  df-nfc 2877  df-ne 2931  df-ral 3052  df-rex 3061  df-reu 3365  df-rab 3420  df-v 3465  df-sbc 3769  df-csb 3885  df-dif 3942  df-un 3944  df-in 3946  df-ss 3956  df-nul 4319  df-if 4525  df-sn 4625  df-pr 4627  df-op 4631  df-uni 4904  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5227  df-id 5570  df-xp 5678  df-rel 5679  df-cnv 5680  df-co 5681  df-dm 5682  df-rn 5683  df-res 5684  df-ima 5685  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7419  df-oprab 7420  df-mpo 7421  df-cpmat2mat 22628
This theorem is referenced by:  cpm2mval  22670  cpm2mf  22672  m2cpmfo  22676  cayleyhamiltonALT  22811
  Copyright terms: Public domain W3C validator