Theorem minmar1fval 22562

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 7361	. . . . . . . 8 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑛 Mat 𝑟) = (𝑁 Mat 𝑅))
3		minmar1fval.a	. . . . . . . 8 ⊢ 𝐴 = (𝑁 Mat 𝑅)
4	2, 3	eqtr4di 2786	. . . . . . 7 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑛 Mat 𝑟) = 𝐴)
5	4	fveq2d 6832	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = (Base‘𝐴))
6		minmar1fval.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐴)
7	5, 6	eqtr4di 2786	. . . . 5 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = 𝐵)
8		simpl 482	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → 𝑛 = 𝑁)
9		fveq2 6828	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑅 → (1r‘𝑟) = (1r‘𝑅))
10		minmar1fval.o	. . . . . . . . . . 11 ⊢ 1 = (1r‘𝑅)
11	9, 10	eqtr4di 2786	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (1r‘𝑟) = 1 )
12		fveq2 6828	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = (0g‘𝑅))
13		minmar1fval.z	. . . . . . . . . . 11 ⊢ 0 = (0g‘𝑅)
14	12, 13	eqtr4di 2786	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = 0 )
15	11, 14	ifeq12d 4496	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → if(𝑗 = 𝑙, (1r‘𝑟), (0g‘𝑟)) = if(𝑗 = 𝑙, 1 , 0 ))
16	15	ifeq1d 4494	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → if(𝑖 = 𝑘, if(𝑗 = 𝑙, (1r‘𝑟), (0g‘𝑟)), (𝑖𝑚𝑗)) = if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗)))
17	16	adantl 481	. . . . . . 7 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → if(𝑖 = 𝑘, if(𝑗 = 𝑙, (1r‘𝑟), (0g‘𝑟)), (𝑖𝑚𝑗)) = if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗)))
18	8, 8, 17	mpoeq123dv 7427	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑖 ∈ 𝑛, 𝑗 ∈ 𝑛 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, (1r‘𝑟), (0g‘𝑟)), (𝑖𝑚𝑗))) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗))))
19	8, 8, 18	mpoeq123dv 7427	. . . . 5 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑘 ∈ 𝑛, 𝑙 ∈ 𝑛 ↦ (𝑖 ∈ 𝑛, 𝑗 ∈ 𝑛 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, (1r‘𝑟), (0g‘𝑟)), (𝑖𝑚𝑗)))) = (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗)))))
20	7, 19	mpteq12dv 5180	. . . 4 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ↦ (𝑘 ∈ 𝑛, 𝑙 ∈ 𝑛 ↦ (𝑖 ∈ 𝑛, 𝑗 ∈ 𝑛 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, (1r‘𝑟), (0g‘𝑟)), (𝑖𝑚𝑗))))) = (𝑚 ∈ 𝐵 ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗))))))
21		df-minmar1 22551	. . . 4 ⊢ minMatR1 = (𝑛 ∈ V, 𝑟 ∈ V ↦ (𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ↦ (𝑘 ∈ 𝑛, 𝑙 ∈ 𝑛 ↦ (𝑖 ∈ 𝑛, 𝑗 ∈ 𝑛 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, (1r‘𝑟), (0g‘𝑟)), (𝑖𝑚𝑗))))))
22	6	fvexi 6842	. . . . 5 ⊢ 𝐵 ∈ V
23	22	mptex 7163	. . . 4 ⊢ (𝑚 ∈ 𝐵 ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗))))) ∈ V
24	20, 21, 23	ovmpoa 7507	. . 3 ⊢ ((𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 minMatR1 𝑅) = (𝑚 ∈ 𝐵 ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗))))))
25	21	mpondm0 7592	. . . . 5 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 minMatR1 𝑅) = ∅)
26		mpt0 6628	. . . . 5 ⊢ (𝑚 ∈ ∅ ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗))))) = ∅
27	25, 26	eqtr4di 2786	. . . 4 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 minMatR1 𝑅) = (𝑚 ∈ ∅ ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗))))))
28	3	fveq2i 6831	. . . . . . 7 ⊢ (Base‘𝐴) = (Base‘(𝑁 Mat 𝑅))
29	6, 28	eqtri 2756	. . . . . 6 ⊢ 𝐵 = (Base‘(𝑁 Mat 𝑅))
30		matbas0pc 22325	. . . . . 6 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (Base‘(𝑁 Mat 𝑅)) = ∅)
31	29, 30	eqtrid 2780	. . . . 5 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → 𝐵 = ∅)
32	31	mpteq1d 5183	. . . 4 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑚 ∈ 𝐵 ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗))))) = (𝑚 ∈ ∅ ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗))))))
33	27, 32	eqtr4d 2771	. . 3 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 minMatR1 𝑅) = (𝑚 ∈ 𝐵 ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗))))))
34	24, 33	pm2.61i 182	. 2 ⊢ (𝑁 minMatR1 𝑅) = (𝑚 ∈ 𝐵 ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗)))))
35	1, 34	eqtri 2756	1 ⊢ 𝑄 = (𝑚 ∈ 𝐵 ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝑘, if(𝑗 = 𝑙, 1 , 0 ), (𝑖𝑚𝑗)))))

Syntax hints:  ¬ wn 3   ∧ wa 395   = wceq 1541   ∈ wcel 2113  Vcvv 3437  ∅c0 4282  ifcif 4474   ↦ cmpt 5174  ‘cfv 6486  (class class class)co 7352   ∈ cmpo 7354  Basecbs 17122  0_gc0g 17345  1_rcur 20101   Mat cmat 22323   minMatR1 cminmar1 22549

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-rep 5219  ax-sep 5236  ax-nul 5246  ax-pow 5305  ax-pr 5372  ax-un 7674  ax-cnex 11069  ax-1cn 11071  ax-addcl 11073

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-ral 3049  df-rex 3058  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4283  df-if 4475  df-pw 4551  df-sn 4576  df-pr 4578  df-op 4582  df-uni 4859  df-iun 4943  df-br 5094  df-opab 5156  df-mpt 5175  df-tr 5201  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6253  df-ord 6314  df-on 6315  df-lim 6316  df-suc 6317  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-ov 7355  df-oprab 7356  df-mpo 7357  df-om 7803  df-2nd 7928  df-frecs 8217  df-wrecs 8248  df-recs 8297  df-rdg 8335  df-nn 12133  df-slot 17095  df-ndx 17107  df-base 17123  df-mat 22324  df-minmar1 22551

This theorem is referenced by:  minmar1val0  22563