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

Theorem marrepval 20585
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 20584 . . 3 ((𝑀𝐵𝑆 ∈ (Base‘𝑅)) → (𝑀𝑄𝑆) = (𝑘𝑁, 𝑙𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 𝑆, 0 ), (𝑖𝑀𝑗)))))
65adantr 466 . 2 (((𝑀𝐵𝑆 ∈ (Base‘𝑅)) ∧ (𝐾𝑁𝐿𝑁)) → (𝑀𝑄𝑆) = (𝑘𝑁, 𝑙𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 𝑆, 0 ), (𝑖𝑀𝑗)))))
7 simprl 746 . . 3 (((𝑀𝐵𝑆 ∈ (Base‘𝑅)) ∧ (𝐾𝑁𝐿𝑁)) → 𝐾𝑁)
8 simplrr 755 . . 3 ((((𝑀𝐵𝑆 ∈ (Base‘𝑅)) ∧ (𝐾𝑁𝐿𝑁)) ∧ 𝑘 = 𝐾) → 𝐿𝑁)
91, 2matrcl 20434 . . . . . . 7 (𝑀𝐵 → (𝑁 ∈ Fin ∧ 𝑅 ∈ V))
109simpld 476 . . . . . 6 (𝑀𝐵𝑁 ∈ Fin)
1110, 10jca 495 . . . . 5 (𝑀𝐵 → (𝑁 ∈ Fin ∧ 𝑁 ∈ Fin))
1211ad3antrrr 701 . . . 4 ((((𝑀𝐵𝑆 ∈ (Base‘𝑅)) ∧ (𝐾𝑁𝐿𝑁)) ∧ (𝑘 = 𝐾𝑙 = 𝐿)) → (𝑁 ∈ Fin ∧ 𝑁 ∈ Fin))
13 mpt2exga 7395 . . . 4 ((𝑁 ∈ Fin ∧ 𝑁 ∈ Fin) → (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 𝑆, 0 ), (𝑖𝑀𝑗))) ∈ V)
1412, 13syl 17 . . 3 ((((𝑀𝐵𝑆 ∈ (Base‘𝑅)) ∧ (𝐾𝑁𝐿𝑁)) ∧ (𝑘 = 𝐾𝑙 = 𝐿)) → (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 𝑆, 0 ), (𝑖𝑀𝑗))) ∈ V)
15 eqeq2 2781 . . . . . . 7 (𝑘 = 𝐾 → (𝑖 = 𝑘𝑖 = 𝐾))
1615adantr 466 . . . . . 6 ((𝑘 = 𝐾𝑙 = 𝐿) → (𝑖 = 𝑘𝑖 = 𝐾))
17 eqeq2 2781 . . . . . . . 8 (𝑙 = 𝐿 → (𝑗 = 𝑙𝑗 = 𝐿))
1817ifbid 4245 . . . . . . 7 (𝑙 = 𝐿 → if(𝑗 = 𝑙, 𝑆, 0 ) = if(𝑗 = 𝐿, 𝑆, 0 ))
1918adantl 467 . . . . . 6 ((𝑘 = 𝐾𝑙 = 𝐿) → if(𝑗 = 𝑙, 𝑆, 0 ) = if(𝑗 = 𝐿, 𝑆, 0 ))
2016, 19ifbieq1d 4246 . . . . 5 ((𝑘 = 𝐾𝑙 = 𝐿) → if(𝑖 = 𝑘, if(𝑗 = 𝑙, 𝑆, 0 ), (𝑖𝑀𝑗)) = if(𝑖 = 𝐾, if(𝑗 = 𝐿, 𝑆, 0 ), (𝑖𝑀𝑗)))
2120mpt2eq3dv 6867 . . . 4 ((𝑘 = 𝐾𝑙 = 𝐿) → (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 𝑆, 0 ), (𝑖𝑀𝑗))) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 𝑆, 0 ), (𝑖𝑀𝑗))))
2221adantl 467 . . 3 ((((𝑀𝐵𝑆 ∈ (Base‘𝑅)) ∧ (𝐾𝑁𝐿𝑁)) ∧ (𝑘 = 𝐾𝑙 = 𝐿)) → (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 𝑆, 0 ), (𝑖𝑀𝑗))) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 𝑆, 0 ), (𝑖𝑀𝑗))))
237, 8, 14, 22ovmpt2dv2 6940 . 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 196  wa 382   = wceq 1630  wcel 2144  Vcvv 3349  ifcif 4223  cfv 6031  (class class class)co 6792  cmpt2 6794  Fincfn 8108  Basecbs 16063  0gc0g 16307   Mat cmat 20429   matRRep cmarrep 20579
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1869  ax-4 1884  ax-5 1990  ax-6 2056  ax-7 2092  ax-8 2146  ax-9 2153  ax-10 2173  ax-11 2189  ax-12 2202  ax-13 2407  ax-ext 2750  ax-rep 4902  ax-sep 4912  ax-nul 4920  ax-pow 4971  ax-pr 5034  ax-un 7095
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 827  df-3an 1072  df-tru 1633  df-ex 1852  df-nf 1857  df-sb 2049  df-eu 2621  df-mo 2622  df-clab 2757  df-cleq 2763  df-clel 2766  df-nfc 2901  df-ne 2943  df-ral 3065  df-rex 3066  df-reu 3067  df-rab 3069  df-v 3351  df-sbc 3586  df-csb 3681  df-dif 3724  df-un 3726  df-in 3728  df-ss 3735  df-nul 4062  df-if 4224  df-pw 4297  df-sn 4315  df-pr 4317  df-op 4321  df-uni 4573  df-iun 4654  df-br 4785  df-opab 4845  df-mpt 4862  df-id 5157  df-xp 5255  df-rel 5256  df-cnv 5257  df-co 5258  df-dm 5259  df-rn 5260  df-res 5261  df-ima 5262  df-iota 5994  df-fun 6033  df-fn 6034  df-f 6035  df-f1 6036  df-fo 6037  df-f1o 6038  df-fv 6039  df-ov 6795  df-oprab 6796  df-mpt2 6797  df-1st 7314  df-2nd 7315  df-slot 16067  df-base 16069  df-mat 20430  df-marrep 20581
This theorem is referenced by:  marrepeval  20586  marrepcl  20587  1marepvmarrepid  20598  smadiadetglem1  20695  smadiadetglem2  20696  madjusmdetlem1  30227
  Copyright terms: Public domain W3C validator