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

Theorem cpm2mvalel 23102
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 23101 . . 3 ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝑆) → (𝐼‘𝑀) = (𝑥 ∈ 𝑁, 𝑦 ∈ 𝑁 ↦ ((coe1‘(𝑥𝑀𝑦))‘0)))
43adantr 486 . 2 (((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝑆) ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁)) → (𝐼‘𝑀) = (𝑥 ∈ 𝑁, 𝑦 ∈ 𝑁 ↦ ((coe1‘(𝑥𝑀𝑦))‘0)))
5 oveq12 7455 . . . . 5 ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝑥𝑀𝑦) = (𝑋𝑀𝑌))
65fveq2d 6915 . . . 4 ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (coe1‘(𝑥𝑀𝑦)) = (coe1‘(𝑋𝑀𝑌)))
76fveq1d 6913 . . 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 6926 . 2 (((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝑆) ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁)) → ((coe1‘(𝑋𝑀𝑌))‘0) ∈ V)
124, 8, 9, 10, 11ovmpod 7599 1 (((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝑆) ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁)) → (𝑋(𝐼‘𝑀)𝑌) = ((coe1‘(𝑋𝑀𝑌))‘0))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  Vcvv 3454  ‘cfv 6561  (class class class)co 7446   ∈ cmpo 7448  Fincfn 9004  0cc0 11230  coe1cco1 22529   ConstPolyMat ccpmat 23054   cPolyMatToMat ccpmat2mat 23056
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5236  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7778
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7449  df-oprab 7450  df-mpo 7451  df-1st 8028  df-2nd 8029  df-cpmat2mat 23059
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator