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

Theorem minmar1eval 20274
Description: An entry 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
minmar1eval ((𝑀𝐵 ∧ (𝐾𝑁𝐿𝑁) ∧ (𝐼𝑁𝐽𝑁)) → (𝐼(𝐾(𝑄𝑀)𝐿)𝐽) = if(𝐼 = 𝐾, if(𝐽 = 𝐿, 1 , 0 ), (𝐼𝑀𝐽)))

Proof of Theorem minmar1eval
Dummy variables 𝑖 𝑗 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 minmar1fval.a . . . . 5 𝐴 = (𝑁 Mat 𝑅)
2 minmar1fval.b . . . . 5 𝐵 = (Base‘𝐴)
3 minmar1fval.q . . . . 5 𝑄 = (𝑁 minMatR1 𝑅)
4 minmar1fval.o . . . . 5 1 = (1r𝑅)
5 minmar1fval.z . . . . 5 0 = (0g𝑅)
61, 2, 3, 4, 5minmar1val 20273 . . . 4 ((𝑀𝐵𝐾𝑁𝐿𝑁) → (𝐾(𝑄𝑀)𝐿) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗))))
763expb 1258 . . 3 ((𝑀𝐵 ∧ (𝐾𝑁𝐿𝑁)) → (𝐾(𝑄𝑀)𝐿) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗))))
873adant3 1074 . 2 ((𝑀𝐵 ∧ (𝐾𝑁𝐿𝑁) ∧ (𝐼𝑁𝐽𝑁)) → (𝐾(𝑄𝑀)𝐿) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗))))
9 simp3l 1082 . . 3 ((𝑀𝐵 ∧ (𝐾𝑁𝐿𝑁) ∧ (𝐼𝑁𝐽𝑁)) → 𝐼𝑁)
10 simpl3r 1110 . . 3 (((𝑀𝐵 ∧ (𝐾𝑁𝐿𝑁) ∧ (𝐼𝑁𝐽𝑁)) ∧ 𝑖 = 𝐼) → 𝐽𝑁)
11 fvex 6113 . . . . . . 7 (1r𝑅) ∈ V
124, 11eqeltri 2684 . . . . . 6 1 ∈ V
13 fvex 6113 . . . . . . 7 (0g𝑅) ∈ V
145, 13eqeltri 2684 . . . . . 6 0 ∈ V
1512, 14ifex 4106 . . . . 5 if(𝑗 = 𝐿, 1 , 0 ) ∈ V
16 ovex 6577 . . . . 5 (𝑖𝑀𝑗) ∈ V
1715, 16ifex 4106 . . . 4 if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)) ∈ V
1817a1i 11 . . 3 (((𝑀𝐵 ∧ (𝐾𝑁𝐿𝑁) ∧ (𝐼𝑁𝐽𝑁)) ∧ (𝑖 = 𝐼𝑗 = 𝐽)) → if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)) ∈ V)
19 eqeq1 2614 . . . . . 6 (𝑖 = 𝐼 → (𝑖 = 𝐾𝐼 = 𝐾))
2019adantr 480 . . . . 5 ((𝑖 = 𝐼𝑗 = 𝐽) → (𝑖 = 𝐾𝐼 = 𝐾))
21 eqeq1 2614 . . . . . . 7 (𝑗 = 𝐽 → (𝑗 = 𝐿𝐽 = 𝐿))
2221adantl 481 . . . . . 6 ((𝑖 = 𝐼𝑗 = 𝐽) → (𝑗 = 𝐿𝐽 = 𝐿))
2322ifbid 4058 . . . . 5 ((𝑖 = 𝐼𝑗 = 𝐽) → if(𝑗 = 𝐿, 1 , 0 ) = if(𝐽 = 𝐿, 1 , 0 ))
24 oveq12 6558 . . . . 5 ((𝑖 = 𝐼𝑗 = 𝐽) → (𝑖𝑀𝑗) = (𝐼𝑀𝐽))
2520, 23, 24ifbieq12d 4063 . . . 4 ((𝑖 = 𝐼𝑗 = 𝐽) → if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)) = if(𝐼 = 𝐾, if(𝐽 = 𝐿, 1 , 0 ), (𝐼𝑀𝐽)))
2625adantl 481 . . 3 (((𝑀𝐵 ∧ (𝐾𝑁𝐿𝑁) ∧ (𝐼𝑁𝐽𝑁)) ∧ (𝑖 = 𝐼𝑗 = 𝐽)) → if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)) = if(𝐼 = 𝐾, if(𝐽 = 𝐿, 1 , 0 ), (𝐼𝑀𝐽)))
279, 10, 18, 26ovmpt2dv2 6692 . 2 ((𝑀𝐵 ∧ (𝐾𝑁𝐿𝑁) ∧ (𝐼𝑁𝐽𝑁)) → ((𝐾(𝑄𝑀)𝐿) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗))) → (𝐼(𝐾(𝑄𝑀)𝐿)𝐽) = if(𝐼 = 𝐾, if(𝐽 = 𝐿, 1 , 0 ), (𝐼𝑀𝐽))))
288, 27mpd 15 1 ((𝑀𝐵 ∧ (𝐾𝑁𝐿𝑁) ∧ (𝐼𝑁𝐽𝑁)) → (𝐼(𝐾(𝑄𝑀)𝐿)𝐽) = if(𝐼 = 𝐾, if(𝐽 = 𝐿, 1 , 0 ), (𝐼𝑀𝐽)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195  wa 383  w3a 1031   = wceq 1475  wcel 1977  Vcvv 3173  ifcif 4036  cfv 5804  (class class class)co 6549  cmpt2 6551  Basecbs 15695  0gc0g 15923  1rcur 18324   Mat cmat 20032   minMatR1 cminmar1 20258
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-1st 7059  df-2nd 7060  df-slot 15699  df-base 15700  df-mat 20033  df-minmar1 20260
This theorem is referenced by:  madjusmdetlem1  29221
  Copyright terms: Public domain W3C validator