Theorem minmar1eval 22614

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 22613	. . . 4 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) → (𝐾(𝑄‘𝑀)𝐿) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗))))
7	6	3expb 1121	. . 3 ⊢ ((𝑀 ∈ 𝐵 ∧ (𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁)) → (𝐾(𝑄‘𝑀)𝐿) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗))))
8	7	3adant3 1133	. 2 ⊢ ((𝑀 ∈ 𝐵 ∧ (𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → (𝐾(𝑄‘𝑀)𝐿) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗))))
9		simp3l 1203	. . 3 ⊢ ((𝑀 ∈ 𝐵 ∧ (𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → 𝐼 ∈ 𝑁)
10		simpl3r 1231	. . 3 ⊢ (((𝑀 ∈ 𝐵 ∧ (𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) ∧ 𝑖 = 𝐼) → 𝐽 ∈ 𝑁)
11	4	fvexi 6854	. . . . . 6 ⊢ 1 ∈ V
12	5	fvexi 6854	. . . . . 6 ⊢ 0 ∈ V
13	11, 12	ifex 4517	. . . . 5 ⊢ if(𝑗 = 𝐿, 1 , 0 ) ∈ V
14		ovex 7400	. . . . 5 ⊢ (𝑖𝑀𝑗) ∈ V
15	13, 14	ifex 4517	. . . 4 ⊢ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)) ∈ V
16	15	a1i 11	. . 3 ⊢ (((𝑀 ∈ 𝐵 ∧ (𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) ∧ (𝑖 = 𝐼 ∧ 𝑗 = 𝐽)) → if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)) ∈ V)
17		eqeq1 2740	. . . . . 6 ⊢ (𝑖 = 𝐼 → (𝑖 = 𝐾 ↔ 𝐼 = 𝐾))
18	17	adantr 480	. . . . 5 ⊢ ((𝑖 = 𝐼 ∧ 𝑗 = 𝐽) → (𝑖 = 𝐾 ↔ 𝐼 = 𝐾))
19		eqeq1 2740	. . . . . . 7 ⊢ (𝑗 = 𝐽 → (𝑗 = 𝐿 ↔ 𝐽 = 𝐿))
20	19	adantl 481	. . . . . 6 ⊢ ((𝑖 = 𝐼 ∧ 𝑗 = 𝐽) → (𝑗 = 𝐿 ↔ 𝐽 = 𝐿))
21	20	ifbid 4490	. . . . 5 ⊢ ((𝑖 = 𝐼 ∧ 𝑗 = 𝐽) → if(𝑗 = 𝐿, 1 , 0 ) = if(𝐽 = 𝐿, 1 , 0 ))
22		oveq12 7376	. . . . 5 ⊢ ((𝑖 = 𝐼 ∧ 𝑗 = 𝐽) → (𝑖𝑀𝑗) = (𝐼𝑀𝐽))
23	18, 21, 22	ifbieq12d 4495	. . . 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 7525	. 2 ⊢ ((𝑀 ∈ 𝐵 ∧ (𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → ((𝐾(𝑄‘𝑀)𝐿) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗))) → (𝐼(𝐾(𝑄‘𝑀)𝐿)𝐽) = if(𝐼 = 𝐾, if(𝐽 = 𝐿, 1 , 0 ), (𝐼𝑀𝐽))))
26	8, 25	mpd 15	1 ⊢ ((𝑀 ∈ 𝐵 ∧ (𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → (𝐼(𝐾(𝑄‘𝑀)𝐿)𝐽) = if(𝐼 = 𝐾, if(𝐽 = 𝐿, 1 , 0 ), (𝐼𝑀𝐽)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  Vcvv 3429  ifcif 4466  ‘cfv 6498  (class class class)co 7367   ∈ cmpo 7369  Basecbs 17179  0_gc0g 17402  1_rcur 20162   Mat cmat 22372   minMatR1 cminmar1 22598

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-cnex 11094  ax-1cn 11096  ax-addcl 11098

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-1st 7942  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-nn 12175  df-slot 17152  df-ndx 17164  df-base 17180  df-mat 22373  df-minmar1 22600

This theorem is referenced by:  madjusmdetlem1  33971