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

Theorem marrepval0 21162
 Description: Second 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
marrepval0 ((𝑀𝐵𝑆 ∈ (Base‘𝑅)) → (𝑀𝑄𝑆) = (𝑘𝑁, 𝑙𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 𝑆, 0 ), (𝑖𝑀𝑗)))))
Distinct variable groups:   𝑖,𝑁,𝑗,𝑘,𝑙   𝑅,𝑖,𝑗,𝑘,𝑙   𝑖,𝑀,𝑗,𝑘,𝑙   𝑆,𝑖,𝑗,𝑘,𝑙
Allowed substitution hints:   𝐴(𝑖,𝑗,𝑘,𝑙)   𝐵(𝑖,𝑗,𝑘,𝑙)   𝑄(𝑖,𝑗,𝑘,𝑙)   0 (𝑖,𝑗,𝑘,𝑙)

Proof of Theorem marrepval0
Dummy variables 𝑚 𝑠 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 marrepfval.a . . . . . . 7 𝐴 = (𝑁 Mat 𝑅)
2 marrepfval.b . . . . . . 7 𝐵 = (Base‘𝐴)
31, 2matrcl 21013 . . . . . 6 (𝑀𝐵 → (𝑁 ∈ Fin ∧ 𝑅 ∈ V))
43simpld 497 . . . . 5 (𝑀𝐵𝑁 ∈ Fin)
54, 4jca 514 . . . 4 (𝑀𝐵 → (𝑁 ∈ Fin ∧ 𝑁 ∈ Fin))
65adantr 483 . . 3 ((𝑀𝐵𝑆 ∈ (Base‘𝑅)) → (𝑁 ∈ Fin ∧ 𝑁 ∈ Fin))
7 mpoexga 7767 . . 3 ((𝑁 ∈ Fin ∧ 𝑁 ∈ Fin) → (𝑘𝑁, 𝑙𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 𝑆, 0 ), (𝑖𝑀𝑗)))) ∈ V)
86, 7syl 17 . 2 ((𝑀𝐵𝑆 ∈ (Base‘𝑅)) → (𝑘𝑁, 𝑙𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 𝑆, 0 ), (𝑖𝑀𝑗)))) ∈ V)
9 ifeq1 4469 . . . . . . 7 (𝑠 = 𝑆 → if(𝑗 = 𝑙, 𝑠, 0 ) = if(𝑗 = 𝑙, 𝑆, 0 ))
109adantl 484 . . . . . 6 ((𝑚 = 𝑀𝑠 = 𝑆) → if(𝑗 = 𝑙, 𝑠, 0 ) = if(𝑗 = 𝑙, 𝑆, 0 ))
11 oveq 7154 . . . . . . 7 (𝑚 = 𝑀 → (𝑖𝑚𝑗) = (𝑖𝑀𝑗))
1211adantr 483 . . . . . 6 ((𝑚 = 𝑀𝑠 = 𝑆) → (𝑖𝑚𝑗) = (𝑖𝑀𝑗))
1310, 12ifeq12d 4485 . . . . 5 ((𝑚 = 𝑀𝑠 = 𝑆) → if(𝑖 = 𝑘, if(𝑗 = 𝑙, 𝑠, 0 ), (𝑖𝑚𝑗)) = if(𝑖 = 𝑘, if(𝑗 = 𝑙, 𝑆, 0 ), (𝑖𝑀𝑗)))
1413mpoeq3dv 7225 . . . 4 ((𝑚 = 𝑀𝑠 = 𝑆) → (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 𝑠, 0 ), (𝑖𝑚𝑗))) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 𝑆, 0 ), (𝑖𝑀𝑗))))
1514mpoeq3dv 7225 . . 3 ((𝑚 = 𝑀𝑠 = 𝑆) → (𝑘𝑁, 𝑙𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 𝑠, 0 ), (𝑖𝑚𝑗)))) = (𝑘𝑁, 𝑙𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 𝑆, 0 ), (𝑖𝑀𝑗)))))
16 marrepfval.q . . . 4 𝑄 = (𝑁 matRRep 𝑅)
17 marrepfval.z . . . 4 0 = (0g𝑅)
181, 2, 16, 17marrepfval 21161 . . 3 𝑄 = (𝑚𝐵, 𝑠 ∈ (Base‘𝑅) ↦ (𝑘𝑁, 𝑙𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 𝑠, 0 ), (𝑖𝑚𝑗)))))
1915, 18ovmpoga 7296 . 2 ((𝑀𝐵𝑆 ∈ (Base‘𝑅) ∧ (𝑘𝑁, 𝑙𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 𝑆, 0 ), (𝑖𝑀𝑗)))) ∈ V) → (𝑀𝑄𝑆) = (𝑘𝑁, 𝑙𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 𝑆, 0 ), (𝑖𝑀𝑗)))))
208, 19mpd3an3 1456 1 ((𝑀𝐵𝑆 ∈ (Base‘𝑅)) → (𝑀𝑄𝑆) = (𝑘𝑁, 𝑙𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 𝑆, 0 ), (𝑖𝑀𝑗)))))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 398   = wceq 1531   ∈ wcel 2108  Vcvv 3493  ifcif 4465  ‘cfv 6348  (class class class)co 7148   ∈ cmpo 7150  Fincfn 8501  Basecbs 16475  0gc0g 16705   Mat cmat 21008   matRRep cmarrep 21157 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1905  ax-6 1964  ax-7 2009  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2154  ax-12 2170  ax-ext 2791  ax-rep 5181  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320  ax-un 7453 This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1084  df-tru 1534  df-ex 1775  df-nf 1779  df-sb 2064  df-mo 2616  df-eu 2648  df-clab 2798  df-cleq 2812  df-clel 2891  df-nfc 2961  df-ne 3015  df-ral 3141  df-rex 3142  df-reu 3143  df-rab 3145  df-v 3495  df-sbc 3771  df-csb 3882  df-dif 3937  df-un 3939  df-in 3941  df-ss 3950  df-nul 4290  df-if 4466  df-pw 4539  df-sn 4560  df-pr 4562  df-op 4566  df-uni 4831  df-iun 4912  df-br 5058  df-opab 5120  df-mpt 5138  df-id 5453  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-f1 6353  df-fo 6354  df-f1o 6355  df-fv 6356  df-ov 7151  df-oprab 7152  df-mpo 7153  df-1st 7681  df-2nd 7682  df-slot 16479  df-base 16481  df-mat 21009  df-marrep 21159 This theorem is referenced by:  marrepval  21163  minmar1marrep  21251
 Copyright terms: Public domain W3C validator