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

Theorem mamuval 20011
 Description: Multiplication of two matrices. (Contributed by Stefan O'Rear, 2-Sep-2015.)
Hypotheses
Ref Expression
mamufval.f 𝐹 = (𝑅 maMul ⟨𝑀, 𝑁, 𝑃⟩)
mamufval.b 𝐵 = (Base‘𝑅)
mamufval.t · = (.r𝑅)
mamufval.r (𝜑𝑅𝑉)
mamufval.m (𝜑𝑀 ∈ Fin)
mamufval.n (𝜑𝑁 ∈ Fin)
mamufval.p (𝜑𝑃 ∈ Fin)
mamuval.x (𝜑𝑋 ∈ (𝐵𝑚 (𝑀 × 𝑁)))
mamuval.y (𝜑𝑌 ∈ (𝐵𝑚 (𝑁 × 𝑃)))
Assertion
Ref Expression
mamuval (𝜑 → (𝑋𝐹𝑌) = (𝑖𝑀, 𝑘𝑃 ↦ (𝑅 Σg (𝑗𝑁 ↦ ((𝑖𝑋𝑗) · (𝑗𝑌𝑘))))))
Distinct variable groups:   𝑖,𝑗,𝑘,𝑀   𝑖,𝑁,𝑗,𝑘   𝑃,𝑖,𝑗,𝑘   𝑅,𝑖,𝑗,𝑘   𝑖,𝑋,𝑗,𝑘   𝑖,𝑌,𝑗,𝑘   𝜑,𝑖,𝑗,𝑘   · ,𝑖,𝑘
Allowed substitution hints:   𝐵(𝑖,𝑗,𝑘)   · (𝑗)   𝐹(𝑖,𝑗,𝑘)   𝑉(𝑖,𝑗,𝑘)

Proof of Theorem mamuval
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 mamufval.f . . 3 𝐹 = (𝑅 maMul ⟨𝑀, 𝑁, 𝑃⟩)
2 mamufval.b . . 3 𝐵 = (Base‘𝑅)
3 mamufval.t . . 3 · = (.r𝑅)
4 mamufval.r . . 3 (𝜑𝑅𝑉)
5 mamufval.m . . 3 (𝜑𝑀 ∈ Fin)
6 mamufval.n . . 3 (𝜑𝑁 ∈ Fin)
7 mamufval.p . . 3 (𝜑𝑃 ∈ Fin)
81, 2, 3, 4, 5, 6, 7mamufval 20010 . 2 (𝜑𝐹 = (𝑥 ∈ (𝐵𝑚 (𝑀 × 𝑁)), 𝑦 ∈ (𝐵𝑚 (𝑁 × 𝑃)) ↦ (𝑖𝑀, 𝑘𝑃 ↦ (𝑅 Σg (𝑗𝑁 ↦ ((𝑖𝑥𝑗) · (𝑗𝑦𝑘)))))))
9 oveq 6555 . . . . . . 7 (𝑥 = 𝑋 → (𝑖𝑥𝑗) = (𝑖𝑋𝑗))
10 oveq 6555 . . . . . . 7 (𝑦 = 𝑌 → (𝑗𝑦𝑘) = (𝑗𝑌𝑘))
119, 10oveqan12d 6568 . . . . . 6 ((𝑥 = 𝑋𝑦 = 𝑌) → ((𝑖𝑥𝑗) · (𝑗𝑦𝑘)) = ((𝑖𝑋𝑗) · (𝑗𝑌𝑘)))
1211adantl 481 . . . . 5 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → ((𝑖𝑥𝑗) · (𝑗𝑦𝑘)) = ((𝑖𝑋𝑗) · (𝑗𝑌𝑘)))
1312mpteq2dv 4673 . . . 4 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → (𝑗𝑁 ↦ ((𝑖𝑥𝑗) · (𝑗𝑦𝑘))) = (𝑗𝑁 ↦ ((𝑖𝑋𝑗) · (𝑗𝑌𝑘))))
1413oveq2d 6565 . . 3 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → (𝑅 Σg (𝑗𝑁 ↦ ((𝑖𝑥𝑗) · (𝑗𝑦𝑘)))) = (𝑅 Σg (𝑗𝑁 ↦ ((𝑖𝑋𝑗) · (𝑗𝑌𝑘)))))
1514mpt2eq3dv 6619 . 2 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → (𝑖𝑀, 𝑘𝑃 ↦ (𝑅 Σg (𝑗𝑁 ↦ ((𝑖𝑥𝑗) · (𝑗𝑦𝑘))))) = (𝑖𝑀, 𝑘𝑃 ↦ (𝑅 Σg (𝑗𝑁 ↦ ((𝑖𝑋𝑗) · (𝑗𝑌𝑘))))))
16 mamuval.x . 2 (𝜑𝑋 ∈ (𝐵𝑚 (𝑀 × 𝑁)))
17 mamuval.y . 2 (𝜑𝑌 ∈ (𝐵𝑚 (𝑁 × 𝑃)))
18 mpt2exga 7135 . . 3 ((𝑀 ∈ Fin ∧ 𝑃 ∈ Fin) → (𝑖𝑀, 𝑘𝑃 ↦ (𝑅 Σg (𝑗𝑁 ↦ ((𝑖𝑋𝑗) · (𝑗𝑌𝑘))))) ∈ V)
195, 7, 18syl2anc 691 . 2 (𝜑 → (𝑖𝑀, 𝑘𝑃 ↦ (𝑅 Σg (𝑗𝑁 ↦ ((𝑖𝑋𝑗) · (𝑗𝑌𝑘))))) ∈ V)
208, 15, 16, 17, 19ovmpt2d 6686 1 (𝜑 → (𝑋𝐹𝑌) = (𝑖𝑀, 𝑘𝑃 ↦ (𝑅 Σg (𝑗𝑁 ↦ ((𝑖𝑋𝑗) · (𝑗𝑌𝑘))))))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977  Vcvv 3173  ⟨cotp 4133   ↦ cmpt 4643   × cxp 5036  ‘cfv 5804  (class class class)co 6549   ↦ cmpt2 6551   ↑𝑚 cmap 7744  Fincfn 7841  Basecbs 15695  .rcmulr 15769   Σg cgsu 15924   maMul cmmul 20008 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-ot 4134  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-1st 7059  df-2nd 7060  df-mamu 20009 This theorem is referenced by:  mamufv  20012  mamures  20015  mamucl  20026  mpt2matmul  20071  mamutpos  20083  mat1dimmul  20101  dmatmul  20122  madurid  20269  cramerimplem2  20309  mat2pmatmul  20355  decpmatmul  20396
 Copyright terms: Public domain W3C validator