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

Theorem minmar1fval 21570
Description: First substitution for the definition of a matrix for a minor. (Contributed by AV, 31-Dec-2018.)
Hypotheses
Ref Expression
minmar1fval.a 𝐴 = (𝑁 Mat 𝑅)
minmar1fval.b 𝐵 = (Base‘𝐴)
minmar1fval.q 𝑄 = (𝑁 minMatR1 𝑅)
minmar1fval.o 1 = (1r𝑅)
minmar1fval.z 0 = (0g𝑅)
Assertion
Ref Expression
minmar1fval 𝑄 = (𝑚𝐵 ↦ (𝑘𝑁, 𝑙𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗)))))
Distinct variable groups:   𝐵,𝑚   𝑖,𝑁,𝑗,𝑘,𝑙,𝑚   𝑅,𝑖,𝑗,𝑘,𝑙,𝑚
Allowed substitution hints:   𝐴(𝑖,𝑗,𝑘,𝑚,𝑙)   𝐵(𝑖,𝑗,𝑘,𝑙)   𝑄(𝑖,𝑗,𝑘,𝑚,𝑙)   1 (𝑖,𝑗,𝑘,𝑚,𝑙)   0 (𝑖,𝑗,𝑘,𝑚,𝑙)

Proof of Theorem minmar1fval
Dummy variables 𝑛 𝑟 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 minmar1fval.q . 2 𝑄 = (𝑁 minMatR1 𝑅)
2 oveq12 7241 . . . . . . . 8 ((𝑛 = 𝑁𝑟 = 𝑅) → (𝑛 Mat 𝑟) = (𝑁 Mat 𝑅))
3 minmar1fval.a . . . . . . . 8 𝐴 = (𝑁 Mat 𝑅)
42, 3eqtr4di 2797 . . . . . . 7 ((𝑛 = 𝑁𝑟 = 𝑅) → (𝑛 Mat 𝑟) = 𝐴)
54fveq2d 6740 . . . . . 6 ((𝑛 = 𝑁𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = (Base‘𝐴))
6 minmar1fval.b . . . . . 6 𝐵 = (Base‘𝐴)
75, 6eqtr4di 2797 . . . . 5 ((𝑛 = 𝑁𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = 𝐵)
8 simpl 486 . . . . . 6 ((𝑛 = 𝑁𝑟 = 𝑅) → 𝑛 = 𝑁)
9 fveq2 6736 . . . . . . . . . . 11 (𝑟 = 𝑅 → (1r𝑟) = (1r𝑅))
10 minmar1fval.o . . . . . . . . . . 11 1 = (1r𝑅)
119, 10eqtr4di 2797 . . . . . . . . . 10 (𝑟 = 𝑅 → (1r𝑟) = 1 )
12 fveq2 6736 . . . . . . . . . . 11 (𝑟 = 𝑅 → (0g𝑟) = (0g𝑅))
13 minmar1fval.z . . . . . . . . . . 11 0 = (0g𝑅)
1412, 13eqtr4di 2797 . . . . . . . . . 10 (𝑟 = 𝑅 → (0g𝑟) = 0 )
1511, 14ifeq12d 4475 . . . . . . . . 9 (𝑟 = 𝑅 → if(𝑗 = 𝑙, (1r𝑟), (0g𝑟)) = if(𝑗 = 𝑙, 1 , 0 ))
1615ifeq1d 4473 . . . . . . . 8 (𝑟 = 𝑅 → if(𝑖 = 𝑘, if(𝑗 = 𝑙, (1r𝑟), (0g𝑟)), (𝑖𝑚𝑗)) = if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗)))
1716adantl 485 . . . . . . 7 ((𝑛 = 𝑁𝑟 = 𝑅) → if(𝑖 = 𝑘, if(𝑗 = 𝑙, (1r𝑟), (0g𝑟)), (𝑖𝑚𝑗)) = if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗)))
188, 8, 17mpoeq123dv 7305 . . . . . 6 ((𝑛 = 𝑁𝑟 = 𝑅) → (𝑖𝑛, 𝑗𝑛 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, (1r𝑟), (0g𝑟)), (𝑖𝑚𝑗))) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗))))
198, 8, 18mpoeq123dv 7305 . . . . 5 ((𝑛 = 𝑁𝑟 = 𝑅) → (𝑘𝑛, 𝑙𝑛 ↦ (𝑖𝑛, 𝑗𝑛 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, (1r𝑟), (0g𝑟)), (𝑖𝑚𝑗)))) = (𝑘𝑁, 𝑙𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗)))))
207, 19mpteq12dv 5155 . . . 4 ((𝑛 = 𝑁𝑟 = 𝑅) → (𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ↦ (𝑘𝑛, 𝑙𝑛 ↦ (𝑖𝑛, 𝑗𝑛 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, (1r𝑟), (0g𝑟)), (𝑖𝑚𝑗))))) = (𝑚𝐵 ↦ (𝑘𝑁, 𝑙𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗))))))
21 df-minmar1 21559 . . . 4 minMatR1 = (𝑛 ∈ V, 𝑟 ∈ V ↦ (𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ↦ (𝑘𝑛, 𝑙𝑛 ↦ (𝑖𝑛, 𝑗𝑛 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, (1r𝑟), (0g𝑟)), (𝑖𝑚𝑗))))))
226fvexi 6750 . . . . 5 𝐵 ∈ V
2322mptex 7058 . . . 4 (𝑚𝐵 ↦ (𝑘𝑁, 𝑙𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗))))) ∈ V
2420, 21, 23ovmpoa 7383 . . 3 ((𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 minMatR1 𝑅) = (𝑚𝐵 ↦ (𝑘𝑁, 𝑙𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗))))))
2521mpondm0 7465 . . . . 5 (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 minMatR1 𝑅) = ∅)
26 mpt0 6539 . . . . 5 (𝑚 ∈ ∅ ↦ (𝑘𝑁, 𝑙𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗))))) = ∅
2725, 26eqtr4di 2797 . . . 4 (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 minMatR1 𝑅) = (𝑚 ∈ ∅ ↦ (𝑘𝑁, 𝑙𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗))))))
283fveq2i 6739 . . . . . . 7 (Base‘𝐴) = (Base‘(𝑁 Mat 𝑅))
296, 28eqtri 2766 . . . . . 6 𝐵 = (Base‘(𝑁 Mat 𝑅))
30 matbas0pc 21333 . . . . . 6 (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (Base‘(𝑁 Mat 𝑅)) = ∅)
3129, 30syl5eq 2791 . . . . 5 (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → 𝐵 = ∅)
3231mpteq1d 5159 . . . 4 (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑚𝐵 ↦ (𝑘𝑁, 𝑙𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗))))) = (𝑚 ∈ ∅ ↦ (𝑘𝑁, 𝑙𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗))))))
3327, 32eqtr4d 2781 . . 3 (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 minMatR1 𝑅) = (𝑚𝐵 ↦ (𝑘𝑁, 𝑙𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗))))))
3424, 33pm2.61i 185 . 2 (𝑁 minMatR1 𝑅) = (𝑚𝐵 ↦ (𝑘𝑁, 𝑙𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗)))))
351, 34eqtri 2766 1 𝑄 = (𝑚𝐵 ↦ (𝑘𝑁, 𝑙𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗)))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wa 399   = wceq 1543  wcel 2111  Vcvv 3421  c0 4252  ifcif 4454  cmpt 5150  cfv 6398  (class class class)co 7232  cmpo 7234  Basecbs 16788  0gc0g 16972  1rcur 19544   Mat cmat 21331   minMatR1 cminmar1 21557
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2159  ax-12 2176  ax-ext 2709  ax-rep 5194  ax-sep 5207  ax-nul 5214  ax-pow 5273  ax-pr 5337  ax-un 7542  ax-cnex 10810  ax-1cn 10812  ax-addcl 10814
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3or 1090  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2072  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2887  df-ne 2942  df-ral 3067  df-rex 3068  df-reu 3069  df-rab 3071  df-v 3423  df-sbc 3710  df-csb 3827  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4253  df-if 4455  df-pw 4530  df-sn 4557  df-pr 4559  df-tp 4561  df-op 4563  df-uni 4835  df-iun 4921  df-br 5069  df-opab 5131  df-mpt 5151  df-tr 5177  df-id 5470  df-eprel 5475  df-po 5483  df-so 5484  df-fr 5524  df-we 5526  df-xp 5572  df-rel 5573  df-cnv 5574  df-co 5575  df-dm 5576  df-rn 5577  df-res 5578  df-ima 5579  df-pred 6176  df-ord 6234  df-on 6235  df-lim 6236  df-suc 6237  df-iota 6356  df-fun 6400  df-fn 6401  df-f 6402  df-f1 6403  df-fo 6404  df-f1o 6405  df-fv 6406  df-ov 7235  df-oprab 7236  df-mpo 7237  df-om 7664  df-wrecs 8068  df-recs 8129  df-rdg 8167  df-nn 11856  df-slot 16763  df-ndx 16773  df-base 16789  df-mat 21332  df-minmar1 21559
This theorem is referenced by:  minmar1val0  21571
  Copyright terms: Public domain W3C validator