Theorem mdetfval 22542

Description: First substitution for the determinant definition. (Contributed by Stefan O'Rear, 9-Sep-2015.) (Revised by SO, 9-Jul-2018.)

Hypotheses

Ref	Expression
mdetfval.d	⊢ 𝐷 = (𝑁 maDet 𝑅)
mdetfval.a	⊢ 𝐴 = (𝑁 Mat 𝑅)
mdetfval.b	⊢ 𝐵 = (Base‘𝐴)
mdetfval.p	⊢ 𝑃 = (Base‘(SymGrp‘𝑁))
mdetfval.y	⊢ 𝑌 = (ℤRHom‘𝑅)
mdetfval.s	⊢ 𝑆 = (pmSgn‘𝑁)
mdetfval.t	⊢ · = (.r‘𝑅)
mdetfval.u	⊢ 𝑈 = (mulGrp‘𝑅)

Assertion

Ref	Expression
mdetfval	⊢ 𝐷 = (𝑚 ∈ 𝐵 ↦ (𝑅 Σg (𝑝 ∈ 𝑃 ↦ (((𝑌 ∘ 𝑆)‘𝑝) · (𝑈 Σg (𝑥 ∈ 𝑁 ↦ ((𝑝‘𝑥)𝑚𝑥)))))))

Distinct variable groups:   𝐵,𝑚   𝑚,𝑝,𝑥,𝑁   𝑃,𝑚   𝑅,𝑚,𝑝,𝑥   𝑆,𝑚   · ,𝑚   𝑈,𝑚   𝑚,𝑌

Allowed substitution hints:   𝐴(𝑥,𝑚,𝑝)   𝐵(𝑥,𝑝)   𝐷(𝑥,𝑚,𝑝)   𝑃(𝑥,𝑝)   𝑆(𝑥,𝑝)   · (𝑥,𝑝)   𝑈(𝑥,𝑝)   𝑌(𝑥,𝑝)

Proof of Theorem mdetfval

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

Step	Hyp	Ref	Expression
1		mdetfval.d	. 2 ⊢ 𝐷 = (𝑁 maDet 𝑅)
2		oveq12 7377	. . . . . . . 8 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑛 Mat 𝑟) = (𝑁 Mat 𝑅))
3		mdetfval.a	. . . . . . . 8 ⊢ 𝐴 = (𝑁 Mat 𝑅)
4	2, 3	eqtr4di 2790	. . . . . . 7 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑛 Mat 𝑟) = 𝐴)
5	4	fveq2d 6846	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = (Base‘𝐴))
6		mdetfval.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐴)
7	5, 6	eqtr4di 2790	. . . . 5 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = 𝐵)
8		simpr 484	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → 𝑟 = 𝑅)
9		simpl 482	. . . . . . . . . 10 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → 𝑛 = 𝑁)
10	9	fveq2d 6846	. . . . . . . . 9 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (SymGrp‘𝑛) = (SymGrp‘𝑁))
11	10	fveq2d 6846	. . . . . . . 8 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (Base‘(SymGrp‘𝑛)) = (Base‘(SymGrp‘𝑁)))
12		mdetfval.p	. . . . . . . 8 ⊢ 𝑃 = (Base‘(SymGrp‘𝑁))
13	11, 12	eqtr4di 2790	. . . . . . 7 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (Base‘(SymGrp‘𝑛)) = 𝑃)
14		fveq2 6842	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (.r‘𝑟) = (.r‘𝑅))
15	14	adantl 481	. . . . . . . . 9 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (.r‘𝑟) = (.r‘𝑅))
16		mdetfval.t	. . . . . . . . 9 ⊢ · = (.r‘𝑅)
17	15, 16	eqtr4di 2790	. . . . . . . 8 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (.r‘𝑟) = · )
18	8	fveq2d 6846	. . . . . . . . . . 11 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (ℤRHom‘𝑟) = (ℤRHom‘𝑅))
19		mdetfval.y	. . . . . . . . . . 11 ⊢ 𝑌 = (ℤRHom‘𝑅)
20	18, 19	eqtr4di 2790	. . . . . . . . . 10 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (ℤRHom‘𝑟) = 𝑌)
21		fveq2 6842	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑁 → (pmSgn‘𝑛) = (pmSgn‘𝑁))
22	21	adantr 480	. . . . . . . . . . 11 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (pmSgn‘𝑛) = (pmSgn‘𝑁))
23		mdetfval.s	. . . . . . . . . . 11 ⊢ 𝑆 = (pmSgn‘𝑁)
24	22, 23	eqtr4di 2790	. . . . . . . . . 10 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (pmSgn‘𝑛) = 𝑆)
25	20, 24	coeq12d 5821	. . . . . . . . 9 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → ((ℤRHom‘𝑟) ∘ (pmSgn‘𝑛)) = (𝑌 ∘ 𝑆))
26	25	fveq1d 6844	. . . . . . . 8 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (((ℤRHom‘𝑟) ∘ (pmSgn‘𝑛))‘𝑝) = ((𝑌 ∘ 𝑆)‘𝑝))
27		fveq2 6842	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑅 → (mulGrp‘𝑟) = (mulGrp‘𝑅))
28	27	adantl 481	. . . . . . . . . 10 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (mulGrp‘𝑟) = (mulGrp‘𝑅))
29		mdetfval.u	. . . . . . . . . 10 ⊢ 𝑈 = (mulGrp‘𝑅)
30	28, 29	eqtr4di 2790	. . . . . . . . 9 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (mulGrp‘𝑟) = 𝑈)
31	9	mpteq1d 5190	. . . . . . . . 9 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑥 ∈ 𝑛 ↦ ((𝑝‘𝑥)𝑚𝑥)) = (𝑥 ∈ 𝑁 ↦ ((𝑝‘𝑥)𝑚𝑥)))
32	30, 31	oveq12d 7386	. . . . . . . 8 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → ((mulGrp‘𝑟) Σg (𝑥 ∈ 𝑛 ↦ ((𝑝‘𝑥)𝑚𝑥))) = (𝑈 Σg (𝑥 ∈ 𝑁 ↦ ((𝑝‘𝑥)𝑚𝑥))))
33	17, 26, 32	oveq123d 7389	. . . . . . 7 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → ((((ℤRHom‘𝑟) ∘ (pmSgn‘𝑛))‘𝑝)(.r‘𝑟)((mulGrp‘𝑟) Σg (𝑥 ∈ 𝑛 ↦ ((𝑝‘𝑥)𝑚𝑥)))) = (((𝑌 ∘ 𝑆)‘𝑝) · (𝑈 Σg (𝑥 ∈ 𝑁 ↦ ((𝑝‘𝑥)𝑚𝑥)))))
34	13, 33	mpteq12dv 5187	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑝 ∈ (Base‘(SymGrp‘𝑛)) ↦ ((((ℤRHom‘𝑟) ∘ (pmSgn‘𝑛))‘𝑝)(.r‘𝑟)((mulGrp‘𝑟) Σg (𝑥 ∈ 𝑛 ↦ ((𝑝‘𝑥)𝑚𝑥))))) = (𝑝 ∈ 𝑃 ↦ (((𝑌 ∘ 𝑆)‘𝑝) · (𝑈 Σg (𝑥 ∈ 𝑁 ↦ ((𝑝‘𝑥)𝑚𝑥))))))
35	8, 34	oveq12d 7386	. . . . 5 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑟 Σg (𝑝 ∈ (Base‘(SymGrp‘𝑛)) ↦ ((((ℤRHom‘𝑟) ∘ (pmSgn‘𝑛))‘𝑝)(.r‘𝑟)((mulGrp‘𝑟) Σg (𝑥 ∈ 𝑛 ↦ ((𝑝‘𝑥)𝑚𝑥)))))) = (𝑅 Σg (𝑝 ∈ 𝑃 ↦ (((𝑌 ∘ 𝑆)‘𝑝) · (𝑈 Σg (𝑥 ∈ 𝑁 ↦ ((𝑝‘𝑥)𝑚𝑥)))))))
36	7, 35	mpteq12dv 5187	. . . 4 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ↦ (𝑟 Σg (𝑝 ∈ (Base‘(SymGrp‘𝑛)) ↦ ((((ℤRHom‘𝑟) ∘ (pmSgn‘𝑛))‘𝑝)(.r‘𝑟)((mulGrp‘𝑟) Σg (𝑥 ∈ 𝑛 ↦ ((𝑝‘𝑥)𝑚𝑥))))))) = (𝑚 ∈ 𝐵 ↦ (𝑅 Σg (𝑝 ∈ 𝑃 ↦ (((𝑌 ∘ 𝑆)‘𝑝) · (𝑈 Σg (𝑥 ∈ 𝑁 ↦ ((𝑝‘𝑥)𝑚𝑥))))))))
37		df-mdet 22541	. . . 4 ⊢ maDet = (𝑛 ∈ V, 𝑟 ∈ V ↦ (𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ↦ (𝑟 Σg (𝑝 ∈ (Base‘(SymGrp‘𝑛)) ↦ ((((ℤRHom‘𝑟) ∘ (pmSgn‘𝑛))‘𝑝)(.r‘𝑟)((mulGrp‘𝑟) Σg (𝑥 ∈ 𝑛 ↦ ((𝑝‘𝑥)𝑚𝑥))))))))
38	6	fvexi 6856	. . . . 5 ⊢ 𝐵 ∈ V
39	38	mptex 7179	. . . 4 ⊢ (𝑚 ∈ 𝐵 ↦ (𝑅 Σg (𝑝 ∈ 𝑃 ↦ (((𝑌 ∘ 𝑆)‘𝑝) · (𝑈 Σg (𝑥 ∈ 𝑁 ↦ ((𝑝‘𝑥)𝑚𝑥))))))) ∈ V
40	36, 37, 39	ovmpoa 7523	. . 3 ⊢ ((𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 maDet 𝑅) = (𝑚 ∈ 𝐵 ↦ (𝑅 Σg (𝑝 ∈ 𝑃 ↦ (((𝑌 ∘ 𝑆)‘𝑝) · (𝑈 Σg (𝑥 ∈ 𝑁 ↦ ((𝑝‘𝑥)𝑚𝑥))))))))
41	37	reldmmpo 7502	. . . . . 6 ⊢ Rel dom maDet
42	41	ovprc 7406	. . . . 5 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 maDet 𝑅) = ∅)
43		mpt0 6642	. . . . 5 ⊢ (𝑚 ∈ ∅ ↦ (𝑅 Σg (𝑝 ∈ 𝑃 ↦ (((𝑌 ∘ 𝑆)‘𝑝) · (𝑈 Σg (𝑥 ∈ 𝑁 ↦ ((𝑝‘𝑥)𝑚𝑥))))))) = ∅
44	42, 43	eqtr4di 2790	. . . 4 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 maDet 𝑅) = (𝑚 ∈ ∅ ↦ (𝑅 Σg (𝑝 ∈ 𝑃 ↦ (((𝑌 ∘ 𝑆)‘𝑝) · (𝑈 Σg (𝑥 ∈ 𝑁 ↦ ((𝑝‘𝑥)𝑚𝑥))))))))
45		df-mat 22364	. . . . . . . . . 10 ⊢ Mat = (𝑦 ∈ Fin, 𝑧 ∈ V ↦ ((𝑧 freeLMod (𝑦 × 𝑦)) sSet ⟨(.r‘ndx), (𝑧 maMul ⟨𝑦, 𝑦, 𝑦⟩)⟩))
46	45	reldmmpo 7502	. . . . . . . . 9 ⊢ Rel dom Mat
47	46	ovprc 7406	. . . . . . . 8 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 Mat 𝑅) = ∅)
48	3, 47	eqtrid 2784	. . . . . . 7 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → 𝐴 = ∅)
49	48	fveq2d 6846	. . . . . 6 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (Base‘𝐴) = (Base‘∅))
50		base0 17153	. . . . . 6 ⊢ ∅ = (Base‘∅)
51	49, 6, 50	3eqtr4g 2797	. . . . 5 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → 𝐵 = ∅)
52	51	mpteq1d 5190	. . . 4 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑚 ∈ 𝐵 ↦ (𝑅 Σg (𝑝 ∈ 𝑃 ↦ (((𝑌 ∘ 𝑆)‘𝑝) · (𝑈 Σg (𝑥 ∈ 𝑁 ↦ ((𝑝‘𝑥)𝑚𝑥))))))) = (𝑚 ∈ ∅ ↦ (𝑅 Σg (𝑝 ∈ 𝑃 ↦ (((𝑌 ∘ 𝑆)‘𝑝) · (𝑈 Σg (𝑥 ∈ 𝑁 ↦ ((𝑝‘𝑥)𝑚𝑥))))))))
53	44, 52	eqtr4d 2775	. . 3 ⊢ (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 maDet 𝑅) = (𝑚 ∈ 𝐵 ↦ (𝑅 Σg (𝑝 ∈ 𝑃 ↦ (((𝑌 ∘ 𝑆)‘𝑝) · (𝑈 Σg (𝑥 ∈ 𝑁 ↦ ((𝑝‘𝑥)𝑚𝑥))))))))
54	40, 53	pm2.61i 182	. 2 ⊢ (𝑁 maDet 𝑅) = (𝑚 ∈ 𝐵 ↦ (𝑅 Σg (𝑝 ∈ 𝑃 ↦ (((𝑌 ∘ 𝑆)‘𝑝) · (𝑈 Σg (𝑥 ∈ 𝑁 ↦ ((𝑝‘𝑥)𝑚𝑥)))))))
55	1, 54	eqtri 2760	1 ⊢ 𝐷 = (𝑚 ∈ 𝐵 ↦ (𝑅 Σg (𝑝 ∈ 𝑃 ↦ (((𝑌 ∘ 𝑆)‘𝑝) · (𝑈 Σg (𝑥 ∈ 𝑁 ↦ ((𝑝‘𝑥)𝑚𝑥)))))))

Syntax hints:  ¬ wn 3   ∧ wa 395   = wceq 1542   ∈ wcel 2114  Vcvv 3442  ∅c0 4287  ⟨cop 4588  ⟨cotp 4590   ↦ cmpt 5181   × cxp 5630   ∘ ccom 5636  ‘cfv 6500  (class class class)co 7368  Fincfn 8895   sSet csts 17102  ndxcnx 17132  Basecbs 17148  ._rcmulr 17190   Σ_g cgsu 17372  SymGrpcsymg 19310  pmSgncpsgn 19430  mulGrpcmgp 20087  ℤRHomczrh 21466   freeLMod cfrlm 21713   maMul cmmul 22346   Mat cmat 22363   maDet cmdat 22540

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 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690  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 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-ov 7371  df-oprab 7372  df-mpo 7373  df-om 7819  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-nn 12158  df-slot 17121  df-ndx 17133  df-base 17149  df-mat 22364  df-mdet 22541

This theorem is referenced by:  mdetleib  22543  nfimdetndef  22545  mdetfval1  22546  mdet0pr  22548  mdetf  22551