Theorem pmatcoe1fsupp 21758

Description: For a polynomial matrix there is an upper bound for the coefficients of all the polynomials being not 0. (Contributed by AV, 3-Oct-2019.) (Proof shortened by AV, 28-Nov-2019.)

Hypotheses

Ref	Expression
pmatcoe1fsupp.p	⊢ 𝑃 = (Poly1‘𝑅)
pmatcoe1fsupp.c	⊢ 𝐶 = (𝑁 Mat 𝑃)
pmatcoe1fsupp.b	⊢ 𝐵 = (Base‘𝐶)
pmatcoe1fsupp.0	⊢ 0 = (0g‘𝑅)

Assertion

Ref	Expression
pmatcoe1fsupp	⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) → ∃𝑠 ∈ ℕ0 ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ((coe1‘(𝑖𝑀𝑗))‘𝑥) = 0 ))

Distinct variable groups:   𝐵,𝑖,𝑗,𝑠,𝑥   𝑖,𝑀,𝑗,𝑠,𝑥   𝑖,𝑁,𝑗,𝑠,𝑥   𝑅,𝑖,𝑗,𝑠,𝑥   0 ,𝑖,𝑗,𝑠,𝑥

Allowed substitution hints:   𝐶(𝑥,𝑖,𝑗,𝑠)   𝑃(𝑥,𝑖,𝑗,𝑠)

Proof of Theorem pmatcoe1fsupp

Dummy variables 𝑣 𝑢 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssrab2 4009	. . . . . 6 ⊢ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 } ⊆ ((Base‘𝑅) ↑m ℕ0)
2	1	a1i 11	. . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) → {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 } ⊆ ((Base‘𝑅) ↑m ℕ0))
3	2	olcd 870	. . . 4 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) → (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ⊆ ((Base‘𝑅) ↑m ℕ0) ∨ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 } ⊆ ((Base‘𝑅) ↑m ℕ0)))
4		inss 4169	. . . 4 ⊢ ((∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ⊆ ((Base‘𝑅) ↑m ℕ0) ∨ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 } ⊆ ((Base‘𝑅) ↑m ℕ0)) → (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 }) ⊆ ((Base‘𝑅) ↑m ℕ0))
5	3, 4	syl 17	. . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) → (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 }) ⊆ ((Base‘𝑅) ↑m ℕ0))
6		xpfi 9015	. . . . . . 7 ⊢ ((𝑁 ∈ Fin ∧ 𝑁 ∈ Fin) → (𝑁 × 𝑁) ∈ Fin)
7	6	anidms 566	. . . . . 6 ⊢ (𝑁 ∈ Fin → (𝑁 × 𝑁) ∈ Fin)
8		snfi 8788	. . . . . . . 8 ⊢ {(coe1‘(𝑀‘𝑢))} ∈ Fin
9	8	a1i 11	. . . . . . 7 ⊢ ((𝑁 ∈ Fin ∧ 𝑢 ∈ (𝑁 × 𝑁)) → {(coe1‘(𝑀‘𝑢))} ∈ Fin)
10	9	ralrimiva 3107	. . . . . 6 ⊢ (𝑁 ∈ Fin → ∀𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∈ Fin)
11	7, 10	jca 511	. . . . 5 ⊢ (𝑁 ∈ Fin → ((𝑁 × 𝑁) ∈ Fin ∧ ∀𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∈ Fin))
12	11	3ad2ant1 1131	. . . 4 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) → ((𝑁 × 𝑁) ∈ Fin ∧ ∀𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∈ Fin))
13		iunfi 9037	. . . 4 ⊢ (((𝑁 × 𝑁) ∈ Fin ∧ ∀𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∈ Fin) → ∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∈ Fin)
14		infi 8972	. . . 4 ⊢ (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∈ Fin → (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 }) ∈ Fin)
15	12, 13, 14	3syl 18	. . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) → (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 }) ∈ Fin)
16		pmatcoe1fsupp.0	. . . . 5 ⊢ 0 = (0g‘𝑅)
17		fvex 6769	. . . . 5 ⊢ (0g‘𝑅) ∈ V
18	16, 17	eqeltri 2835	. . . 4 ⊢ 0 ∈ V
19	18	a1i 11	. . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) → 0 ∈ V)
20		elin 3899	. . . . . 6 ⊢ (𝑤 ∈ (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 }) ↔ (𝑤 ∈ ∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∧ 𝑤 ∈ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 }))
21		breq1 5073	. . . . . . . 8 ⊢ (𝑣 = 𝑤 → (𝑣 finSupp 0 ↔ 𝑤 finSupp 0 ))
22	21	elrab 3617	. . . . . . 7 ⊢ (𝑤 ∈ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 } ↔ (𝑤 ∈ ((Base‘𝑅) ↑m ℕ0) ∧ 𝑤 finSupp 0 ))
23	22	simprbi 496	. . . . . 6 ⊢ (𝑤 ∈ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 } → 𝑤 finSupp 0 )
24	20, 23	simplbiim 504	. . . . 5 ⊢ (𝑤 ∈ (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 }) → 𝑤 finSupp 0 )
25	24	rgen 3073	. . . 4 ⊢ ∀𝑤 ∈ (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 })𝑤 finSupp 0
26	25	a1i 11	. . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) → ∀𝑤 ∈ (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 })𝑤 finSupp 0 )
27		fsuppmapnn0fiub0 13641	. . . 4 ⊢ (((∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 }) ⊆ ((Base‘𝑅) ↑m ℕ0) ∧ (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 }) ∈ Fin ∧ 0 ∈ V) → (∀𝑤 ∈ (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 })𝑤 finSupp 0 → ∃𝑠 ∈ ℕ0 ∀𝑤 ∈ (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 })∀𝑧 ∈ ℕ0 (𝑠 < 𝑧 → (𝑤‘𝑧) = 0 )))
28	27	imp 406	. . 3 ⊢ ((((∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 }) ⊆ ((Base‘𝑅) ↑m ℕ0) ∧ (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 }) ∈ Fin ∧ 0 ∈ V) ∧ ∀𝑤 ∈ (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 })𝑤 finSupp 0 ) → ∃𝑠 ∈ ℕ0 ∀𝑤 ∈ (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 })∀𝑧 ∈ ℕ0 (𝑠 < 𝑧 → (𝑤‘𝑧) = 0 ))
29	5, 15, 19, 26, 28	syl31anc 1371	. 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) → ∃𝑠 ∈ ℕ0 ∀𝑤 ∈ (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 })∀𝑧 ∈ ℕ0 (𝑠 < 𝑧 → (𝑤‘𝑧) = 0 ))
30		opelxpi 5617	. . . . . . . . . . . . . . 15 ⊢ ((𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → ⟨𝑖, 𝑗⟩ ∈ (𝑁 × 𝑁))
31		df-ov 7258	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑖𝑀𝑗) = (𝑀‘⟨𝑖, 𝑗⟩)
32	31	fveq2i 6759	. . . . . . . . . . . . . . . . 17 ⊢ (coe1‘(𝑖𝑀𝑗)) = (coe1‘(𝑀‘⟨𝑖, 𝑗⟩))
33		fvex 6769	. . . . . . . . . . . . . . . . . 18 ⊢ (coe1‘(𝑀‘⟨𝑖, 𝑗⟩)) ∈ V
34	33	snid 4594	. . . . . . . . . . . . . . . . 17 ⊢ (coe1‘(𝑀‘⟨𝑖, 𝑗⟩)) ∈ {(coe1‘(𝑀‘⟨𝑖, 𝑗⟩))}
35	32, 34	eqeltri 2835	. . . . . . . . . . . . . . . 16 ⊢ (coe1‘(𝑖𝑀𝑗)) ∈ {(coe1‘(𝑀‘⟨𝑖, 𝑗⟩))}
36	35	a1i 11	. . . . . . . . . . . . . . 15 ⊢ ((𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → (coe1‘(𝑖𝑀𝑗)) ∈ {(coe1‘(𝑀‘⟨𝑖, 𝑗⟩))})
37		2fveq3 6761	. . . . . . . . . . . . . . . . 17 ⊢ (𝑢 = ⟨𝑖, 𝑗⟩ → (coe1‘(𝑀‘𝑢)) = (coe1‘(𝑀‘⟨𝑖, 𝑗⟩)))
38	37	sneqd 4570	. . . . . . . . . . . . . . . 16 ⊢ (𝑢 = ⟨𝑖, 𝑗⟩ → {(coe1‘(𝑀‘𝑢))} = {(coe1‘(𝑀‘⟨𝑖, 𝑗⟩))})
39	38	eliuni 4927	. . . . . . . . . . . . . . 15 ⊢ ((⟨𝑖, 𝑗⟩ ∈ (𝑁 × 𝑁) ∧ (coe1‘(𝑖𝑀𝑗)) ∈ {(coe1‘(𝑀‘⟨𝑖, 𝑗⟩))}) → (coe1‘(𝑖𝑀𝑗)) ∈ ∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))})
40	30, 36, 39	syl2anc 583	. . . . . . . . . . . . . 14 ⊢ ((𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → (coe1‘(𝑖𝑀𝑗)) ∈ ∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))})
41	40	adantl 481	. . . . . . . . . . . . 13 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ0) ∧ 𝑥 ∈ ℕ0) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (coe1‘(𝑖𝑀𝑗)) ∈ ∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))})
42		pmatcoe1fsupp.c	. . . . . . . . . . . . . . . 16 ⊢ 𝐶 = (𝑁 Mat 𝑃)
43		eqid 2738	. . . . . . . . . . . . . . . 16 ⊢ (Base‘𝑃) = (Base‘𝑃)
44		pmatcoe1fsupp.b	. . . . . . . . . . . . . . . 16 ⊢ 𝐵 = (Base‘𝐶)
45		simprl 767	. . . . . . . . . . . . . . . 16 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ0) ∧ 𝑥 ∈ ℕ0) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → 𝑖 ∈ 𝑁)
46		simprr 769	. . . . . . . . . . . . . . . 16 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ0) ∧ 𝑥 ∈ ℕ0) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → 𝑗 ∈ 𝑁)
47	44	eleq2i 2830	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑀 ∈ 𝐵 ↔ 𝑀 ∈ (Base‘𝐶))
48	47	biimpi 215	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑀 ∈ 𝐵 → 𝑀 ∈ (Base‘𝐶))
49	48	3ad2ant3 1133	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) → 𝑀 ∈ (Base‘𝐶))
50	49	ad3antrrr 726	. . . . . . . . . . . . . . . . 17 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ0) ∧ 𝑥 ∈ ℕ0) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → 𝑀 ∈ (Base‘𝐶))
51	50, 44	eleqtrrdi 2850	. . . . . . . . . . . . . . . 16 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ0) ∧ 𝑥 ∈ ℕ0) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → 𝑀 ∈ 𝐵)
52	42, 43, 44, 45, 46, 51	matecld 21483	. . . . . . . . . . . . . . 15 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ0) ∧ 𝑥 ∈ ℕ0) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (𝑖𝑀𝑗) ∈ (Base‘𝑃))
53		eqid 2738	. . . . . . . . . . . . . . . 16 ⊢ (coe1‘(𝑖𝑀𝑗)) = (coe1‘(𝑖𝑀𝑗))
54		pmatcoe1fsupp.p	. . . . . . . . . . . . . . . 16 ⊢ 𝑃 = (Poly1‘𝑅)
55		eqid 2738	. . . . . . . . . . . . . . . 16 ⊢ (0g‘𝑅) = (0g‘𝑅)
56		eqid 2738	. . . . . . . . . . . . . . . 16 ⊢ (Base‘𝑅) = (Base‘𝑅)
57	53, 43, 54, 55, 56	coe1fsupp 21295	. . . . . . . . . . . . . . 15 ⊢ ((𝑖𝑀𝑗) ∈ (Base‘𝑃) → (coe1‘(𝑖𝑀𝑗)) ∈ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp (0g‘𝑅)})
58	52, 57	syl 17	. . . . . . . . . . . . . 14 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ0) ∧ 𝑥 ∈ ℕ0) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (coe1‘(𝑖𝑀𝑗)) ∈ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp (0g‘𝑅)})
59	16	a1i 11	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) → 0 = (0g‘𝑅))
60	59	breq2d 5082	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) → (𝑣 finSupp 0 ↔ 𝑣 finSupp (0g‘𝑅)))
61	60	rabbidv 3404	. . . . . . . . . . . . . . . 16 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) → {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 } = {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp (0g‘𝑅)})
62	61	eleq2d 2824	. . . . . . . . . . . . . . 15 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) → ((coe1‘(𝑖𝑀𝑗)) ∈ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 } ↔ (coe1‘(𝑖𝑀𝑗)) ∈ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp (0g‘𝑅)}))
63	62	ad3antrrr 726	. . . . . . . . . . . . . 14 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ0) ∧ 𝑥 ∈ ℕ0) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → ((coe1‘(𝑖𝑀𝑗)) ∈ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 } ↔ (coe1‘(𝑖𝑀𝑗)) ∈ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp (0g‘𝑅)}))
64	58, 63	mpbird 256	. . . . . . . . . . . . 13 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ0) ∧ 𝑥 ∈ ℕ0) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (coe1‘(𝑖𝑀𝑗)) ∈ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 })
65	41, 64	elind 4124	. . . . . . . . . . . 12 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ0) ∧ 𝑥 ∈ ℕ0) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (coe1‘(𝑖𝑀𝑗)) ∈ (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 }))
66		simplr 765	. . . . . . . . . . . 12 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ0) ∧ 𝑥 ∈ ℕ0) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → 𝑥 ∈ ℕ0)
67		fveq1 6755	. . . . . . . . . . . . . . 15 ⊢ (𝑤 = (coe1‘(𝑖𝑀𝑗)) → (𝑤‘𝑧) = ((coe1‘(𝑖𝑀𝑗))‘𝑧))
68	67	eqeq1d 2740	. . . . . . . . . . . . . 14 ⊢ (𝑤 = (coe1‘(𝑖𝑀𝑗)) → ((𝑤‘𝑧) = 0 ↔ ((coe1‘(𝑖𝑀𝑗))‘𝑧) = 0 ))
69	68	imbi2d 340	. . . . . . . . . . . . 13 ⊢ (𝑤 = (coe1‘(𝑖𝑀𝑗)) → ((𝑠 < 𝑧 → (𝑤‘𝑧) = 0 ) ↔ (𝑠 < 𝑧 → ((coe1‘(𝑖𝑀𝑗))‘𝑧) = 0 )))
70		breq2 5074	. . . . . . . . . . . . . 14 ⊢ (𝑧 = 𝑥 → (𝑠 < 𝑧 ↔ 𝑠 < 𝑥))
71		fveqeq2 6765	. . . . . . . . . . . . . 14 ⊢ (𝑧 = 𝑥 → (((coe1‘(𝑖𝑀𝑗))‘𝑧) = 0 ↔ ((coe1‘(𝑖𝑀𝑗))‘𝑥) = 0 ))
72	70, 71	imbi12d 344	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑥 → ((𝑠 < 𝑧 → ((coe1‘(𝑖𝑀𝑗))‘𝑧) = 0 ) ↔ (𝑠 < 𝑥 → ((coe1‘(𝑖𝑀𝑗))‘𝑥) = 0 )))
73	69, 72	rspc2v 3562	. . . . . . . . . . . 12 ⊢ (((coe1‘(𝑖𝑀𝑗)) ∈ (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 }) ∧ 𝑥 ∈ ℕ0) → (∀𝑤 ∈ (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 })∀𝑧 ∈ ℕ0 (𝑠 < 𝑧 → (𝑤‘𝑧) = 0 ) → (𝑠 < 𝑥 → ((coe1‘(𝑖𝑀𝑗))‘𝑥) = 0 )))
74	65, 66, 73	syl2anc 583	. . . . . . . . . . 11 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ0) ∧ 𝑥 ∈ ℕ0) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (∀𝑤 ∈ (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 })∀𝑧 ∈ ℕ0 (𝑠 < 𝑧 → (𝑤‘𝑧) = 0 ) → (𝑠 < 𝑥 → ((coe1‘(𝑖𝑀𝑗))‘𝑥) = 0 )))
75	74	ex 412	. . . . . . . . . 10 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ0) ∧ 𝑥 ∈ ℕ0) → ((𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → (∀𝑤 ∈ (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 })∀𝑧 ∈ ℕ0 (𝑠 < 𝑧 → (𝑤‘𝑧) = 0 ) → (𝑠 < 𝑥 → ((coe1‘(𝑖𝑀𝑗))‘𝑥) = 0 ))))
76	75	com23 86	. . . . . . . . 9 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ0) ∧ 𝑥 ∈ ℕ0) → (∀𝑤 ∈ (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 })∀𝑧 ∈ ℕ0 (𝑠 < 𝑧 → (𝑤‘𝑧) = 0 ) → ((𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → (𝑠 < 𝑥 → ((coe1‘(𝑖𝑀𝑗))‘𝑥) = 0 ))))
77	76	impancom 451	. . . . . . . 8 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ0) ∧ ∀𝑤 ∈ (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 })∀𝑧 ∈ ℕ0 (𝑠 < 𝑧 → (𝑤‘𝑧) = 0 )) → (𝑥 ∈ ℕ0 → ((𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → (𝑠 < 𝑥 → ((coe1‘(𝑖𝑀𝑗))‘𝑥) = 0 ))))
78	77	imp 406	. . . . . . 7 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ0) ∧ ∀𝑤 ∈ (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 })∀𝑧 ∈ ℕ0 (𝑠 < 𝑧 → (𝑤‘𝑧) = 0 )) ∧ 𝑥 ∈ ℕ0) → ((𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → (𝑠 < 𝑥 → ((coe1‘(𝑖𝑀𝑗))‘𝑥) = 0 )))
79	78	com23 86	. . . . . 6 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ0) ∧ ∀𝑤 ∈ (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 })∀𝑧 ∈ ℕ0 (𝑠 < 𝑧 → (𝑤‘𝑧) = 0 )) ∧ 𝑥 ∈ ℕ0) → (𝑠 < 𝑥 → ((𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → ((coe1‘(𝑖𝑀𝑗))‘𝑥) = 0 )))
80	79	ralrimdvv 3116	. . . . 5 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ0) ∧ ∀𝑤 ∈ (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 })∀𝑧 ∈ ℕ0 (𝑠 < 𝑧 → (𝑤‘𝑧) = 0 )) ∧ 𝑥 ∈ ℕ0) → (𝑠 < 𝑥 → ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ((coe1‘(𝑖𝑀𝑗))‘𝑥) = 0 ))
81	80	ralrimiva 3107	. . . 4 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ0) ∧ ∀𝑤 ∈ (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 })∀𝑧 ∈ ℕ0 (𝑠 < 𝑧 → (𝑤‘𝑧) = 0 )) → ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ((coe1‘(𝑖𝑀𝑗))‘𝑥) = 0 ))
82	81	ex 412	. . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ0) → (∀𝑤 ∈ (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 })∀𝑧 ∈ ℕ0 (𝑠 < 𝑧 → (𝑤‘𝑧) = 0 ) → ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ((coe1‘(𝑖𝑀𝑗))‘𝑥) = 0 )))
83	82	reximdva 3202	. 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) → (∃𝑠 ∈ ℕ0 ∀𝑤 ∈ (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 })∀𝑧 ∈ ℕ0 (𝑠 < 𝑧 → (𝑤‘𝑧) = 0 ) → ∃𝑠 ∈ ℕ0 ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ((coe1‘(𝑖𝑀𝑗))‘𝑥) = 0 )))
84	29, 83	mpd 15	1 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) → ∃𝑠 ∈ ℕ0 ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ((coe1‘(𝑖𝑀𝑗))‘𝑥) = 0 ))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   ∨ wo 843   ∧ w3a 1085   = wceq 1539   ∈ wcel 2108  ∀wral 3063  ∃wrex 3064  {crab 3067  Vcvv 3422   ∩ cin 3882   ⊆ wss 3883  {csn 4558  ⟨cop 4564  ∪ ciun 4921   class class class wbr 5070   × cxp 5578  ‘cfv 6418  (class class class)co 7255   ↑_m cmap 8573  Fincfn 8691   finSupp cfsupp 9058   < clt 10940  ℕ₀cn0 12163  Basecbs 16840  0_gc0g 17067  Ringcrg 19698  Poly₁cpl1 21258  coe₁cco1 21259   Mat cmat 21464

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566  ax-cnex 10858  ax-resscn 10859  ax-1cn 10860  ax-icn 10861  ax-addcl 10862  ax-addrcl 10863  ax-mulcl 10864  ax-mulrcl 10865  ax-mulcom 10866  ax-addass 10867  ax-mulass 10868  ax-distr 10869  ax-i2m1 10870  ax-1ne0 10871  ax-1rid 10872  ax-rnegex 10873  ax-rrecex 10874  ax-cnre 10875  ax-pre-lttri 10876  ax-pre-lttrn 10877  ax-pre-ltadd 10878  ax-pre-mulgt0 10879

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-nel 3049  df-ral 3068  df-rex 3069  df-reu 3070  df-rmo 3071  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-ot 4567  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-riota 7212  df-ov 7258  df-oprab 7259  df-mpo 7260  df-of 7511  df-om 7688  df-1st 7804  df-2nd 7805  df-supp 7949  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-rdg 8212  df-1o 8267  df-er 8456  df-map 8575  df-ixp 8644  df-en 8692  df-dom 8693  df-sdom 8694  df-fin 8695  df-fsupp 9059  df-sup 9131  df-pnf 10942  df-mnf 10943  df-xr 10944  df-ltxr 10945  df-le 10946  df-sub 11137  df-neg 11138  df-nn 11904  df-2 11966  df-3 11967  df-4 11968  df-5 11969  df-6 11970  df-7 11971  df-8 11972  df-9 11973  df-n0 12164  df-z 12250  df-dec 12367  df-uz 12512  df-fz 13169  df-struct 16776  df-sets 16793  df-slot 16811  df-ndx 16823  df-base 16841  df-ress 16868  df-plusg 16901  df-mulr 16902  df-sca 16904  df-vsca 16905  df-ip 16906  df-tset 16907  df-ple 16908  df-ds 16910  df-hom 16912  df-cco 16913  df-0g 17069  df-prds 17075  df-pws 17077  df-sra 20349  df-rgmod 20350  df-dsmm 20849  df-frlm 20864  df-psr 21022  df-mpl 21024  df-opsr 21026  df-psr1 21261  df-ply1 21263  df-coe1 21264  df-mat 21465

This theorem is referenced by:  decpmataa0  21825  decpmatmulsumfsupp  21830  pmatcollpw2lem  21834  pm2mpmhmlem1  21875