Theorem mamuval 22587

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	⊢ (𝜑 → 𝑋 ∈ (𝐵 ↑m (𝑀 × 𝑁)))
mamuval.y	⊢ (𝜑 → 𝑌 ∈ (𝐵 ↑m (𝑁 × 𝑃)))

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.

Step	Hyp	Ref	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)
8	1, 2, 3, 4, 5, 6, 7	mamufval 22586	. 2 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ (𝐵 ↑m (𝑀 × 𝑁)), 𝑦 ∈ (𝐵 ↑m (𝑁 × 𝑃)) ↦ (𝑖 ∈ 𝑀, 𝑘 ∈ 𝑃 ↦ (𝑅 Σg (𝑗 ∈ 𝑁 ↦ ((𝑖𝑥𝑗) · (𝑗𝑦𝑘)))))))
9		oveq 7429	. . . . . . 7 ⊢ (𝑥 = 𝑋 → (𝑖𝑥𝑗) = (𝑖𝑋𝑗))
10		oveq 7429	. . . . . . 7 ⊢ (𝑦 = 𝑌 → (𝑗𝑦𝑘) = (𝑗𝑌𝑘))
11	9, 10	oveqan12d 7442	. . . . . 6 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → ((𝑖𝑥𝑗) · (𝑗𝑦𝑘)) = ((𝑖𝑋𝑗) · (𝑗𝑌𝑘)))
12	11	adantl 487	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → ((𝑖𝑥𝑗) · (𝑗𝑦𝑘)) = ((𝑖𝑋𝑗) · (𝑗𝑌𝑘)))
13	12	mpteq2dv 5210	. . . 4 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (𝑗 ∈ 𝑁 ↦ ((𝑖𝑥𝑗) · (𝑗𝑦𝑘))) = (𝑗 ∈ 𝑁 ↦ ((𝑖𝑋𝑗) · (𝑗𝑌𝑘))))
14	13	oveq2d 7439	. . 3 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (𝑅 Σg (𝑗 ∈ 𝑁 ↦ ((𝑖𝑥𝑗) · (𝑗𝑦𝑘)))) = (𝑅 Σg (𝑗 ∈ 𝑁 ↦ ((𝑖𝑋𝑗) · (𝑗𝑌𝑘)))))
15	14	mpoeq3dv 7502	. 2 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (𝑖 ∈ 𝑀, 𝑘 ∈ 𝑃 ↦ (𝑅 Σg (𝑗 ∈ 𝑁 ↦ ((𝑖𝑥𝑗) · (𝑗𝑦𝑘))))) = (𝑖 ∈ 𝑀, 𝑘 ∈ 𝑃 ↦ (𝑅 Σg (𝑗 ∈ 𝑁 ↦ ((𝑖𝑋𝑗) · (𝑗𝑌𝑘))))))
16		mamuval.x	. 2 ⊢ (𝜑 → 𝑋 ∈ (𝐵 ↑m (𝑀 × 𝑁)))
17		mamuval.y	. 2 ⊢ (𝜑 → 𝑌 ∈ (𝐵 ↑m (𝑁 × 𝑃)))
18		mpoexga 8083	. . 3 ⊢ ((𝑀 ∈ Fin ∧ 𝑃 ∈ Fin) → (𝑖 ∈ 𝑀, 𝑘 ∈ 𝑃 ↦ (𝑅 Σg (𝑗 ∈ 𝑁 ↦ ((𝑖𝑋𝑗) · (𝑗𝑌𝑘))))) ∈ V)
19	5, 7, 18	syl2anc 596	. 2 ⊢ (𝜑 → (𝑖 ∈ 𝑀, 𝑘 ∈ 𝑃 ↦ (𝑅 Σg (𝑗 ∈ 𝑁 ↦ ((𝑖𝑋𝑗) · (𝑗𝑌𝑘))))) ∈ V)
20	8, 15, 16, 17, 19	ovmpod 7575	1 ⊢ (𝜑 → (𝑋𝐹𝑌) = (𝑖 ∈ 𝑀, 𝑘 ∈ 𝑃 ↦ (𝑅 Σg (𝑗 ∈ 𝑁 ↦ ((𝑖𝑋𝑗) · (𝑗𝑌𝑘))))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2146  Vcvv 3458  ⟨cotp 4602   ↦ cmpt 5197   × cxp 5664  ‘cfv 6543  (class class class)co 7423   ∈ cmpo 7425   ↑_m cmap 8833  Fincfn 8952  Basecbs 17294  ._rcmulr 17336   Σ_g cgsu 17518   maMul cmmul 22584

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745

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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-ot 4603  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428  df-1st 7995  df-2nd 7996  df-mamu 22585

This theorem is used by:  mamufv  22588  mamures  22591  mamucl  22595  mpomatmul  22640  mamutpos  22652  mat1dimmul  22670  dmatmul  22691  madurid  22838  cramerimplem2  22878  mat2pmatmul  22925  decpmatmul  22966