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

Theorem marrepval 21147
Description: Third substitution for the definition of the matrix row replacement function. (Contributed by AV, 12-Feb-2019.)
Hypotheses
Ref Expression
marrepfval.a 𝐴 = (𝑁 Mat 𝑅)
marrepfval.b 𝐵 = (Base‘𝐴)
marrepfval.q 𝑄 = (𝑁 matRRep 𝑅)
marrepfval.z 0 = (0g𝑅)
Assertion
Ref Expression
marrepval (((𝑀𝐵𝑆 ∈ (Base‘𝑅)) ∧ (𝐾𝑁𝐿𝑁)) → (𝐾(𝑀𝑄𝑆)𝐿) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 𝑆, 0 ), (𝑖𝑀𝑗))))
Distinct variable groups:   𝑖,𝑁,𝑗   𝑅,𝑖,𝑗   𝑖,𝑀,𝑗   𝑆,𝑖,𝑗   𝑖,𝐾,𝑗   𝑖,𝐿,𝑗
Allowed substitution hints:   𝐴(𝑖,𝑗)   𝐵(𝑖,𝑗)   𝑄(𝑖,𝑗)   0 (𝑖,𝑗)

Proof of Theorem marrepval
Dummy variables 𝑘 𝑙 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 marrepfval.a . . . 4 𝐴 = (𝑁 Mat 𝑅)
2 marrepfval.b . . . 4 𝐵 = (Base‘𝐴)
3 marrepfval.q . . . 4 𝑄 = (𝑁 matRRep 𝑅)
4 marrepfval.z . . . 4 0 = (0g𝑅)
51, 2, 3, 4marrepval0 21146 . . 3 ((𝑀𝐵𝑆 ∈ (Base‘𝑅)) → (𝑀𝑄𝑆) = (𝑘𝑁, 𝑙𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 𝑆, 0 ), (𝑖𝑀𝑗)))))
65adantr 484 . 2 (((𝑀𝐵𝑆 ∈ (Base‘𝑅)) ∧ (𝐾𝑁𝐿𝑁)) → (𝑀𝑄𝑆) = (𝑘𝑁, 𝑙𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 𝑆, 0 ), (𝑖𝑀𝑗)))))
7 simprl 770 . . 3 (((𝑀𝐵𝑆 ∈ (Base‘𝑅)) ∧ (𝐾𝑁𝐿𝑁)) → 𝐾𝑁)
8 simplrr 777 . . 3 ((((𝑀𝐵𝑆 ∈ (Base‘𝑅)) ∧ (𝐾𝑁𝐿𝑁)) ∧ 𝑘 = 𝐾) → 𝐿𝑁)
91, 2matrcl 20997 . . . . . . 7 (𝑀𝐵 → (𝑁 ∈ Fin ∧ 𝑅 ∈ V))
109simpld 498 . . . . . 6 (𝑀𝐵𝑁 ∈ Fin)
1110, 10jca 515 . . . . 5 (𝑀𝐵 → (𝑁 ∈ Fin ∧ 𝑁 ∈ Fin))
1211ad3antrrr 729 . . . 4 ((((𝑀𝐵𝑆 ∈ (Base‘𝑅)) ∧ (𝐾𝑁𝐿𝑁)) ∧ (𝑘 = 𝐾𝑙 = 𝐿)) → (𝑁 ∈ Fin ∧ 𝑁 ∈ Fin))
13 mpoexga 7750 . . . 4 ((𝑁 ∈ Fin ∧ 𝑁 ∈ Fin) → (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 𝑆, 0 ), (𝑖𝑀𝑗))) ∈ V)
1412, 13syl 17 . . 3 ((((𝑀𝐵𝑆 ∈ (Base‘𝑅)) ∧ (𝐾𝑁𝐿𝑁)) ∧ (𝑘 = 𝐾𝑙 = 𝐿)) → (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 𝑆, 0 ), (𝑖𝑀𝑗))) ∈ V)
15 eqeq2 2833 . . . . . . 7 (𝑘 = 𝐾 → (𝑖 = 𝑘𝑖 = 𝐾))
1615adantr 484 . . . . . 6 ((𝑘 = 𝐾𝑙 = 𝐿) → (𝑖 = 𝑘𝑖 = 𝐾))
17 eqeq2 2833 . . . . . . . 8 (𝑙 = 𝐿 → (𝑗 = 𝑙𝑗 = 𝐿))
1817ifbid 4462 . . . . . . 7 (𝑙 = 𝐿 → if(𝑗 = 𝑙, 𝑆, 0 ) = if(𝑗 = 𝐿, 𝑆, 0 ))
1918adantl 485 . . . . . 6 ((𝑘 = 𝐾𝑙 = 𝐿) → if(𝑗 = 𝑙, 𝑆, 0 ) = if(𝑗 = 𝐿, 𝑆, 0 ))
2016, 19ifbieq1d 4463 . . . . 5 ((𝑘 = 𝐾𝑙 = 𝐿) → if(𝑖 = 𝑘, if(𝑗 = 𝑙, 𝑆, 0 ), (𝑖𝑀𝑗)) = if(𝑖 = 𝐾, if(𝑗 = 𝐿, 𝑆, 0 ), (𝑖𝑀𝑗)))
2120mpoeq3dv 7207 . . . 4 ((𝑘 = 𝐾𝑙 = 𝐿) → (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 𝑆, 0 ), (𝑖𝑀𝑗))) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 𝑆, 0 ), (𝑖𝑀𝑗))))
2221adantl 485 . . 3 ((((𝑀𝐵𝑆 ∈ (Base‘𝑅)) ∧ (𝐾𝑁𝐿𝑁)) ∧ (𝑘 = 𝐾𝑙 = 𝐿)) → (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 𝑆, 0 ), (𝑖𝑀𝑗))) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 𝑆, 0 ), (𝑖𝑀𝑗))))
237, 8, 14, 22ovmpodv2 7282 . 2 (((𝑀𝐵𝑆 ∈ (Base‘𝑅)) ∧ (𝐾𝑁𝐿𝑁)) → ((𝑀𝑄𝑆) = (𝑘𝑁, 𝑙𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 𝑆, 0 ), (𝑖𝑀𝑗)))) → (𝐾(𝑀𝑄𝑆)𝐿) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 𝑆, 0 ), (𝑖𝑀𝑗)))))
246, 23mpd 15 1 (((𝑀𝐵𝑆 ∈ (Base‘𝑅)) ∧ (𝐾𝑁𝐿𝑁)) → (𝐾(𝑀𝑄𝑆)𝐿) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 𝑆, 0 ), (𝑖𝑀𝑗))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399   = wceq 1538  wcel 2115  Vcvv 3471  ifcif 4440  cfv 6328  (class class class)co 7130  cmpo 7132  Fincfn 8484  Basecbs 16462  0gc0g 16692   Mat cmat 20992   matRRep cmarrep 21141
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2178  ax-ext 2793  ax-rep 5163  ax-sep 5176  ax-nul 5183  ax-pow 5239  ax-pr 5303  ax-un 7436
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-mo 2623  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2892  df-nfc 2960  df-ne 3008  df-ral 3131  df-rex 3132  df-reu 3133  df-rab 3135  df-v 3473  df-sbc 3750  df-csb 3858  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4267  df-if 4441  df-pw 4514  df-sn 4541  df-pr 4543  df-op 4547  df-uni 4812  df-iun 4894  df-br 5040  df-opab 5102  df-mpt 5120  df-id 5433  df-xp 5534  df-rel 5535  df-cnv 5536  df-co 5537  df-dm 5538  df-rn 5539  df-res 5540  df-ima 5541  df-iota 6287  df-fun 6330  df-fn 6331  df-f 6332  df-f1 6333  df-fo 6334  df-f1o 6335  df-fv 6336  df-ov 7133  df-oprab 7134  df-mpo 7135  df-1st 7664  df-2nd 7665  df-slot 16466  df-base 16468  df-mat 20993  df-marrep 21143
This theorem is referenced by:  marrepeval  21148  marrepcl  21149  1marepvmarrepid  21160  smadiadetglem1  21256  smadiadetglem2  21257  madjusmdetlem1  31103
  Copyright terms: Public domain W3C validator