Theorem minmar1fval 22639

Description: First substitution for the definition 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
minmar1fval	⊢ 𝑄 = (𝑚 ∈ 𝐵 ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗)))))

Distinct variable groups:   𝐵,𝑚   𝑖,𝑁,𝑗,𝑘,𝑙,𝑚   𝑅,𝑖,𝑗,𝑘,𝑙,𝑚

Allowed substitution hints:   𝐴(𝑖,𝑗,𝑘,𝑚,𝑙)   𝐵(𝑖,𝑗,𝑘,𝑙)   𝑄(𝑖,𝑗,𝑘,𝑚,𝑙)   1 (𝑖,𝑗,𝑘,𝑚,𝑙)   0 (𝑖,𝑗,𝑘,𝑚,𝑙)

Proof of Theorem minmar1fval

Dummy variables 𝑛 𝑟 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		minmar1fval.q	. 2 ⊢ 𝑄 = (𝑁 minMatR1 𝑅)
2		oveq12 7436	. . . . . . . 8 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑛 Mat 𝑟) = (𝑁 Mat 𝑅))
3		minmar1fval.a	. . . . . . . 8 ⊢ 𝐴 = (𝑁 Mat 𝑅)
4	2, 3	eqtr4di 2787	. . . . . . 7 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑛 Mat 𝑟) = 𝐴)
5	4	fveq2d 6907	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = (Base‘𝐴))
6		minmar1fval.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐴)
7	5, 6	eqtr4di 2787	. . . . 5 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = 𝐵)
8		simpl 481	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → 𝑛 = 𝑁)
9		fveq2 6903	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑅 → (1r‘𝑟) = (1r‘𝑅))
10		minmar1fval.o	. . . . . . . . . . 11 ⊢ 1 = (1r‘𝑅)
11	9, 10	eqtr4di 2787	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (1r‘𝑟) = 1 )
12		fveq2 6903	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = (0g‘𝑅))
13		minmar1fval.z	. . . . . . . . . . 11 ⊢ 0 = (0g‘𝑅)
14	12, 13	eqtr4di 2787	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = 0 )
15	11, 14	ifeq12d 4555	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → if(𝑗 = 𝑙, (1r‘𝑟), (0g‘𝑟)) = if(𝑗 = 𝑙, 1 , 0 ))
16	15	ifeq1d 4553	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → if(𝑖 = 𝑘, if(𝑗 = 𝑙, (1r‘𝑟), (0g‘𝑟)), (𝑖𝑚𝑗)) = if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗)))
17	16	adantl 480	. . . . . . 7 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → if(𝑖 = 𝑘, if(𝑗 = 𝑙, (1r‘𝑟), (0g‘𝑟)), (𝑖𝑚𝑗)) = if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗)))
18	8, 8, 17	mpoeq123dv 7503	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑖 ∈ 𝑛, 𝑗 ∈ 𝑛 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, (1r‘𝑟), (0g‘𝑟)), (𝑖𝑚𝑗))) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗))))
19	8, 8, 18	mpoeq123dv 7503	. . . . 5 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑘 ∈ 𝑛, 𝑙 ∈ 𝑛 ↦ (𝑖 ∈ 𝑛, 𝑗 ∈ 𝑛 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, (1r‘𝑟), (0g‘𝑟)), (𝑖𝑚𝑗)))) = (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗)))))
20	7, 19	mpteq12dv 5245	. . . 4 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ↦ (𝑘 ∈ 𝑛, 𝑙 ∈ 𝑛 ↦ (𝑖 ∈ 𝑛, 𝑗 ∈ 𝑛 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, (1r‘𝑟), (0g‘𝑟)), (𝑖𝑚𝑗))))) = (𝑚 ∈ 𝐵 ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗))))))
21		df-minmar1 22628	. . . 4 ⊢ minMatR1 = (𝑛 ∈ V, 𝑟 ∈ V ↦ (𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ↦ (𝑘 ∈ 𝑛, 𝑙 ∈ 𝑛 ↦ (𝑖 ∈ 𝑛, 𝑗 ∈ 𝑛 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, (1r‘𝑟), (0g‘𝑟)), (𝑖𝑚𝑗))))))
22	6	fvexi 6917	. . . . 5 ⊢ 𝐵 ∈ V
23	22	mptex 7242	. . . 4 ⊢ (𝑚 ∈ 𝐵 ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗))))) ∈ V
24	20, 21, 23	ovmpoa 7583	. . 3 ⊢ ((𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 minMatR1 𝑅) = (𝑚 ∈ 𝐵 ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗))))))
25	21	mpondm0 7668	. . . . 5 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 minMatR1 𝑅) = ∅)
26		mpt0 6705	. . . . 5 ⊢ (𝑚 ∈ ∅ ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗))))) = ∅
27	25, 26	eqtr4di 2787	. . . 4 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 minMatR1 𝑅) = (𝑚 ∈ ∅ ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗))))))
28	3	fveq2i 6906	. . . . . . 7 ⊢ (Base‘𝐴) = (Base‘(𝑁 Mat 𝑅))
29	6, 28	eqtri 2757	. . . . . 6 ⊢ 𝐵 = (Base‘(𝑁 Mat 𝑅))
30		matbas0pc 22400	. . . . . 6 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (Base‘(𝑁 Mat 𝑅)) = ∅)
31	29, 30	eqtrid 2781	. . . . 5 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → 𝐵 = ∅)
32	31	mpteq1d 5249	. . . 4 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑚 ∈ 𝐵 ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗))))) = (𝑚 ∈ ∅ ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗))))))
33	27, 32	eqtr4d 2772	. . 3 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 minMatR1 𝑅) = (𝑚 ∈ 𝐵 ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗))))))
34	24, 33	pm2.61i 182	. 2 ⊢ (𝑁 minMatR1 𝑅) = (𝑚 ∈ 𝐵 ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗)))))
35	1, 34	eqtri 2757	1 ⊢ 𝑄 = (𝑚 ∈ 𝐵 ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗)))))

Syntax hints:  ¬ wn 3   ∧ wa 394   = wceq 1534   ∈ wcel 2100  Vcvv 3472  ∅c0 4333  ifcif 4534   ↦ cmpt 5237  ‘cfv 6556  (class class class)co 7427   ∈ cmpo 7429  Basecbs 17226  0_gc0g 17467  1_rcur 20176   Mat cmat 22398   minMatR1 cminmar1 22626

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2102  ax-9 2110  ax-10 2133  ax-11 2150  ax-12 2170  ax-ext 2700  ax-rep 5291  ax-sep 5305  ax-nul 5312  ax-pow 5371  ax-pr 5435  ax-un 7748  ax-cnex 11215  ax-1cn 11217  ax-addcl 11219

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3or 1085  df-3an 1086  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2062  df-mo 2532  df-eu 2561  df-clab 2707  df-cleq 2721  df-clel 2806  df-nfc 2881  df-ne 2934  df-ral 3055  df-rex 3064  df-reu 3374  df-rab 3429  df-v 3474  df-sbc 3788  df-csb 3904  df-dif 3961  df-un 3963  df-in 3965  df-ss 3975  df-pss 3978  df-nul 4334  df-if 4535  df-pw 4610  df-sn 4635  df-pr 4637  df-op 4641  df-uni 4917  df-iun 5006  df-br 5155  df-opab 5217  df-mpt 5238  df-tr 5272  df-id 5582  df-eprel 5588  df-po 5596  df-so 5597  df-fr 5639  df-we 5641  df-xp 5690  df-rel 5691  df-cnv 5692  df-co 5693  df-dm 5694  df-rn 5695  df-res 5696  df-ima 5697  df-pred 6315  df-ord 6381  df-on 6382  df-lim 6383  df-suc 6384  df-iota 6508  df-fun 6558  df-fn 6559  df-f 6560  df-f1 6561  df-fo 6562  df-f1o 6563  df-fv 6564  df-ov 7430  df-oprab 7431  df-mpo 7432  df-om 7882  df-2nd 8009  df-frecs 8300  df-wrecs 8331  df-recs 8405  df-rdg 8444  df-nn 12269  df-slot 17197  df-ndx 17209  df-base 17227  df-mat 22399  df-minmar1 22628

This theorem is referenced by:  minmar1val0  22640