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

Theorem maduval 22946
Description: Second substitution for the adjunct (cofactor) matrix. (Contributed by SO, 11-Jul-2018.)
Hypotheses
Ref Expression
madufval.a 𝐴 = (𝑁 Mat 𝑅)
madufval.d 𝐷 = (𝑁 maDet 𝑅)
madufval.j 𝐽 = (𝑁 maAdju 𝑅)
madufval.b 𝐵 = (Base‘𝐴)
madufval.o 1 = (1r‘𝑅)
madufval.z 0 = (0g‘𝑅)
Assertion
Ref Expression
maduval (𝑀 ∈ 𝐵 → (𝐽‘𝑀) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑀𝑙))))))
Distinct variable groups:   𝑖,𝑁,𝑗,𝑘,𝑙   𝑅,𝑖,𝑗,𝑘,𝑙   𝑖,𝑀,𝑗,𝑘,𝑙
Allowed substitution hints:   𝐴(𝑖, 𝑗, 𝑘, 𝑙)   𝐵(𝑖, 𝑗, 𝑘, 𝑙)   𝐷(𝑖, 𝑗, 𝑘, 𝑙)   1 (𝑖, 𝑗, 𝑘, 𝑙)   𝐽(𝑖, 𝑗, 𝑘, 𝑙)   0 (𝑖, 𝑗, 𝑘, 𝑙)

Proof of Theorem maduval
Dummy variable 𝑚 is distinct from all other variables.
StepHypRef Expression
1 madufval.a . . . . 5 𝐴 = (𝑁 Mat 𝑅)
2 madufval.b . . . . 5 𝐵 = (Base‘𝐴)
31, 2matrcl 22720 . . . 4 (𝑀 ∈ 𝐵 → (𝑁 ∈ Fin ∧ 𝑅 ∈ V))
43simpld 500 . . 3 (𝑀 ∈ 𝐵 → 𝑁 ∈ Fin)
5 mpoexga 8088 . . 3 ((𝑁 ∈ Fin ∧ 𝑁 ∈ Fin) → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑀𝑙))))) ∈ V)
64, 4, 5syl2anc 596 . 2 (𝑀 ∈ 𝐵 → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑀𝑙))))) ∈ V)
7 oveq 7424 . . . . . . . 8 (𝑚 = 𝑀 → (𝑘𝑚𝑙) = (𝑘𝑀𝑙))
87ifeq2d 4503 . . . . . . 7 (𝑚 = 𝑀 → if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑚𝑙)) = if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑀𝑙)))
98mpoeq3dv 7497 . . . . . 6 (𝑚 = 𝑀 → (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑚𝑙))) = (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑀𝑙))))
1093ad2ant1 1151 . . . . 5 ((𝑚 = 𝑀 ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑚𝑙))) = (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑀𝑙))))
1110fveq2d 6887 . . . 4 ((𝑚 = 𝑀 ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑚𝑙)))) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑀𝑙)))))
1211mpoeq3dva 7495 . . 3 (𝑚 = 𝑀 → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑚𝑙))))) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑀𝑙))))))
13 madufval.d . . . 4 𝐷 = (𝑁 maDet 𝑅)
14 madufval.j . . . 4 𝐽 = (𝑁 maAdju 𝑅)
15 madufval.o . . . 4 1 = (1r‘𝑅)
16 madufval.z . . . 4 0 = (0g‘𝑅)
171, 13, 14, 2, 15, 16madufval 22945 . . 3 𝐽 = (𝑚 ∈ 𝐵 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑚𝑙))))))
1812, 17fvmptg 6989 . 2 ((𝑀 ∈ 𝐵 ∧ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑀𝑙))))) ∈ V) → (𝐽‘𝑀) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑀𝑙))))))
196, 18mpdan 700 1 (𝑀 ∈ 𝐵 → (𝐽‘𝑀) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑀𝑙))))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  Vcvv 3451  ifcif 4482  ‘cfv 6537  (class class class)co 7418   ∈ cmpo 7420  Fincfn 8966  Basecbs 17380  0gc0g 17603  1rcur 20400   Mat cmat 22715   maDet cmdat 22892   maAdju cmadu 22940
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749  ax-cnex 11249  ax-1cn 11251  ax-addcl 11253
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-om 7876  df-1st 7999  df-2nd 8000  df-frecs 8292  df-wrecs 8323  df-recs 8372  df-rdg 8411  df-nn 12329  df-slot 17353  df-ndx 17365  df-base 17381  df-mat 22716  df-madu 22942
This theorem is used by:  maducoeval  22947
  Copyright terms: Public domain W3C validator