Theorem smadiadetglem1 22793

Description: Lemma 1 for smadiadetg 22795. (Contributed by AV, 13-Feb-2019.)

Hypotheses

Ref	Expression
smadiadet.a	⊢ 𝐴 = (𝑁 Mat 𝑅)
smadiadet.b	⊢ 𝐵 = (Base‘𝐴)
smadiadet.r	⊢ 𝑅 ∈ CRing
smadiadet.d	⊢ 𝐷 = (𝑁 maDet 𝑅)
smadiadet.h	⊢ 𝐸 = ((𝑁 ∖ {𝐾}) maDet 𝑅)

Assertion

Ref	Expression
smadiadetglem1	⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅)) → ((𝐾(𝑀(𝑁 matRRep 𝑅)𝑆)𝐾) ↾ ((𝑁 ∖ {𝐾}) × 𝑁)) = ((𝐾((𝑁 minMatR1 𝑅)‘𝑀)𝐾) ↾ ((𝑁 ∖ {𝐾}) × 𝑁)))

Proof of Theorem smadiadetglem1

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

Step	Hyp	Ref	Expression
1		mpodifsnif 7523	. . . . 5 ⊢ (𝑖 ∈ (𝑁 ∖ {𝐾}), 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐾, 𝑆, (0g‘𝑅)), (𝑖𝑀𝑗))) = (𝑖 ∈ (𝑁 ∖ {𝐾}), 𝑗 ∈ 𝑁 ↦ (𝑖𝑀𝑗))
2		mpodifsnif 7523	. . . . 5 ⊢ (𝑖 ∈ (𝑁 ∖ {𝐾}), 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐾, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗))) = (𝑖 ∈ (𝑁 ∖ {𝐾}), 𝑗 ∈ 𝑁 ↦ (𝑖𝑀𝑗))
3	1, 2	eqtr4i 2795	. . . 4 ⊢ (𝑖 ∈ (𝑁 ∖ {𝐾}), 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐾, 𝑆, (0g‘𝑅)), (𝑖𝑀𝑗))) = (𝑖 ∈ (𝑁 ∖ {𝐾}), 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐾, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗)))
4		difss 4098	. . . . . 6 ⊢ (𝑁 ∖ {𝐾}) ⊆ 𝑁
5		ssid 3967	. . . . . 6 ⊢ 𝑁 ⊆ 𝑁
6	4, 5	pm3.2i 475	. . . . 5 ⊢ ((𝑁 ∖ {𝐾}) ⊆ 𝑁 ∧ 𝑁 ⊆ 𝑁)
7		resmpo 7528	. . . . 5 ⊢ (((𝑁 ∖ {𝐾}) ⊆ 𝑁 ∧ 𝑁 ⊆ 𝑁) → ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐾, 𝑆, (0g‘𝑅)), (𝑖𝑀𝑗))) ↾ ((𝑁 ∖ {𝐾}) × 𝑁)) = (𝑖 ∈ (𝑁 ∖ {𝐾}), 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐾, 𝑆, (0g‘𝑅)), (𝑖𝑀𝑗))))
8	6, 7	mp1i 14	. . . 4 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅)) → ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐾, 𝑆, (0g‘𝑅)), (𝑖𝑀𝑗))) ↾ ((𝑁 ∖ {𝐾}) × 𝑁)) = (𝑖 ∈ (𝑁 ∖ {𝐾}), 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐾, 𝑆, (0g‘𝑅)), (𝑖𝑀𝑗))))
9		resmpo 7528	. . . . 5 ⊢ (((𝑁 ∖ {𝐾}) ⊆ 𝑁 ∧ 𝑁 ⊆ 𝑁) → ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐾, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗))) ↾ ((𝑁 ∖ {𝐾}) × 𝑁)) = (𝑖 ∈ (𝑁 ∖ {𝐾}), 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐾, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗))))
10	6, 9	mp1i 14	. . . 4 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅)) → ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐾, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗))) ↾ ((𝑁 ∖ {𝐾}) × 𝑁)) = (𝑖 ∈ (𝑁 ∖ {𝐾}), 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐾, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗))))
11	3, 8, 10	3eqtr4a 2830	. . 3 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅)) → ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐾, 𝑆, (0g‘𝑅)), (𝑖𝑀𝑗))) ↾ ((𝑁 ∖ {𝐾}) × 𝑁)) = ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐾, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗))) ↾ ((𝑁 ∖ {𝐾}) × 𝑁)))
12		simp1 1152	. . . . 5 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅)) → 𝑀 ∈ 𝐵)
13		simp3 1154	. . . . 5 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅)) → 𝑆 ∈ (Base‘𝑅))
14		simp2 1153	. . . . 5 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅)) → 𝐾 ∈ 𝑁)
15		smadiadet.a	. . . . . 6 ⊢ 𝐴 = (𝑁 Mat 𝑅)
16		smadiadet.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐴)
17		eqid 2769	. . . . . 6 ⊢ (𝑁 matRRep 𝑅) = (𝑁 matRRep 𝑅)
18		eqid 2769	. . . . . 6 ⊢ (0g‘𝑅) = (0g‘𝑅)
19	15, 16, 17, 18	marrepval 22684	. . . . 5 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝑆 ∈ (Base‘𝑅)) ∧ (𝐾 ∈ 𝑁 ∧ 𝐾 ∈ 𝑁)) → (𝐾(𝑀(𝑁 matRRep 𝑅)𝑆)𝐾) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐾, 𝑆, (0g‘𝑅)), (𝑖𝑀𝑗))))
20	12, 13, 14, 14, 19	syl22anc 851	. . . 4 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅)) → (𝐾(𝑀(𝑁 matRRep 𝑅)𝑆)𝐾) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐾, 𝑆, (0g‘𝑅)), (𝑖𝑀𝑗))))
21	20	reseq1d 5975	. . 3 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅)) → ((𝐾(𝑀(𝑁 matRRep 𝑅)𝑆)𝐾) ↾ ((𝑁 ∖ {𝐾}) × 𝑁)) = ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐾, 𝑆, (0g‘𝑅)), (𝑖𝑀𝑗))) ↾ ((𝑁 ∖ {𝐾}) × 𝑁)))
22		smadiadet.r	. . . . . 6 ⊢ 𝑅 ∈ CRing
23		crngring 20323	. . . . . . 7 ⊢ (𝑅 ∈ CRing → 𝑅 ∈ Ring)
24		eqid 2769	. . . . . . . 8 ⊢ (Base‘𝑅) = (Base‘𝑅)
25		eqid 2769	. . . . . . . 8 ⊢ (1r‘𝑅) = (1r‘𝑅)
26	24, 25	ringidcl 20344	. . . . . . 7 ⊢ (𝑅 ∈ Ring → (1r‘𝑅) ∈ (Base‘𝑅))
27	23, 26	syl 18	. . . . . 6 ⊢ (𝑅 ∈ CRing → (1r‘𝑅) ∈ (Base‘𝑅))
28	22, 27	mp1i 14	. . . . 5 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅)) → (1r‘𝑅) ∈ (Base‘𝑅))
29	15, 16, 17, 18	marrepval 22684	. . . . 5 ⊢ (((𝑀 ∈ 𝐵 ∧ (1r‘𝑅) ∈ (Base‘𝑅)) ∧ (𝐾 ∈ 𝑁 ∧ 𝐾 ∈ 𝑁)) → (𝐾(𝑀(𝑁 matRRep 𝑅)(1r‘𝑅))𝐾) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐾, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗))))
30	12, 28, 14, 14, 29	syl22anc 851	. . . 4 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅)) → (𝐾(𝑀(𝑁 matRRep 𝑅)(1r‘𝑅))𝐾) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐾, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗))))
31	30	reseq1d 5975	. . 3 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅)) → ((𝐾(𝑀(𝑁 matRRep 𝑅)(1r‘𝑅))𝐾) ↾ ((𝑁 ∖ {𝐾}) × 𝑁)) = ((𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐾, (1r‘𝑅), (0g‘𝑅)), (𝑖𝑀𝑗))) ↾ ((𝑁 ∖ {𝐾}) × 𝑁)))
32	11, 21, 31	3eqtr4d 2814	. 2 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅)) → ((𝐾(𝑀(𝑁 matRRep 𝑅)𝑆)𝐾) ↾ ((𝑁 ∖ {𝐾}) × 𝑁)) = ((𝐾(𝑀(𝑁 matRRep 𝑅)(1r‘𝑅))𝐾) ↾ ((𝑁 ∖ {𝐾}) × 𝑁)))
33	22, 23	ax-mp 5	. . . . . 6 ⊢ 𝑅 ∈ Ring
34	15, 16, 25	minmar1marrep 22772	. . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) → ((𝑁 minMatR1 𝑅)‘𝑀) = (𝑀(𝑁 matRRep 𝑅)(1r‘𝑅)))
35	33, 12, 34	sylancr 598	. . . . 5 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅)) → ((𝑁 minMatR1 𝑅)‘𝑀) = (𝑀(𝑁 matRRep 𝑅)(1r‘𝑅)))
36	35	eqcomd 2775	. . . 4 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅)) → (𝑀(𝑁 matRRep 𝑅)(1r‘𝑅)) = ((𝑁 minMatR1 𝑅)‘𝑀))
37	36	oveqd 7425	. . 3 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅)) → (𝐾(𝑀(𝑁 matRRep 𝑅)(1r‘𝑅))𝐾) = (𝐾((𝑁 minMatR1 𝑅)‘𝑀)𝐾))
38	37	reseq1d 5975	. 2 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅)) → ((𝐾(𝑀(𝑁 matRRep 𝑅)(1r‘𝑅))𝐾) ↾ ((𝑁 ∖ {𝐾}) × 𝑁)) = ((𝐾((𝑁 minMatR1 𝑅)‘𝑀)𝐾) ↾ ((𝑁 ∖ {𝐾}) × 𝑁)))
39	32, 38	eqtrd 2804	1 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝑆 ∈ (Base‘𝑅)) → ((𝐾(𝑀(𝑁 matRRep 𝑅)𝑆)𝐾) ↾ ((𝑁 ∖ {𝐾}) × 𝑁)) = ((𝐾((𝑁 minMatR1 𝑅)‘𝑀)𝐾) ↾ ((𝑁 ∖ {𝐾}) × 𝑁)))

Syntax hints:   → wi 4   ∧ wa 400   ∧ w3a 1101   = wceq 1567   ∈ wcel 2149   ∖ cdif 3910   ⊆ wss 3913  ifcif 4489  {csn 4591   × cxp 5657   ↾ cres 5661  ‘cfv 6533  (class class class)co 7408   ∈ cmpo 7410  Basecbs 17265  0_gc0g 17488  1_rcur 20259  Ringcrg 20311  CRingccrg 20312   Mat cmat 22529   matRRep cmarrep 22678   maDet cmdat 22706   minMatR1 cminmar1 22755

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5239  ax-sep 5258  ax-nul 5268  ax-pow 5334  ax-pr 5402  ax-un 7730  ax-cnex 11152  ax-resscn 11153  ax-1cn 11154  ax-icn 11155  ax-addcl 11156  ax-addrcl 11157  ax-mulcl 11158  ax-mulrcl 11159  ax-mulcom 11160  ax-addass 11161  ax-mulass 11162  ax-distr 11163  ax-i2m1 11164  ax-1ne0 11165  ax-1rid 11166  ax-rnegex 11167  ax-rrecex 11168  ax-cnre 11169  ax-pre-lttri 11170  ax-pre-lttrn 11171  ax-pre-ltadd 11172  ax-pre-mulgt0 11173

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-nel 3071  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7365  df-ov 7411  df-oprab 7412  df-mpo 7413  df-om 7859  df-1st 7982  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-er 8690  df-en 8940  df-dom 8941  df-sdom 8942  df-pnf 11241  df-mnf 11242  df-xr 11243  df-ltxr 11244  df-le 11245  df-sub 11439  df-neg 11440  df-nn 12230  df-2 12299  df-sets 17220  df-slot 17238  df-ndx 17250  df-base 17266  df-plusg 17319  df-0g 17490  df-mgm 18694  df-sgrp 18773  df-mnd 18789  df-mgp 20213  df-ur 20260  df-ring 20313  df-cring 20314  df-mat 22530  df-marrep 22680  df-minmar1 22757

This theorem is referenced by:  smadiadetg  22795