Theorem maducoeval 23009

Description: An entry of 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
maducoeval	⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝐼(𝐽‘𝑀)𝐻) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), (𝑘𝑀𝑙)))))

Distinct variable groups:   𝑘,𝑁,𝑙   𝑅,𝑘,𝑙   𝑘,𝑀,𝑙   𝑘,𝐼,𝑙   𝑘,𝐻,𝑙

Allowed substitution hints:   𝐴(𝑘, 𝑙)   𝐵(𝑘, 𝑙)   𝐷(𝑘, 𝑙)   1 (𝑘, 𝑙)   𝐽(𝑘, 𝑙)   0 (𝑘, 𝑙)

Proof of Theorem maducoeval

Dummy variables 𝑖 𝑗 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		madufval.a	. . . 4 ⊢ 𝐴 = (𝑁 Mat 𝑅)
2		madufval.d	. . . 4 ⊢ 𝐷 = (𝑁 maDet 𝑅)
3		madufval.j	. . . 4 ⊢ 𝐽 = (𝑁 maAdju 𝑅)
4		madufval.b	. . . 4 ⊢ 𝐵 = (Base‘𝐴)
5		madufval.o	. . . 4 ⊢ 1 = (1r‘𝑅)
6		madufval.z	. . . 4 ⊢ 0 = (0g‘𝑅)
7	1, 2, 3, 4, 5, 6	maduval 23008	. . 3 ⊢ (𝑀 ∈ 𝐵 → (𝐽‘𝑀) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑀𝑙))))))
8	7	3ad2ant1 1151	. 2 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝐽‘𝑀) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑀𝑙))))))
9		simp1r 1217	. . . . . . 7 ⊢ (((𝑖 = 𝐼 ∧ 𝑗 = 𝐻) ∧ 𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) → 𝑗 = 𝐻)
10	9	eqeq2d 2774	. . . . . 6 ⊢ (((𝑖 = 𝐼 ∧ 𝑗 = 𝐻) ∧ 𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) → (𝑘 = 𝑗 ↔ 𝑘 = 𝐻))
11		simp1l 1216	. . . . . . . 8 ⊢ (((𝑖 = 𝐼 ∧ 𝑗 = 𝐻) ∧ 𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) → 𝑖 = 𝐼)
12	11	eqeq2d 2774	. . . . . . 7 ⊢ (((𝑖 = 𝐼 ∧ 𝑗 = 𝐻) ∧ 𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) → (𝑙 = 𝑖 ↔ 𝑙 = 𝐼))
13	12	ifbid 4509	. . . . . 6 ⊢ (((𝑖 = 𝐼 ∧ 𝑗 = 𝐻) ∧ 𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) → if(𝑙 = 𝑖, 1 , 0 ) = if(𝑙 = 𝐼, 1 , 0 ))
14	10, 13	ifbieq1d 4510	. . . . 5 ⊢ (((𝑖 = 𝐼 ∧ 𝑗 = 𝐻) ∧ 𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) → if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑀𝑙)) = if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), (𝑘𝑀𝑙)))
15	14	mpoeq3dva 7528	. . . 4 ⊢ ((𝑖 = 𝐼 ∧ 𝑗 = 𝐻) → (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑀𝑙))) = (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), (𝑘𝑀𝑙))))
16	15	fveq2d 6920	. . 3 ⊢ ((𝑖 = 𝐼 ∧ 𝑗 = 𝐻) → (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑀𝑙)))) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), (𝑘𝑀𝑙)))))
17	16	adantl 487	. 2 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑖 = 𝐼 ∧ 𝑗 = 𝐻)) → (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑗, if(𝑙 = 𝑖, 1 , 0 ), (𝑘𝑀𝑙)))) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), (𝑘𝑀𝑙)))))
18		simp2 1155	. 2 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → 𝐼 ∈ 𝑁)
19		simp3 1156	. 2 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → 𝐻 ∈ 𝑁)
20		fvexd 6931	. 2 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), (𝑘𝑀𝑙)))) ∈ V)
21	8, 17, 18, 19, 20	ovmpod 7604	1 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝐼(𝐽‘𝑀)𝐻) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), (𝑘𝑀𝑙)))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  Vcvv 3454  ifcif 4485  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453  Basecbs 17431  0_gc0g 17660  1_rcur 20458   Mat cmat 22777   maDet cmdat 22954   maAdju cmadu 23002

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-1cn 11297  ax-addcl 11299

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-nn 12376  df-slot 17404  df-ndx 17416  df-base 17432  df-mat 22778  df-madu 23004

This theorem is used by:  maducoeval2  23010  madugsum  23013  maducoevalmin1  23022