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

Theorem mp2pm2mplem1 23117
Description: Lemma 1 for mp2pm2mp 23122. (Contributed by AV, 9-Oct-2019.) (Revised by AV, 5-Dec-2019.)
Hypotheses
Ref Expression
mp2pm2mp.a 𝐴 = (𝑁 Mat 𝑅)
mp2pm2mp.q 𝑄 = (Poly1‘𝐴)
mp2pm2mp.l 𝐿 = (Base‘𝑄)
mp2pm2mp.m · = ( ·𝑠 ‘𝑃)
mp2pm2mp.e 𝐸 = (.g‘(mulGrp‘𝑃))
mp2pm2mp.y 𝑌 = (var1‘𝑅)
mp2pm2mp.i 𝐼 = (𝑝 ∈ 𝐿 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1‘𝑝)‘𝑘)𝑗) · (𝑘𝐸𝑌))))))
Assertion
Ref Expression
mp2pm2mplem1 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑂 ∈ 𝐿) → (𝐼‘𝑂) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1‘𝑂)‘𝑘)𝑗) · (𝑘𝐸𝑌))))))
Distinct variable groups:   𝐸,𝑝   𝐿,𝑝   𝑖,𝑁,𝑗,𝑝   𝑖,𝑂,𝑗,𝑝   𝑘,𝑂,𝑝   𝑃,𝑝   𝑅,𝑝   𝑌,𝑝   · ,𝑝
Allowed substitution hints:   𝐴(𝑖, 𝑗, 𝑘, 𝑝)   𝑃(𝑖, 𝑗, 𝑘)   𝑄(𝑖, 𝑗, 𝑘, 𝑝)   𝑅(𝑖, 𝑗, 𝑘)   · (𝑖, 𝑗, 𝑘)   𝐸(𝑖, 𝑗, 𝑘)   𝐼(𝑖, 𝑗, 𝑘, 𝑝)   𝐿(𝑖, 𝑗, 𝑘)   𝑁(𝑘)   𝑌(𝑖, 𝑗, 𝑘)

Proof of Theorem mp2pm2mplem1
StepHypRef Expression
1 mp2pm2mp.i . 2 𝐼 = (𝑝 ∈ 𝐿 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1‘𝑝)‘𝑘)𝑗) · (𝑘𝐸𝑌))))))
2 fveq2 6883 . . . . . . . 8 (𝑝 = 𝑂 → (coe1‘𝑝) = (coe1‘𝑂))
32fveq1d 6885 . . . . . . 7 (𝑝 = 𝑂 → ((coe1‘𝑝)‘𝑘) = ((coe1‘𝑂)‘𝑘))
43oveqd 7435 . . . . . 6 (𝑝 = 𝑂 → (𝑖((coe1‘𝑝)‘𝑘)𝑗) = (𝑖((coe1‘𝑂)‘𝑘)𝑗))
54oveq1d 7433 . . . . 5 (𝑝 = 𝑂 → ((𝑖((coe1‘𝑝)‘𝑘)𝑗) · (𝑘𝐸𝑌)) = ((𝑖((coe1‘𝑂)‘𝑘)𝑗) · (𝑘𝐸𝑌)))
65mpteq2dv 5199 . . . 4 (𝑝 = 𝑂 → (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1‘𝑝)‘𝑘)𝑗) · (𝑘𝐸𝑌))) = (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1‘𝑂)‘𝑘)𝑗) · (𝑘𝐸𝑌))))
76oveq2d 7434 . . 3 (𝑝 = 𝑂 → (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1‘𝑝)‘𝑘)𝑗) · (𝑘𝐸𝑌)))) = (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1‘𝑂)‘𝑘)𝑗) · (𝑘𝐸𝑌)))))
87mpoeq3dv 7497 . 2 (𝑝 = 𝑂 → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1‘𝑝)‘𝑘)𝑗) · (𝑘𝐸𝑌))))) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1‘𝑂)‘𝑘)𝑗) · (𝑘𝐸𝑌))))))
9 simp3 1156 . 2 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑂 ∈ 𝐿) → 𝑂 ∈ 𝐿)
10 simp1 1154 . . 3 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑂 ∈ 𝐿) → 𝑁 ∈ Fin)
11 mpoexga 8088 . . 3 ((𝑁 ∈ Fin ∧ 𝑁 ∈ Fin) → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1‘𝑂)‘𝑘)𝑗) · (𝑘𝐸𝑌))))) ∈ V)
1210, 10, 11syl2anc 596 . 2 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑂 ∈ 𝐿) → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1‘𝑂)‘𝑘)𝑗) · (𝑘𝐸𝑌))))) ∈ V)
131, 8, 9, 12fvmptd3 7015 1 ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑂 ∈ 𝐿) → (𝐼‘𝑂) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝑖((coe1‘𝑂)‘𝑘)𝑗) · (𝑘𝐸𝑌))))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  Vcvv 3451   ↦ cmpt 5186  ‘cfv 6537  (class class class)co 7418   ∈ cmpo 7420  Fincfn 8966  ℕ0cn0 12599  Basecbs 17380   ·𝑠 cvsca 17425   Σg cgsu 17604  .gcmg 19270  mulGrpcmgp 20353  Ringcrg 20452  var1cv1 22487  Poly1cpl1 22488  coe1cco1 22489   Mat cmat 22715
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-1st 7999  df-2nd 8000
This theorem is used by:  mp2pm2mplem3  23119
  Copyright terms: Public domain W3C validator