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

Theorem cpm2mval 21361
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 21360 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → 𝐼 = (𝑚𝑆 ↦ (𝑥𝑁, 𝑦𝑁 ↦ ((coe1‘(𝑥𝑚𝑦))‘0))))
433adant3 1128 . 2 ((𝑁 ∈ Fin ∧ 𝑅𝑉𝑀𝑆) → 𝐼 = (𝑚𝑆 ↦ (𝑥𝑁, 𝑦𝑁 ↦ ((coe1‘(𝑥𝑚𝑦))‘0))))
5 oveq 7165 . . . . . 6 (𝑚 = 𝑀 → (𝑥𝑚𝑦) = (𝑥𝑀𝑦))
65fveq2d 6677 . . . . 5 (𝑚 = 𝑀 → (coe1‘(𝑥𝑚𝑦)) = (coe1‘(𝑥𝑀𝑦)))
76fveq1d 6675 . . . 4 (𝑚 = 𝑀 → ((coe1‘(𝑥𝑚𝑦))‘0) = ((coe1‘(𝑥𝑀𝑦))‘0))
87mpoeq3dv 7236 . . 3 (𝑚 = 𝑀 → (𝑥𝑁, 𝑦𝑁 ↦ ((coe1‘(𝑥𝑚𝑦))‘0)) = (𝑥𝑁, 𝑦𝑁 ↦ ((coe1‘(𝑥𝑀𝑦))‘0)))
98adantl 484 . 2 (((𝑁 ∈ Fin ∧ 𝑅𝑉𝑀𝑆) ∧ 𝑚 = 𝑀) → (𝑥𝑁, 𝑦𝑁 ↦ ((coe1‘(𝑥𝑚𝑦))‘0)) = (𝑥𝑁, 𝑦𝑁 ↦ ((coe1‘(𝑥𝑀𝑦))‘0)))
10 simp3 1134 . 2 ((𝑁 ∈ Fin ∧ 𝑅𝑉𝑀𝑆) → 𝑀𝑆)
11 simp1 1132 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉𝑀𝑆) → 𝑁 ∈ Fin)
12 mpoexga 7778 . . 3 ((𝑁 ∈ Fin ∧ 𝑁 ∈ Fin) → (𝑥𝑁, 𝑦𝑁 ↦ ((coe1‘(𝑥𝑀𝑦))‘0)) ∈ V)
1311, 11, 12syl2anc 586 . 2 ((𝑁 ∈ Fin ∧ 𝑅𝑉𝑀𝑆) → (𝑥𝑁, 𝑦𝑁 ↦ ((coe1‘(𝑥𝑀𝑦))‘0)) ∈ V)
144, 9, 10, 13fvmptd 6778 1 ((𝑁 ∈ Fin ∧ 𝑅𝑉𝑀𝑆) → (𝐼𝑀) = (𝑥𝑁, 𝑦𝑁 ↦ ((coe1‘(𝑥𝑀𝑦))‘0)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1083   = wceq 1536  wcel 2113  Vcvv 3497  cmpt 5149  cfv 6358  (class class class)co 7159  cmpo 7161  Fincfn 8512  0cc0 10540  coe1cco1 20349   ConstPolyMat ccpmat 21314   cPolyMatToMat ccpmat2mat 21316
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
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  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-ral 3146  df-rex 3147  df-reu 3148  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-nul 4295  df-if 4471  df-pw 4544  df-sn 4571  df-pr 4573  df-op 4577  df-uni 4842  df-iun 4924  df-br 5070  df-opab 5132  df-mpt 5150  df-id 5463  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-iota 6317  df-fun 6360  df-fn 6361  df-f 6362  df-f1 6363  df-fo 6364  df-f1o 6365  df-fv 6366  df-ov 7162  df-oprab 7163  df-mpo 7164  df-1st 7692  df-2nd 7693  df-cpmat2mat 21319
This theorem is referenced by:  cpm2mvalel  21362  m2cpminvid  21364  m2cpminvid2  21366
  Copyright terms: Public domain W3C validator