Theorem minmar1eval 21706

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.

Step	Hyp	Ref	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‘𝑅)
6	1, 2, 3, 4, 5	minmar1val 21705	. . . 4 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) → (𝐾(𝑄‘𝑀)𝐿) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗))))
7	6	3expb 1118	. . 3 ⊢ ((𝑀 ∈ 𝐵 ∧ (𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁)) → (𝐾(𝑄‘𝑀)𝐿) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗))))
8	7	3adant3 1130	. 2 ⊢ ((𝑀 ∈ 𝐵 ∧ (𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → (𝐾(𝑄‘𝑀)𝐿) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗))))
9		simp3l 1199	. . 3 ⊢ ((𝑀 ∈ 𝐵 ∧ (𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → 𝐼 ∈ 𝑁)
10		simpl3r 1227	. . 3 ⊢ (((𝑀 ∈ 𝐵 ∧ (𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) ∧ 𝑖 = 𝐼) → 𝐽 ∈ 𝑁)
11	4	fvexi 6770	. . . . . 6 ⊢ 1 ∈ V
12	5	fvexi 6770	. . . . . 6 ⊢ 0 ∈ V
13	11, 12	ifex 4506	. . . . 5 ⊢ if(𝑗 = 𝐿, 1 , 0 ) ∈ V
14		ovex 7288	. . . . 5 ⊢ (𝑖𝑀𝑗) ∈ V
15	13, 14	ifex 4506	. . . 4 ⊢ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)) ∈ V
16	15	a1i 11	. . 3 ⊢ (((𝑀 ∈ 𝐵 ∧ (𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) ∧ (𝑖 = 𝐼 ∧ 𝑗 = 𝐽)) → if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)) ∈ V)
17		eqeq1 2742	. . . . . 6 ⊢ (𝑖 = 𝐼 → (𝑖 = 𝐾 ↔ 𝐼 = 𝐾))
18	17	adantr 480	. . . . 5 ⊢ ((𝑖 = 𝐼 ∧ 𝑗 = 𝐽) → (𝑖 = 𝐾 ↔ 𝐼 = 𝐾))
19		eqeq1 2742	. . . . . . 7 ⊢ (𝑗 = 𝐽 → (𝑗 = 𝐿 ↔ 𝐽 = 𝐿))
20	19	adantl 481	. . . . . 6 ⊢ ((𝑖 = 𝐼 ∧ 𝑗 = 𝐽) → (𝑗 = 𝐿 ↔ 𝐽 = 𝐿))
21	20	ifbid 4479	. . . . 5 ⊢ ((𝑖 = 𝐼 ∧ 𝑗 = 𝐽) → if(𝑗 = 𝐿, 1 , 0 ) = if(𝐽 = 𝐿, 1 , 0 ))
22		oveq12 7264	. . . . 5 ⊢ ((𝑖 = 𝐼 ∧ 𝑗 = 𝐽) → (𝑖𝑀𝑗) = (𝐼𝑀𝐽))
23	18, 21, 22	ifbieq12d 4484	. . . 4 ⊢ ((𝑖 = 𝐼 ∧ 𝑗 = 𝐽) → if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)) = if(𝐼 = 𝐾, if(𝐽 = 𝐿, 1 , 0 ), (𝐼𝑀𝐽)))
24	23	adantl 481	. . 3 ⊢ (((𝑀 ∈ 𝐵 ∧ (𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) ∧ (𝑖 = 𝐼 ∧ 𝑗 = 𝐽)) → if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)) = if(𝐼 = 𝐾, if(𝐽 = 𝐿, 1 , 0 ), (𝐼𝑀𝐽)))
25	9, 10, 16, 24	ovmpodv2 7409	. 2 ⊢ ((𝑀 ∈ 𝐵 ∧ (𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → ((𝐾(𝑄‘𝑀)𝐿) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗))) → (𝐼(𝐾(𝑄‘𝑀)𝐿)𝐽) = if(𝐼 = 𝐾, if(𝐽 = 𝐿, 1 , 0 ), (𝐼𝑀𝐽))))
26	8, 25	mpd 15	1 ⊢ ((𝑀 ∈ 𝐵 ∧ (𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → (𝐼(𝐾(𝑄‘𝑀)𝐿)𝐽) = if(𝐼 = 𝐾, if(𝐽 = 𝐿, 1 , 0 ), (𝐼𝑀𝐽)))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   ∧ w3a 1085   = wceq 1539   ∈ wcel 2108  Vcvv 3422  ifcif 4456  ‘cfv 6418  (class class class)co 7255   ∈ cmpo 7257  Basecbs 16840  0_gc0g 17067  1_rcur 19652   Mat cmat 21464   minMatR1 cminmar1 21690

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566  ax-cnex 10858  ax-1cn 10860  ax-addcl 10862

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-ov 7258  df-oprab 7259  df-mpo 7260  df-om 7688  df-1st 7804  df-2nd 7805  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-rdg 8212  df-nn 11904  df-slot 16811  df-ndx 16823  df-base 16841  df-mat 21465  df-minmar1 21692

This theorem is referenced by:  madjusmdetlem1  31679