Theorem pmatcoe1fsupp 22616

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 4075	. . . . . 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 873	. . . 4 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) → (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ⊆ ((Base‘𝑅) ↑m ℕ0) ∨ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 } ⊆ ((Base‘𝑅) ↑m ℕ0)))
4		inss 4239	. . . 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 9342	. . . . . . 7 ⊢ ((𝑁 ∈ Fin ∧ 𝑁 ∈ Fin) → (𝑁 × 𝑁) ∈ Fin)
7	6	anidms 566	. . . . . 6 ⊢ (𝑁 ∈ Fin → (𝑁 × 𝑁) ∈ Fin)
8		snfi 9069	. . . . . . . 8 ⊢ {(coe1‘(𝑀‘𝑢))} ∈ Fin
9	8	a1i 11	. . . . . . 7 ⊢ ((𝑁 ∈ Fin ∧ 𝑢 ∈ (𝑁 × 𝑁)) → {(coe1‘(𝑀‘𝑢))} ∈ Fin)
10	9	ralrimiva 3143	. . . . . 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 9365	. . . 4 ⊢ (((𝑁 × 𝑁) ∈ Fin ∧ ∀𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∈ Fin) → ∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∈ Fin)
14		infi 9293	. . . 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 6910	. . . . 5 ⊢ (0g‘𝑅) ∈ V
18	16, 17	eqeltri 2825	. . . 4 ⊢ 0 ∈ V
19	18	a1i 11	. . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) → 0 ∈ V)
20		elin 3963	. . . . . 6 ⊢ (𝑤 ∈ (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 }) ↔ (𝑤 ∈ ∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∧ 𝑤 ∈ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 }))
21		breq1 5151	. . . . . . . 8 ⊢ (𝑣 = 𝑤 → (𝑣 finSupp 0 ↔ 𝑤 finSupp 0 ))
22	21	elrab 3682	. . . . . . 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 3060	. . . 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 13991	. . . 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 5715	. . . . . . . . . . . . . . 15 ⊢ ((𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → ⟨𝑖, 𝑗⟩ ∈ (𝑁 × 𝑁))
31		df-ov 7423	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑖𝑀𝑗) = (𝑀‘⟨𝑖, 𝑗⟩)
32	31	fveq2i 6900	. . . . . . . . . . . . . . . . 17 ⊢ (coe1‘(𝑖𝑀𝑗)) = (coe1‘(𝑀‘⟨𝑖, 𝑗⟩))
33		fvex 6910	. . . . . . . . . . . . . . . . . 18 ⊢ (coe1‘(𝑀‘⟨𝑖, 𝑗⟩)) ∈ V
34	33	snid 4665	. . . . . . . . . . . . . . . . 17 ⊢ (coe1‘(𝑀‘⟨𝑖, 𝑗⟩)) ∈ {(coe1‘(𝑀‘⟨𝑖, 𝑗⟩))}
35	32, 34	eqeltri 2825	. . . . . . . . . . . . . . . 16 ⊢ (coe1‘(𝑖𝑀𝑗)) ∈ {(coe1‘(𝑀‘⟨𝑖, 𝑗⟩))}
36	35	a1i 11	. . . . . . . . . . . . . . 15 ⊢ ((𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → (coe1‘(𝑖𝑀𝑗)) ∈ {(coe1‘(𝑀‘⟨𝑖, 𝑗⟩))})
37		2fveq3 6902	. . . . . . . . . . . . . . . . 17 ⊢ (𝑢 = ⟨𝑖, 𝑗⟩ → (coe1‘(𝑀‘𝑢)) = (coe1‘(𝑀‘⟨𝑖, 𝑗⟩)))
38	37	sneqd 4641	. . . . . . . . . . . . . . . 16 ⊢ (𝑢 = ⟨𝑖, 𝑗⟩ → {(coe1‘(𝑀‘𝑢))} = {(coe1‘(𝑀‘⟨𝑖, 𝑗⟩))})
39	38	eliuni 5002	. . . . . . . . . . . . . . 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 2728	. . . . . . . . . . . . . . . 16 ⊢ (Base‘𝑃) = (Base‘𝑃)
44		pmatcoe1fsupp.b	. . . . . . . . . . . . . . . 16 ⊢ 𝐵 = (Base‘𝐶)
45		simprl 770	. . . . . . . . . . . . . . . 16 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ0) ∧ 𝑥 ∈ ℕ0) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → 𝑖 ∈ 𝑁)
46		simprr 772	. . . . . . . . . . . . . . . 16 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ0) ∧ 𝑥 ∈ ℕ0) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → 𝑗 ∈ 𝑁)
47	44	eleq2i 2821	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑀 ∈ 𝐵 ↔ 𝑀 ∈ (Base‘𝐶))
48	47	biimpi 215	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑀 ∈ 𝐵 → 𝑀 ∈ (Base‘𝐶))
49	48	3ad2ant3 1133	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) → 𝑀 ∈ (Base‘𝐶))
50	49	ad3antrrr 729	. . . . . . . . . . . . . . . . 17 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ0) ∧ 𝑥 ∈ ℕ0) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → 𝑀 ∈ (Base‘𝐶))
51	50, 44	eleqtrrdi 2840	. . . . . . . . . . . . . . . 16 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ0) ∧ 𝑥 ∈ ℕ0) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → 𝑀 ∈ 𝐵)
52	42, 43, 44, 45, 46, 51	matecld 22341	. . . . . . . . . . . . . . 15 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ0) ∧ 𝑥 ∈ ℕ0) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (𝑖𝑀𝑗) ∈ (Base‘𝑃))
53		eqid 2728	. . . . . . . . . . . . . . . 16 ⊢ (coe1‘(𝑖𝑀𝑗)) = (coe1‘(𝑖𝑀𝑗))
54		pmatcoe1fsupp.p	. . . . . . . . . . . . . . . 16 ⊢ 𝑃 = (Poly1‘𝑅)
55		eqid 2728	. . . . . . . . . . . . . . . 16 ⊢ (0g‘𝑅) = (0g‘𝑅)
56		eqid 2728	. . . . . . . . . . . . . . . 16 ⊢ (Base‘𝑅) = (Base‘𝑅)
57	53, 43, 54, 55, 56	coe1fsupp 22133	. . . . . . . . . . . . . . 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 5160	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) → (𝑣 finSupp 0 ↔ 𝑣 finSupp (0g‘𝑅)))
61	60	rabbidv 3437	. . . . . . . . . . . . . . . 16 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) → {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 } = {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp (0g‘𝑅)})
62	61	eleq2d 2815	. . . . . . . . . . . . . . 15 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) → ((coe1‘(𝑖𝑀𝑗)) ∈ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 } ↔ (coe1‘(𝑖𝑀𝑗)) ∈ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp (0g‘𝑅)}))
63	62	ad3antrrr 729	. . . . . . . . . . . . . 14 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ0) ∧ 𝑥 ∈ ℕ0) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → ((coe1‘(𝑖𝑀𝑗)) ∈ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 } ↔ (coe1‘(𝑖𝑀𝑗)) ∈ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp (0g‘𝑅)}))
64	58, 63	mpbird 257	. . . . . . . . . . . . 13 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ0) ∧ 𝑥 ∈ ℕ0) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (coe1‘(𝑖𝑀𝑗)) ∈ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 })
65	41, 64	elind 4194	. . . . . . . . . . . 12 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ0) ∧ 𝑥 ∈ ℕ0) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (coe1‘(𝑖𝑀𝑗)) ∈ (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 }))
66		simplr 768	. . . . . . . . . . . 12 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ0) ∧ 𝑥 ∈ ℕ0) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → 𝑥 ∈ ℕ0)
67		fveq1 6896	. . . . . . . . . . . . . . 15 ⊢ (𝑤 = (coe1‘(𝑖𝑀𝑗)) → (𝑤‘𝑧) = ((coe1‘(𝑖𝑀𝑗))‘𝑧))
68	67	eqeq1d 2730	. . . . . . . . . . . . . 14 ⊢ (𝑤 = (coe1‘(𝑖𝑀𝑗)) → ((𝑤‘𝑧) = 0 ↔ ((coe1‘(𝑖𝑀𝑗))‘𝑧) = 0 ))
69	68	imbi2d 340	. . . . . . . . . . . . 13 ⊢ (𝑤 = (coe1‘(𝑖𝑀𝑗)) → ((𝑠 < 𝑧 → (𝑤‘𝑧) = 0 ) ↔ (𝑠 < 𝑧 → ((coe1‘(𝑖𝑀𝑗))‘𝑧) = 0 )))
70		breq2 5152	. . . . . . . . . . . . . 14 ⊢ (𝑧 = 𝑥 → (𝑠 < 𝑧 ↔ 𝑠 < 𝑥))
71		fveqeq2 6906	. . . . . . . . . . . . . 14 ⊢ (𝑧 = 𝑥 → (((coe1‘(𝑖𝑀𝑗))‘𝑧) = 0 ↔ ((coe1‘(𝑖𝑀𝑗))‘𝑥) = 0 ))
72	70, 71	imbi12d 344	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑥 → ((𝑠 < 𝑧 → ((coe1‘(𝑖𝑀𝑗))‘𝑧) = 0 ) ↔ (𝑠 < 𝑥 → ((coe1‘(𝑖𝑀𝑗))‘𝑥) = 0 )))
73	69, 72	rspc2v 3620	. . . . . . . . . . . 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 3198	. . . . 5 ⊢ (((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) ∧ 𝑠 ∈ ℕ0) ∧ ∀𝑤 ∈ (∪ 𝑢 ∈ (𝑁 × 𝑁){(coe1‘(𝑀‘𝑢))} ∩ {𝑣 ∈ ((Base‘𝑅) ↑m ℕ0) ∣ 𝑣 finSupp 0 })∀𝑧 ∈ ℕ0 (𝑠 < 𝑧 → (𝑤‘𝑧) = 0 )) ∧ 𝑥 ∈ ℕ0) → (𝑠 < 𝑥 → ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ((coe1‘(𝑖𝑀𝑗))‘𝑥) = 0 ))
81	80	ralrimiva 3143	. . . 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 3165	. 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 846   ∧ w3a 1085   = wceq 1534   ∈ wcel 2099  ∀wral 3058  ∃wrex 3067  {crab 3429  Vcvv 3471   ∩ cin 3946   ⊆ wss 3947  {csn 4629  ⟨cop 4635  ∪ ciun 4996   class class class wbr 5148   × cxp 5676  ‘cfv 6548  (class class class)co 7420   ↑_m cmap 8845  Fincfn 8964   finSupp cfsupp 9386   < clt 11279  ℕ₀cn0 12503  Basecbs 17180  0_gc0g 17421  Ringcrg 20173  Poly₁cpl1 22096  coe₁cco1 22097   Mat cmat 22320

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 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2699  ax-rep 5285  ax-sep 5299  ax-nul 5306  ax-pow 5365  ax-pr 5429  ax-un 7740  ax-cnex 11195  ax-resscn 11196  ax-1cn 11197  ax-icn 11198  ax-addcl 11199  ax-addrcl 11200  ax-mulcl 11201  ax-mulrcl 11202  ax-mulcom 11203  ax-addass 11204  ax-mulass 11205  ax-distr 11206  ax-i2m1 11207  ax-1ne0 11208  ax-1rid 11209  ax-rnegex 11210  ax-rrecex 11211  ax-cnre 11212  ax-pre-lttri 11213  ax-pre-lttrn 11214  ax-pre-ltadd 11215  ax-pre-mulgt0 11216

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3or 1086  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2530  df-eu 2559  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ne 2938  df-nel 3044  df-ral 3059  df-rex 3068  df-rmo 3373  df-reu 3374  df-rab 3430  df-v 3473  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-tp 4634  df-op 4636  df-ot 4638  df-uni 4909  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5576  df-eprel 5582  df-po 5590  df-so 5591  df-fr 5633  df-we 5635  df-xp 5684  df-rel 5685  df-cnv 5686  df-co 5687  df-dm 5688  df-rn 5689  df-res 5690  df-ima 5691  df-pred 6305  df-ord 6372  df-on 6373  df-lim 6374  df-suc 6375  df-iota 6500  df-fun 6550  df-fn 6551  df-f 6552  df-f1 6553  df-fo 6554  df-f1o 6555  df-fv 6556  df-riota 7376  df-ov 7423  df-oprab 7424  df-mpo 7425  df-of 7685  df-om 7871  df-1st 7993  df-2nd 7994  df-supp 8166  df-frecs 8287  df-wrecs 8318  df-recs 8392  df-rdg 8431  df-1o 8487  df-er 8725  df-map 8847  df-ixp 8917  df-en 8965  df-dom 8966  df-sdom 8967  df-fin 8968  df-fsupp 9387  df-sup 9466  df-pnf 11281  df-mnf 11282  df-xr 11283  df-ltxr 11284  df-le 11285  df-sub 11477  df-neg 11478  df-nn 12244  df-2 12306  df-3 12307  df-4 12308  df-5 12309  df-6 12310  df-7 12311  df-8 12312  df-9 12313  df-n0 12504  df-z 12590  df-dec 12709  df-uz 12854  df-fz 13518  df-struct 17116  df-sets 17133  df-slot 17151  df-ndx 17163  df-base 17181  df-ress 17210  df-plusg 17246  df-mulr 17247  df-sca 17249  df-vsca 17250  df-ip 17251  df-tset 17252  df-ple 17253  df-ds 17255  df-hom 17257  df-cco 17258  df-0g 17423  df-prds 17429  df-pws 17431  df-sra 21058  df-rgmod 21059  df-dsmm 21666  df-frlm 21681  df-psr 21842  df-mpl 21844  df-opsr 21846  df-psr1 22099  df-ply1 22101  df-coe1 22102  df-mat 22321

This theorem is referenced by:  decpmataa0  22683  decpmatmulsumfsupp  22688  pmatcollpw2lem  22692  pm2mpmhmlem1  22733