Theorem pmatcollpw3fi1lem2 21936

Description: Lemma 2 for pmatcollpw3fi1 21937. (Contributed by AV, 6-Nov-2019.) (Revised by AV, 4-Dec-2019.)

Hypotheses

Ref	Expression
pmatcollpw.p	⊢ 𝑃 = (Poly1‘𝑅)
pmatcollpw.c	⊢ 𝐶 = (𝑁 Mat 𝑃)
pmatcollpw.b	⊢ 𝐵 = (Base‘𝐶)
pmatcollpw.m	⊢ ∗ = ( ·𝑠 ‘𝐶)
pmatcollpw.e	⊢ ↑ = (.g‘(mulGrp‘𝑃))
pmatcollpw.x	⊢ 𝑋 = (var1‘𝑅)
pmatcollpw.t	⊢ 𝑇 = (𝑁 matToPolyMat 𝑅)
pmatcollpw3.a	⊢ 𝐴 = (𝑁 Mat 𝑅)
pmatcollpw3.d	⊢ 𝐷 = (Base‘𝐴)

Assertion

Ref	Expression
pmatcollpw3fi1lem2	⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → (∃𝑓 ∈ (𝐷 ↑m {0})𝑀 = (𝐶 Σg (𝑛 ∈ {0} ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑓‘𝑛))))) → ∃𝑠 ∈ ℕ ∃𝑓 ∈ (𝐷 ↑m (0...𝑠))𝑀 = (𝐶 Σg (𝑛 ∈ (0...𝑠) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑓‘𝑛)))))))

Distinct variable groups:   𝐵,𝑛   𝑛,𝑀   𝑛,𝑁   𝑃,𝑛   𝑅,𝑛   𝑛,𝑋   ↑ ,𝑛   𝐵,𝑠,𝑛   𝐶,𝑛   𝑀,𝑠   𝑁,𝑠   𝑅,𝑠   𝐵,𝑓   𝐶,𝑓,𝑛   𝐷,𝑓   𝑓,𝑀   𝑓,𝑁   𝑅,𝑓   𝑇,𝑓   𝑓,𝑋   ↑ ,𝑓   ∗ ,𝑓,𝑠   𝐷,𝑛   𝐴,𝑓,𝑛,𝑠   𝐶,𝑠   𝐷,𝑠   𝑇,𝑠   𝑋,𝑠   ↑ ,𝑠   ∗ ,𝑠

Allowed substitution hints:   𝑃(𝑓,𝑠)   𝑇(𝑛)   ∗ (𝑛)

Proof of Theorem pmatcollpw3fi1lem2

Dummy variables 𝑙 𝑔 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq1 6773	. . . . . . . 8 ⊢ (𝑓 = 𝑔 → (𝑓‘𝑛) = (𝑔‘𝑛))
2	1	fveq2d 6778	. . . . . . 7 ⊢ (𝑓 = 𝑔 → (𝑇‘(𝑓‘𝑛)) = (𝑇‘(𝑔‘𝑛)))
3	2	oveq2d 7291	. . . . . 6 ⊢ (𝑓 = 𝑔 → ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑓‘𝑛))) = ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑔‘𝑛))))
4	3	mpteq2dv 5176	. . . . 5 ⊢ (𝑓 = 𝑔 → (𝑛 ∈ {0} ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑓‘𝑛)))) = (𝑛 ∈ {0} ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑔‘𝑛)))))
5	4	oveq2d 7291	. . . 4 ⊢ (𝑓 = 𝑔 → (𝐶 Σg (𝑛 ∈ {0} ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑓‘𝑛))))) = (𝐶 Σg (𝑛 ∈ {0} ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑔‘𝑛))))))
6	5	eqeq2d 2749	. . 3 ⊢ (𝑓 = 𝑔 → (𝑀 = (𝐶 Σg (𝑛 ∈ {0} ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑓‘𝑛))))) ↔ 𝑀 = (𝐶 Σg (𝑛 ∈ {0} ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑔‘𝑛)))))))
7	6	cbvrexvw 3384	. 2 ⊢ (∃𝑓 ∈ (𝐷 ↑m {0})𝑀 = (𝐶 Σg (𝑛 ∈ {0} ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑓‘𝑛))))) ↔ ∃𝑔 ∈ (𝐷 ↑m {0})𝑀 = (𝐶 Σg (𝑛 ∈ {0} ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑔‘𝑛))))))
8		crngring 19795	. . . . . . . 8 ⊢ (𝑅 ∈ CRing → 𝑅 ∈ Ring)
9	8	anim2i 617	. . . . . . 7 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing) → (𝑁 ∈ Fin ∧ 𝑅 ∈ Ring))
10	9	3adant3 1131	. . . . . 6 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → (𝑁 ∈ Fin ∧ 𝑅 ∈ Ring))
11	10	ad2antrr 723	. . . . 5 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝑔 ∈ (𝐷 ↑m {0})) ∧ 𝑀 = (𝐶 Σg (𝑛 ∈ {0} ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑔‘𝑛)))))) → (𝑁 ∈ Fin ∧ 𝑅 ∈ Ring))
12		simplr 766	. . . . 5 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝑔 ∈ (𝐷 ↑m {0})) ∧ 𝑀 = (𝐶 Σg (𝑛 ∈ {0} ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑔‘𝑛)))))) → 𝑔 ∈ (𝐷 ↑m {0}))
13		simpr 485	. . . . 5 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝑔 ∈ (𝐷 ↑m {0})) ∧ 𝑀 = (𝐶 Σg (𝑛 ∈ {0} ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑔‘𝑛)))))) → 𝑀 = (𝐶 Σg (𝑛 ∈ {0} ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑔‘𝑛))))))
14		pmatcollpw.p	. . . . . 6 ⊢ 𝑃 = (Poly1‘𝑅)
15		pmatcollpw.c	. . . . . 6 ⊢ 𝐶 = (𝑁 Mat 𝑃)
16		pmatcollpw.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐶)
17		pmatcollpw.m	. . . . . 6 ⊢ ∗ = ( ·𝑠 ‘𝐶)
18		pmatcollpw.e	. . . . . 6 ⊢ ↑ = (.g‘(mulGrp‘𝑃))
19		pmatcollpw.x	. . . . . 6 ⊢ 𝑋 = (var1‘𝑅)
20		pmatcollpw.t	. . . . . 6 ⊢ 𝑇 = (𝑁 matToPolyMat 𝑅)
21		pmatcollpw3.a	. . . . . 6 ⊢ 𝐴 = (𝑁 Mat 𝑅)
22		pmatcollpw3.d	. . . . . 6 ⊢ 𝐷 = (Base‘𝐴)
23		eqid 2738	. . . . . 6 ⊢ (0g‘𝐴) = (0g‘𝐴)
24		eqid 2738	. . . . . 6 ⊢ (𝑙 ∈ (0...1) ↦ if(𝑙 = 0, (𝑔‘0), (0g‘𝐴))) = (𝑙 ∈ (0...1) ↦ if(𝑙 = 0, (𝑔‘0), (0g‘𝐴)))
25	14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24	pmatcollpw3fi1lem1 21935	. . . . 5 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑔 ∈ (𝐷 ↑m {0}) ∧ 𝑀 = (𝐶 Σg (𝑛 ∈ {0} ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑔‘𝑛)))))) → 𝑀 = (𝐶 Σg (𝑛 ∈ (0...1) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘((𝑙 ∈ (0...1) ↦ if(𝑙 = 0, (𝑔‘0), (0g‘𝐴)))‘𝑛))))))
26	11, 12, 13, 25	syl3anc 1370	. . . 4 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝑔 ∈ (𝐷 ↑m {0})) ∧ 𝑀 = (𝐶 Σg (𝑛 ∈ {0} ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑔‘𝑛)))))) → 𝑀 = (𝐶 Σg (𝑛 ∈ (0...1) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘((𝑙 ∈ (0...1) ↦ if(𝑙 = 0, (𝑔‘0), (0g‘𝐴)))‘𝑛))))))
27		1nn 11984	. . . . . 6 ⊢ 1 ∈ ℕ
28	27	a1i 11	. . . . 5 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝑔 ∈ (𝐷 ↑m {0})) ∧ 𝑀 = (𝐶 Σg (𝑛 ∈ {0} ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑔‘𝑛)))))) ∧ 𝑀 = (𝐶 Σg (𝑛 ∈ (0...1) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘((𝑙 ∈ (0...1) ↦ if(𝑙 = 0, (𝑔‘0), (0g‘𝐴)))‘𝑛)))))) → 1 ∈ ℕ)
29		oveq2 7283	. . . . . . . 8 ⊢ (𝑠 = 1 → (0...𝑠) = (0...1))
30	29	oveq2d 7291	. . . . . . 7 ⊢ (𝑠 = 1 → (𝐷 ↑m (0...𝑠)) = (𝐷 ↑m (0...1)))
31	29	mpteq1d 5169	. . . . . . . . 9 ⊢ (𝑠 = 1 → (𝑛 ∈ (0...𝑠) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑓‘𝑛)))) = (𝑛 ∈ (0...1) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑓‘𝑛)))))
32	31	oveq2d 7291	. . . . . . . 8 ⊢ (𝑠 = 1 → (𝐶 Σg (𝑛 ∈ (0...𝑠) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑓‘𝑛))))) = (𝐶 Σg (𝑛 ∈ (0...1) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑓‘𝑛))))))
33	32	eqeq2d 2749	. . . . . . 7 ⊢ (𝑠 = 1 → (𝑀 = (𝐶 Σg (𝑛 ∈ (0...𝑠) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑓‘𝑛))))) ↔ 𝑀 = (𝐶 Σg (𝑛 ∈ (0...1) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑓‘𝑛)))))))
34	30, 33	rexeqbidv 3337	. . . . . 6 ⊢ (𝑠 = 1 → (∃𝑓 ∈ (𝐷 ↑m (0...𝑠))𝑀 = (𝐶 Σg (𝑛 ∈ (0...𝑠) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑓‘𝑛))))) ↔ ∃𝑓 ∈ (𝐷 ↑m (0...1))𝑀 = (𝐶 Σg (𝑛 ∈ (0...1) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑓‘𝑛)))))))
35	34	adantl 482	. . . . 5 ⊢ ((((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝑔 ∈ (𝐷 ↑m {0})) ∧ 𝑀 = (𝐶 Σg (𝑛 ∈ {0} ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑔‘𝑛)))))) ∧ 𝑀 = (𝐶 Σg (𝑛 ∈ (0...1) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘((𝑙 ∈ (0...1) ↦ if(𝑙 = 0, (𝑔‘0), (0g‘𝐴)))‘𝑛)))))) ∧ 𝑠 = 1) → (∃𝑓 ∈ (𝐷 ↑m (0...𝑠))𝑀 = (𝐶 Σg (𝑛 ∈ (0...𝑠) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑓‘𝑛))))) ↔ ∃𝑓 ∈ (𝐷 ↑m (0...1))𝑀 = (𝐶 Σg (𝑛 ∈ (0...1) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑓‘𝑛)))))))
36		elmapi 8637	. . . . . . . . . . . . . 14 ⊢ (𝑔 ∈ (𝐷 ↑m {0}) → 𝑔:{0}⟶𝐷)
37		c0ex 10969	. . . . . . . . . . . . . . . . . 18 ⊢ 0 ∈ V
38	37	snid 4597	. . . . . . . . . . . . . . . . 17 ⊢ 0 ∈ {0}
39	38	a1i 11	. . . . . . . . . . . . . . . 16 ⊢ (𝑙 ∈ (0...1) → 0 ∈ {0})
40		ffvelrn 6959	. . . . . . . . . . . . . . . 16 ⊢ ((𝑔:{0}⟶𝐷 ∧ 0 ∈ {0}) → (𝑔‘0) ∈ 𝐷)
41	39, 40	sylan2 593	. . . . . . . . . . . . . . 15 ⊢ ((𝑔:{0}⟶𝐷 ∧ 𝑙 ∈ (0...1)) → (𝑔‘0) ∈ 𝐷)
42	41	ex 413	. . . . . . . . . . . . . 14 ⊢ (𝑔:{0}⟶𝐷 → (𝑙 ∈ (0...1) → (𝑔‘0) ∈ 𝐷))
43	36, 42	syl 17	. . . . . . . . . . . . 13 ⊢ (𝑔 ∈ (𝐷 ↑m {0}) → (𝑙 ∈ (0...1) → (𝑔‘0) ∈ 𝐷))
44	43	adantl 482	. . . . . . . . . . . 12 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝑔 ∈ (𝐷 ↑m {0})) → (𝑙 ∈ (0...1) → (𝑔‘0) ∈ 𝐷))
45	44	imp 407	. . . . . . . . . . 11 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝑔 ∈ (𝐷 ↑m {0})) ∧ 𝑙 ∈ (0...1)) → (𝑔‘0) ∈ 𝐷)
46	21	matring 21592	. . . . . . . . . . . . . . 15 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝐴 ∈ Ring)
47	8, 46	sylan2 593	. . . . . . . . . . . . . 14 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing) → 𝐴 ∈ Ring)
48	47	3adant3 1131	. . . . . . . . . . . . 13 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → 𝐴 ∈ Ring)
49	22, 23	ring0cl 19808	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ Ring → (0g‘𝐴) ∈ 𝐷)
50	48, 49	syl 17	. . . . . . . . . . . 12 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → (0g‘𝐴) ∈ 𝐷)
51	50	ad2antrr 723	. . . . . . . . . . 11 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝑔 ∈ (𝐷 ↑m {0})) ∧ 𝑙 ∈ (0...1)) → (0g‘𝐴) ∈ 𝐷)
52	45, 51	ifcld 4505	. . . . . . . . . 10 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝑔 ∈ (𝐷 ↑m {0})) ∧ 𝑙 ∈ (0...1)) → if(𝑙 = 0, (𝑔‘0), (0g‘𝐴)) ∈ 𝐷)
53	52	fmpttd 6989	. . . . . . . . 9 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝑔 ∈ (𝐷 ↑m {0})) → (𝑙 ∈ (0...1) ↦ if(𝑙 = 0, (𝑔‘0), (0g‘𝐴))):(0...1)⟶𝐷)
54	22	fvexi 6788	. . . . . . . . . . 11 ⊢ 𝐷 ∈ V
55		ovex 7308	. . . . . . . . . . 11 ⊢ (0...1) ∈ V
56	54, 55	pm3.2i 471	. . . . . . . . . 10 ⊢ (𝐷 ∈ V ∧ (0...1) ∈ V)
57		elmapg 8628	. . . . . . . . . 10 ⊢ ((𝐷 ∈ V ∧ (0...1) ∈ V) → ((𝑙 ∈ (0...1) ↦ if(𝑙 = 0, (𝑔‘0), (0g‘𝐴))) ∈ (𝐷 ↑m (0...1)) ↔ (𝑙 ∈ (0...1) ↦ if(𝑙 = 0, (𝑔‘0), (0g‘𝐴))):(0...1)⟶𝐷))
58	56, 57	mp1i 13	. . . . . . . . 9 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝑔 ∈ (𝐷 ↑m {0})) → ((𝑙 ∈ (0...1) ↦ if(𝑙 = 0, (𝑔‘0), (0g‘𝐴))) ∈ (𝐷 ↑m (0...1)) ↔ (𝑙 ∈ (0...1) ↦ if(𝑙 = 0, (𝑔‘0), (0g‘𝐴))):(0...1)⟶𝐷))
59	53, 58	mpbird 256	. . . . . . . 8 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝑔 ∈ (𝐷 ↑m {0})) → (𝑙 ∈ (0...1) ↦ if(𝑙 = 0, (𝑔‘0), (0g‘𝐴))) ∈ (𝐷 ↑m (0...1)))
60	59	adantr 481	. . . . . . 7 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝑔 ∈ (𝐷 ↑m {0})) ∧ 𝑀 = (𝐶 Σg (𝑛 ∈ {0} ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑔‘𝑛)))))) → (𝑙 ∈ (0...1) ↦ if(𝑙 = 0, (𝑔‘0), (0g‘𝐴))) ∈ (𝐷 ↑m (0...1)))
61		fveq1 6773	. . . . . . . . . . . . 13 ⊢ (𝑓 = (𝑙 ∈ (0...1) ↦ if(𝑙 = 0, (𝑔‘0), (0g‘𝐴))) → (𝑓‘𝑛) = ((𝑙 ∈ (0...1) ↦ if(𝑙 = 0, (𝑔‘0), (0g‘𝐴)))‘𝑛))
62	61	fveq2d 6778	. . . . . . . . . . . 12 ⊢ (𝑓 = (𝑙 ∈ (0...1) ↦ if(𝑙 = 0, (𝑔‘0), (0g‘𝐴))) → (𝑇‘(𝑓‘𝑛)) = (𝑇‘((𝑙 ∈ (0...1) ↦ if(𝑙 = 0, (𝑔‘0), (0g‘𝐴)))‘𝑛)))
63	62	oveq2d 7291	. . . . . . . . . . 11 ⊢ (𝑓 = (𝑙 ∈ (0...1) ↦ if(𝑙 = 0, (𝑔‘0), (0g‘𝐴))) → ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑓‘𝑛))) = ((𝑛 ↑ 𝑋) ∗ (𝑇‘((𝑙 ∈ (0...1) ↦ if(𝑙 = 0, (𝑔‘0), (0g‘𝐴)))‘𝑛))))
64	63	mpteq2dv 5176	. . . . . . . . . 10 ⊢ (𝑓 = (𝑙 ∈ (0...1) ↦ if(𝑙 = 0, (𝑔‘0), (0g‘𝐴))) → (𝑛 ∈ (0...1) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑓‘𝑛)))) = (𝑛 ∈ (0...1) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘((𝑙 ∈ (0...1) ↦ if(𝑙 = 0, (𝑔‘0), (0g‘𝐴)))‘𝑛)))))
65	64	oveq2d 7291	. . . . . . . . 9 ⊢ (𝑓 = (𝑙 ∈ (0...1) ↦ if(𝑙 = 0, (𝑔‘0), (0g‘𝐴))) → (𝐶 Σg (𝑛 ∈ (0...1) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑓‘𝑛))))) = (𝐶 Σg (𝑛 ∈ (0...1) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘((𝑙 ∈ (0...1) ↦ if(𝑙 = 0, (𝑔‘0), (0g‘𝐴)))‘𝑛))))))
66	65	eqeq2d 2749	. . . . . . . 8 ⊢ (𝑓 = (𝑙 ∈ (0...1) ↦ if(𝑙 = 0, (𝑔‘0), (0g‘𝐴))) → (𝑀 = (𝐶 Σg (𝑛 ∈ (0...1) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑓‘𝑛))))) ↔ 𝑀 = (𝐶 Σg (𝑛 ∈ (0...1) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘((𝑙 ∈ (0...1) ↦ if(𝑙 = 0, (𝑔‘0), (0g‘𝐴)))‘𝑛)))))))
67	66	adantl 482	. . . . . . 7 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝑔 ∈ (𝐷 ↑m {0})) ∧ 𝑀 = (𝐶 Σg (𝑛 ∈ {0} ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑔‘𝑛)))))) ∧ 𝑓 = (𝑙 ∈ (0...1) ↦ if(𝑙 = 0, (𝑔‘0), (0g‘𝐴)))) → (𝑀 = (𝐶 Σg (𝑛 ∈ (0...1) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑓‘𝑛))))) ↔ 𝑀 = (𝐶 Σg (𝑛 ∈ (0...1) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘((𝑙 ∈ (0...1) ↦ if(𝑙 = 0, (𝑔‘0), (0g‘𝐴)))‘𝑛)))))))
68	60, 67	rspcedv 3554	. . . . . 6 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝑔 ∈ (𝐷 ↑m {0})) ∧ 𝑀 = (𝐶 Σg (𝑛 ∈ {0} ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑔‘𝑛)))))) → (𝑀 = (𝐶 Σg (𝑛 ∈ (0...1) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘((𝑙 ∈ (0...1) ↦ if(𝑙 = 0, (𝑔‘0), (0g‘𝐴)))‘𝑛))))) → ∃𝑓 ∈ (𝐷 ↑m (0...1))𝑀 = (𝐶 Σg (𝑛 ∈ (0...1) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑓‘𝑛)))))))
69	68	imp 407	. . . . 5 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝑔 ∈ (𝐷 ↑m {0})) ∧ 𝑀 = (𝐶 Σg (𝑛 ∈ {0} ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑔‘𝑛)))))) ∧ 𝑀 = (𝐶 Σg (𝑛 ∈ (0...1) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘((𝑙 ∈ (0...1) ↦ if(𝑙 = 0, (𝑔‘0), (0g‘𝐴)))‘𝑛)))))) → ∃𝑓 ∈ (𝐷 ↑m (0...1))𝑀 = (𝐶 Σg (𝑛 ∈ (0...1) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑓‘𝑛))))))
70	28, 35, 69	rspcedvd 3563	. . . 4 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝑔 ∈ (𝐷 ↑m {0})) ∧ 𝑀 = (𝐶 Σg (𝑛 ∈ {0} ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑔‘𝑛)))))) ∧ 𝑀 = (𝐶 Σg (𝑛 ∈ (0...1) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘((𝑙 ∈ (0...1) ↦ if(𝑙 = 0, (𝑔‘0), (0g‘𝐴)))‘𝑛)))))) → ∃𝑠 ∈ ℕ ∃𝑓 ∈ (𝐷 ↑m (0...𝑠))𝑀 = (𝐶 Σg (𝑛 ∈ (0...𝑠) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑓‘𝑛))))))
71	26, 70	mpdan 684	. . 3 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝑔 ∈ (𝐷 ↑m {0})) ∧ 𝑀 = (𝐶 Σg (𝑛 ∈ {0} ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑔‘𝑛)))))) → ∃𝑠 ∈ ℕ ∃𝑓 ∈ (𝐷 ↑m (0...𝑠))𝑀 = (𝐶 Σg (𝑛 ∈ (0...𝑠) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑓‘𝑛))))))
72	71	rexlimdva2 3216	. 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → (∃𝑔 ∈ (𝐷 ↑m {0})𝑀 = (𝐶 Σg (𝑛 ∈ {0} ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑔‘𝑛))))) → ∃𝑠 ∈ ℕ ∃𝑓 ∈ (𝐷 ↑m (0...𝑠))𝑀 = (𝐶 Σg (𝑛 ∈ (0...𝑠) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑓‘𝑛)))))))
73	7, 72	syl5bi 241	1 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) → (∃𝑓 ∈ (𝐷 ↑m {0})𝑀 = (𝐶 Σg (𝑛 ∈ {0} ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑓‘𝑛))))) → ∃𝑠 ∈ ℕ ∃𝑓 ∈ (𝐷 ↑m (0...𝑠))𝑀 = (𝐶 Σg (𝑛 ∈ (0...𝑠) ↦ ((𝑛 ↑ 𝑋) ∗ (𝑇‘(𝑓‘𝑛)))))))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∧ w3a 1086   = wceq 1539   ∈ wcel 2106  ∃wrex 3065  Vcvv 3432  ifcif 4459  {csn 4561   ↦ cmpt 5157  ⟶wf 6429  ‘cfv 6433  (class class class)co 7275   ↑_m cmap 8615  Fincfn 8733  0cc0 10871  1c1 10872  ℕcn 11973  ...cfz 13239  Basecbs 16912   ·_𝑠 cvsca 16966  0_gc0g 17150   Σ_g cgsu 17151  ._gcmg 18700  mulGrpcmgp 19720  Ringcrg 19783  CRingccrg 19784  var₁cv1 21347  Poly₁cpl1 21348   Mat cmat 21554   matToPolyMat cmat2pmat 21853

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588  ax-cnex 10927  ax-resscn 10928  ax-1cn 10929  ax-icn 10930  ax-addcl 10931  ax-addrcl 10932  ax-mulcl 10933  ax-mulrcl 10934  ax-mulcom 10935  ax-addass 10936  ax-mulass 10937  ax-distr 10938  ax-i2m1 10939  ax-1ne0 10940  ax-1rid 10941  ax-rnegex 10942  ax-rrecex 10943  ax-cnre 10944  ax-pre-lttri 10945  ax-pre-lttrn 10946  ax-pre-ltadd 10947  ax-pre-mulgt0 10948

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3069  df-rex 3070  df-rmo 3071  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-tp 4566  df-op 4568  df-ot 4570  df-uni 4840  df-int 4880  df-iun 4926  df-iin 4927  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-se 5545  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6202  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-isom 6442  df-riota 7232  df-ov 7278  df-oprab 7279  df-mpo 7280  df-of 7533  df-ofr 7534  df-om 7713  df-1st 7831  df-2nd 7832  df-supp 7978  df-frecs 8097  df-wrecs 8128  df-recs 8202  df-rdg 8241  df-1o 8297  df-er 8498  df-map 8617  df-pm 8618  df-ixp 8686  df-en 8734  df-dom 8735  df-sdom 8736  df-fin 8737  df-fsupp 9129  df-sup 9201  df-oi 9269  df-card 9697  df-pnf 11011  df-mnf 11012  df-xr 11013  df-ltxr 11014  df-le 11015  df-sub 11207  df-neg 11208  df-nn 11974  df-2 12036  df-3 12037  df-4 12038  df-5 12039  df-6 12040  df-7 12041  df-8 12042  df-9 12043  df-n0 12234  df-z 12320  df-dec 12438  df-uz 12583  df-fz 13240  df-fzo 13383  df-seq 13722  df-hash 14045  df-struct 16848  df-sets 16865  df-slot 16883  df-ndx 16895  df-base 16913  df-ress 16942  df-plusg 16975  df-mulr 16976  df-sca 16978  df-vsca 16979  df-ip 16980  df-tset 16981  df-ple 16982  df-ds 16984  df-hom 16986  df-cco 16987  df-0g 17152  df-gsum 17153  df-prds 17158  df-pws 17160  df-mre 17295  df-mrc 17296  df-acs 17298  df-mgm 18326  df-sgrp 18375  df-mnd 18386  df-mhm 18430  df-submnd 18431  df-grp 18580  df-minusg 18581  df-sbg 18582  df-mulg 18701  df-subg 18752  df-ghm 18832  df-cntz 18923  df-cmn 19388  df-abl 19389  df-mgp 19721  df-ur 19738  df-ring 19785  df-cring 19786  df-subrg 20022  df-lmod 20125  df-lss 20194  df-sra 20434  df-rgmod 20435  df-dsmm 20939  df-frlm 20954  df-ascl 21062  df-psr 21112  df-mvr 21113  df-mpl 21114  df-opsr 21116  df-psr1 21351  df-vr1 21352  df-ply1 21353  df-mamu 21533  df-mat 21555  df-mat2pmat 21856

This theorem is referenced by:  pmatcollpw3fi1  21937