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

Theorem cpm2mvalel 23074
Description: A (matrix) element of the result of an inverse matrix transformation. (Contributed by AV, 14-Dec-2019.)
Hypotheses
Ref Expression
cpm2mfval.i 𝐼 = (𝑁 cPolyMatToMat 𝑅)
cpm2mfval.s 𝑆 = (𝑁 ConstPolyMat 𝑅)
Assertion
Ref Expression
cpm2mvalel (((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝑆) ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁)) → (𝑋(𝐼‘𝑀)𝑌) = ((coe1‘(𝑋𝑀𝑌))‘0))

Proof of Theorem cpm2mvalel
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cpm2mfval.i . . . 4 𝐼 = (𝑁 cPolyMatToMat 𝑅)
2 cpm2mfval.s . . . 4 𝑆 = (𝑁 ConstPolyMat 𝑅)
31, 2cpm2mval 23073 . . 3 ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝑆) → (𝐼‘𝑀) = (𝑥 ∈ 𝑁, 𝑦 ∈ 𝑁 ↦ ((coe1‘(𝑥𝑀𝑦))‘0)))
43adantr 486 . 2 (((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝑆) ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁)) → (𝐼‘𝑀) = (𝑥 ∈ 𝑁, 𝑦 ∈ 𝑁 ↦ ((coe1‘(𝑥𝑀𝑦))‘0)))
5 oveq12 7429 . . . . 5 ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝑥𝑀𝑦) = (𝑋𝑀𝑌))
65fveq2d 6889 . . . 4 ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (coe1‘(𝑥𝑀𝑦)) = (coe1‘(𝑋𝑀𝑌)))
76fveq1d 6887 . . 3 ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → ((coe1‘(𝑥𝑀𝑦))‘0) = ((coe1‘(𝑋𝑀𝑌))‘0))
87adantl 487 . 2 ((((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝑆) ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁)) ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → ((coe1‘(𝑥𝑀𝑦))‘0) = ((coe1‘(𝑋𝑀𝑌))‘0))
9 simprl 783 . 2 (((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝑆) ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁)) → 𝑋 ∈ 𝑁)
10 simprr 785 . 2 (((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝑆) ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁)) → 𝑌 ∈ 𝑁)
11 fvexd 6900 . 2 (((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝑆) ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁)) → ((coe1‘(𝑋𝑀𝑌))‘0) ∈ V)
124, 8, 9, 10, 11ovmpod 7572 1 (((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝑆) ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁)) → (𝑋(𝐼‘𝑀)𝑌) = ((coe1‘(𝑋𝑀𝑌))‘0))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  Vcvv 3450  ‘cfv 6538  (class class class)co 7420   ∈ cmpo 7422  Fincfn 8976  0cc0 11203  coe1cco1 22501   ConstPolyMat ccpmat 23026   cPolyMatToMat ccpmat2mat 23028
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-cpmat2mat 23031
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator