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

Theorem minmar1val 22566
Description: Third 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
minmar1val ((𝑀𝐵𝐾𝑁𝐿𝑁) → (𝐾(𝑄𝑀)𝐿) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗))))
Distinct variable groups:   𝑖,𝑁,𝑗   𝑅,𝑖,𝑗   𝑖,𝑀,𝑗   𝑖,𝐾,𝑗   𝑖,𝐿,𝑗
Allowed substitution hints:   𝐴(𝑖,𝑗)   𝐵(𝑖,𝑗)   𝑄(𝑖,𝑗)   1 (𝑖,𝑗)   0 (𝑖,𝑗)

Proof of Theorem minmar1val
Dummy variables 𝑘 𝑙 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 minmar1fval.a . . . 4 𝐴 = (𝑁 Mat 𝑅)
2 minmar1fval.b . . . 4 𝐵 = (Base‘𝐴)
3 minmar1fval.q . . . 4 𝑄 = (𝑁 minMatR1 𝑅)
4 minmar1fval.o . . . 4 1 = (1r𝑅)
5 minmar1fval.z . . . 4 0 = (0g𝑅)
61, 2, 3, 4, 5minmar1val0 22565 . . 3 (𝑀𝐵 → (𝑄𝑀) = (𝑘𝑁, 𝑙𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑀𝑗)))))
763ad2ant1 1130 . 2 ((𝑀𝐵𝐾𝑁𝐿𝑁) → (𝑄𝑀) = (𝑘𝑁, 𝑙𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑀𝑗)))))
8 simp2 1134 . . 3 ((𝑀𝐵𝐾𝑁𝐿𝑁) → 𝐾𝑁)
9 simpl3 1190 . . 3 (((𝑀𝐵𝐾𝑁𝐿𝑁) ∧ 𝑘 = 𝐾) → 𝐿𝑁)
101, 2matrcl 22328 . . . . . . . 8 (𝑀𝐵 → (𝑁 ∈ Fin ∧ 𝑅 ∈ V))
1110simpld 493 . . . . . . 7 (𝑀𝐵𝑁 ∈ Fin)
1211, 11jca 510 . . . . . 6 (𝑀𝐵 → (𝑁 ∈ Fin ∧ 𝑁 ∈ Fin))
13123ad2ant1 1130 . . . . 5 ((𝑀𝐵𝐾𝑁𝐿𝑁) → (𝑁 ∈ Fin ∧ 𝑁 ∈ Fin))
1413adantr 479 . . . 4 (((𝑀𝐵𝐾𝑁𝐿𝑁) ∧ (𝑘 = 𝐾𝑙 = 𝐿)) → (𝑁 ∈ Fin ∧ 𝑁 ∈ Fin))
15 mpoexga 8078 . . . 4 ((𝑁 ∈ Fin ∧ 𝑁 ∈ Fin) → (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑀𝑗))) ∈ V)
1614, 15syl 17 . . 3 (((𝑀𝐵𝐾𝑁𝐿𝑁) ∧ (𝑘 = 𝐾𝑙 = 𝐿)) → (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑀𝑗))) ∈ V)
17 eqeq2 2737 . . . . . . 7 (𝑘 = 𝐾 → (𝑖 = 𝑘𝑖 = 𝐾))
1817adantr 479 . . . . . 6 ((𝑘 = 𝐾𝑙 = 𝐿) → (𝑖 = 𝑘𝑖 = 𝐾))
19 eqeq2 2737 . . . . . . . 8 (𝑙 = 𝐿 → (𝑗 = 𝑙𝑗 = 𝐿))
2019ifbid 4547 . . . . . . 7 (𝑙 = 𝐿 → if(𝑗 = 𝑙, 1 , 0 ) = if(𝑗 = 𝐿, 1 , 0 ))
2120adantl 480 . . . . . 6 ((𝑘 = 𝐾𝑙 = 𝐿) → if(𝑗 = 𝑙, 1 , 0 ) = if(𝑗 = 𝐿, 1 , 0 ))
2218, 21ifbieq1d 4548 . . . . 5 ((𝑘 = 𝐾𝑙 = 𝐿) → if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑀𝑗)) = if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)))
2322mpoeq3dv 7495 . . . 4 ((𝑘 = 𝐾𝑙 = 𝐿) → (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑀𝑗))) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗))))
2423adantl 480 . . 3 (((𝑀𝐵𝐾𝑁𝐿𝑁) ∧ (𝑘 = 𝐾𝑙 = 𝐿)) → (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑀𝑗))) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗))))
258, 9, 16, 24ovmpodv2 7575 . 2 ((𝑀𝐵𝐾𝑁𝐿𝑁) → ((𝑄𝑀) = (𝑘𝑁, 𝑙𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑀𝑗)))) → (𝐾(𝑄𝑀)𝐿) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)))))
267, 25mpd 15 1 ((𝑀𝐵𝐾𝑁𝐿𝑁) → (𝐾(𝑄𝑀)𝐿) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 394  w3a 1084   = wceq 1533  wcel 2098  Vcvv 3463  ifcif 4524  cfv 6542  (class class class)co 7415  cmpo 7417  Fincfn 8960  Basecbs 17177  0gc0g 17418  1rcur 20123   Mat cmat 22323   minMatR1 cminmar1 22551
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2696  ax-rep 5280  ax-sep 5294  ax-nul 5301  ax-pow 5359  ax-pr 5423  ax-un 7737  ax-cnex 11192  ax-1cn 11194  ax-addcl 11196
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2703  df-cleq 2717  df-clel 2802  df-nfc 2877  df-ne 2931  df-ral 3052  df-rex 3061  df-reu 3365  df-rab 3420  df-v 3465  df-sbc 3770  df-csb 3886  df-dif 3943  df-un 3945  df-in 3947  df-ss 3957  df-pss 3960  df-nul 4319  df-if 4525  df-pw 4600  df-sn 4625  df-pr 4627  df-op 4631  df-uni 4904  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5227  df-tr 5261  df-id 5570  df-eprel 5576  df-po 5584  df-so 5585  df-fr 5627  df-we 5629  df-xp 5678  df-rel 5679  df-cnv 5680  df-co 5681  df-dm 5682  df-rn 5683  df-res 5684  df-ima 5685  df-pred 6300  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6494  df-fun 6544  df-fn 6545  df-f 6546  df-f1 6547  df-fo 6548  df-f1o 6549  df-fv 6550  df-ov 7418  df-oprab 7419  df-mpo 7420  df-om 7868  df-1st 7989  df-2nd 7990  df-frecs 8283  df-wrecs 8314  df-recs 8388  df-rdg 8427  df-nn 12241  df-slot 17148  df-ndx 17160  df-base 17178  df-mat 22324  df-minmar1 22553
This theorem is referenced by:  minmar1eval  22567  maducoevalmin1  22570  smadiadet  22588  smadiadetglem2  22590
  Copyright terms: Public domain W3C validator