Theorem dgrlem 26162

Description: Lemma for dgrcl 26166 and similar theorems. (Contributed by Mario Carneiro, 22-Jul-2014.)

Hypothesis

Ref	Expression
dgrval.1	⊢ 𝐴 = (coeff‘𝐹)

Assertion

Ref	Expression
dgrlem	⊢ (𝐹 ∈ (Poly‘𝑆) → (𝐴:ℕ0⟶(𝑆 ∪ {0}) ∧ ∃𝑛 ∈ ℤ ∀𝑥 ∈ (◡𝐴 “ (ℂ ∖ {0}))𝑥 ≤ 𝑛))

Distinct variable groups:   𝑥,𝑛,𝐴   𝑛,𝐹,𝑥   𝑆,𝑛,𝑥

Proof of Theorem dgrlem

Dummy variables 𝑎 𝑘 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elply2 26129	. . . 4 ⊢ (𝐹 ∈ (Poly‘𝑆) ↔ (𝑆 ⊆ ℂ ∧ ∃𝑛 ∈ ℕ0 ∃𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0)((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))))
2	1	simprbi 496	. . 3 ⊢ (𝐹 ∈ (Poly‘𝑆) → ∃𝑛 ∈ ℕ0 ∃𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0)((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘)))))
3		simplrr 777	. . . . . . 7 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))
4		simpll 766	. . . . . . . . . . 11 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → 𝐹 ∈ (Poly‘𝑆))
5		plybss 26127	. . . . . . . . . . 11 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝑆 ⊆ ℂ)
6	4, 5	syl 17	. . . . . . . . . 10 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → 𝑆 ⊆ ℂ)
7		0cnd 11112	. . . . . . . . . . 11 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → 0 ∈ ℂ)
8	7	snssd 4760	. . . . . . . . . 10 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → {0} ⊆ ℂ)
9	6, 8	unssd 4141	. . . . . . . . 9 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → (𝑆 ∪ {0}) ⊆ ℂ)
10		cnex 11094	. . . . . . . . 9 ⊢ ℂ ∈ V
11		ssexg 5263	. . . . . . . . 9 ⊢ (((𝑆 ∪ {0}) ⊆ ℂ ∧ ℂ ∈ V) → (𝑆 ∪ {0}) ∈ V)
12	9, 10, 11	sylancl 586	. . . . . . . 8 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → (𝑆 ∪ {0}) ∈ V)
13		nn0ex 12394	. . . . . . . 8 ⊢ ℕ0 ∈ V
14		elmapg 8769	. . . . . . . 8 ⊢ (((𝑆 ∪ {0}) ∈ V ∧ ℕ0 ∈ V) → (𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0) ↔ 𝑎:ℕ0⟶(𝑆 ∪ {0})))
15	12, 13, 14	sylancl 586	. . . . . . 7 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → (𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0) ↔ 𝑎:ℕ0⟶(𝑆 ∪ {0})))
16	3, 15	mpbid 232	. . . . . 6 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → 𝑎:ℕ0⟶(𝑆 ∪ {0}))
17		dgrval.1	. . . . . . . 8 ⊢ 𝐴 = (coeff‘𝐹)
18		simplrl 776	. . . . . . . . 9 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → 𝑛 ∈ ℕ0)
19	16, 9	fssd 6673	. . . . . . . . 9 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → 𝑎:ℕ0⟶ℂ)
20		simprl 770	. . . . . . . . 9 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → (𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0})
21		simprr 772	. . . . . . . . 9 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))
22	4, 18, 19, 20, 21	coeeq 26160	. . . . . . . 8 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → (coeff‘𝐹) = 𝑎)
23	17, 22	eqtr2id 2781	. . . . . . 7 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → 𝑎 = 𝐴)
24	23	feq1d 6638	. . . . . 6 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → (𝑎:ℕ0⟶(𝑆 ∪ {0}) ↔ 𝐴:ℕ0⟶(𝑆 ∪ {0})))
25	16, 24	mpbid 232	. . . . 5 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → 𝐴:ℕ0⟶(𝑆 ∪ {0}))
26	25	ex 412	. . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) → (((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘)))) → 𝐴:ℕ0⟶(𝑆 ∪ {0})))
27	26	rexlimdvva 3190	. . 3 ⊢ (𝐹 ∈ (Poly‘𝑆) → (∃𝑛 ∈ ℕ0 ∃𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0)((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘)))) → 𝐴:ℕ0⟶(𝑆 ∪ {0})))
28	2, 27	mpd 15	. 2 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐴:ℕ0⟶(𝑆 ∪ {0}))
29		nn0ssz 12498	. . 3 ⊢ ℕ0 ⊆ ℤ
30		ffn 6656	. . . . . . . . . . . . . 14 ⊢ (𝑎:ℕ0⟶ℂ → 𝑎 Fn ℕ0)
31		elpreima 6997	. . . . . . . . . . . . . 14 ⊢ (𝑎 Fn ℕ0 → (𝑥 ∈ (◡𝑎 “ (ℂ ∖ {0})) ↔ (𝑥 ∈ ℕ0 ∧ (𝑎‘𝑥) ∈ (ℂ ∖ {0}))))
32	19, 30, 31	3syl 18	. . . . . . . . . . . . 13 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → (𝑥 ∈ (◡𝑎 “ (ℂ ∖ {0})) ↔ (𝑥 ∈ ℕ0 ∧ (𝑎‘𝑥) ∈ (ℂ ∖ {0}))))
33	32	biimpa 476	. . . . . . . . . . . 12 ⊢ ((((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) ∧ 𝑥 ∈ (◡𝑎 “ (ℂ ∖ {0}))) → (𝑥 ∈ ℕ0 ∧ (𝑎‘𝑥) ∈ (ℂ ∖ {0})))
34		eldifsni 4741	. . . . . . . . . . . 12 ⊢ ((𝑎‘𝑥) ∈ (ℂ ∖ {0}) → (𝑎‘𝑥) ≠ 0)
35	33, 34	simpl2im 503	. . . . . . . . . . 11 ⊢ ((((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) ∧ 𝑥 ∈ (◡𝑎 “ (ℂ ∖ {0}))) → (𝑎‘𝑥) ≠ 0)
36	33	simpld 494	. . . . . . . . . . . 12 ⊢ ((((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) ∧ 𝑥 ∈ (◡𝑎 “ (ℂ ∖ {0}))) → 𝑥 ∈ ℕ0)
37		plyco0 26125	. . . . . . . . . . . . . . 15 ⊢ ((𝑛 ∈ ℕ0 ∧ 𝑎:ℕ0⟶ℂ) → ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ↔ ∀𝑥 ∈ ℕ0 ((𝑎‘𝑥) ≠ 0 → 𝑥 ≤ 𝑛)))
38	18, 19, 37	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ↔ ∀𝑥 ∈ ℕ0 ((𝑎‘𝑥) ≠ 0 → 𝑥 ≤ 𝑛)))
39	20, 38	mpbid 232	. . . . . . . . . . . . 13 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → ∀𝑥 ∈ ℕ0 ((𝑎‘𝑥) ≠ 0 → 𝑥 ≤ 𝑛))
40	39	r19.21bi 3225	. . . . . . . . . . . 12 ⊢ ((((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) ∧ 𝑥 ∈ ℕ0) → ((𝑎‘𝑥) ≠ 0 → 𝑥 ≤ 𝑛))
41	36, 40	syldan 591	. . . . . . . . . . 11 ⊢ ((((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) ∧ 𝑥 ∈ (◡𝑎 “ (ℂ ∖ {0}))) → ((𝑎‘𝑥) ≠ 0 → 𝑥 ≤ 𝑛))
42	35, 41	mpd 15	. . . . . . . . . 10 ⊢ ((((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) ∧ 𝑥 ∈ (◡𝑎 “ (ℂ ∖ {0}))) → 𝑥 ≤ 𝑛)
43	42	ralrimiva 3125	. . . . . . . . 9 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → ∀𝑥 ∈ (◡𝑎 “ (ℂ ∖ {0}))𝑥 ≤ 𝑛)
44	23	cnveqd 5819	. . . . . . . . . 10 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → ◡𝑎 = ◡𝐴)
45	44	imaeq1d 6012	. . . . . . . . 9 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → (◡𝑎 “ (ℂ ∖ {0})) = (◡𝐴 “ (ℂ ∖ {0})))
46	43, 45	raleqtrdv 3295	. . . . . . . 8 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → ∀𝑥 ∈ (◡𝐴 “ (ℂ ∖ {0}))𝑥 ≤ 𝑛)
47	46	ex 412	. . . . . . 7 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) → (((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘)))) → ∀𝑥 ∈ (◡𝐴 “ (ℂ ∖ {0}))𝑥 ≤ 𝑛))
48	47	expr 456	. . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑛 ∈ ℕ0) → (𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0) → (((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘)))) → ∀𝑥 ∈ (◡𝐴 “ (ℂ ∖ {0}))𝑥 ≤ 𝑛)))
49	48	rexlimdv 3132	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑛 ∈ ℕ0) → (∃𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0)((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘)))) → ∀𝑥 ∈ (◡𝐴 “ (ℂ ∖ {0}))𝑥 ≤ 𝑛))
50	49	reximdva 3146	. . . 4 ⊢ (𝐹 ∈ (Poly‘𝑆) → (∃𝑛 ∈ ℕ0 ∃𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0)((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘)))) → ∃𝑛 ∈ ℕ0 ∀𝑥 ∈ (◡𝐴 “ (ℂ ∖ {0}))𝑥 ≤ 𝑛))
51	2, 50	mpd 15	. . 3 ⊢ (𝐹 ∈ (Poly‘𝑆) → ∃𝑛 ∈ ℕ0 ∀𝑥 ∈ (◡𝐴 “ (ℂ ∖ {0}))𝑥 ≤ 𝑛)
52		ssrexv 4000	. . 3 ⊢ (ℕ0 ⊆ ℤ → (∃𝑛 ∈ ℕ0 ∀𝑥 ∈ (◡𝐴 “ (ℂ ∖ {0}))𝑥 ≤ 𝑛 → ∃𝑛 ∈ ℤ ∀𝑥 ∈ (◡𝐴 “ (ℂ ∖ {0}))𝑥 ≤ 𝑛))
53	29, 51, 52	mpsyl 68	. 2 ⊢ (𝐹 ∈ (Poly‘𝑆) → ∃𝑛 ∈ ℤ ∀𝑥 ∈ (◡𝐴 “ (ℂ ∖ {0}))𝑥 ≤ 𝑛)
54	28, 53	jca 511	1 ⊢ (𝐹 ∈ (Poly‘𝑆) → (𝐴:ℕ0⟶(𝑆 ∪ {0}) ∧ ∃𝑛 ∈ ℤ ∀𝑥 ∈ (◡𝐴 “ (ℂ ∖ {0}))𝑥 ≤ 𝑛))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1541   ∈ wcel 2113   ≠ wne 2929  ∀wral 3048  ∃wrex 3057  Vcvv 3437   ∖ cdif 3895   ∪ cun 3896   ⊆ wss 3898  {csn 4575   class class class wbr 5093   ↦ cmpt 5174  ^◡ccnv 5618   “ cima 5622   Fn wfn 6481  ⟶wf 6482  ‘cfv 6486  (class class class)co 7352   ↑_m cmap 8756  ℂcc 11011  0cc0 11013  1c1 11014   + caddc 11016   · cmul 11018   ≤ cle 11154  ℕ₀cn0 12388  ℤcz 12475  ℤ_≥cuz 12738  ...cfz 13409  ↑cexp 13970  Σcsu 15595  Polycply 26117  coeffccoe 26119

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-inf2 9538  ax-cnex 11069  ax-resscn 11070  ax-1cn 11071  ax-icn 11072  ax-addcl 11073  ax-addrcl 11074  ax-mulcl 11075  ax-mulrcl 11076  ax-mulcom 11077  ax-addass 11078  ax-mulass 11079  ax-distr 11080  ax-i2m1 11081  ax-1ne0 11082  ax-1rid 11083  ax-rnegex 11084  ax-rrecex 11085  ax-cnre 11086  ax-pre-lttri 11087  ax-pre-lttrn 11088  ax-pre-ltadd 11089  ax-pre-mulgt0 11090  ax-pre-sup 11091

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-nel 3034  df-ral 3049  df-rex 3058  df-rmo 3347  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-int 4898  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-se 5573  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-isom 6495  df-riota 7309  df-ov 7355  df-oprab 7356  df-mpo 7357  df-of 7616  df-om 7803  df-1st 7927  df-2nd 7928  df-frecs 8217  df-wrecs 8248  df-recs 8297  df-rdg 8335  df-1o 8391  df-er 8628  df-map 8758  df-pm 8759  df-en 8876  df-dom 8877  df-sdom 8878  df-fin 8879  df-sup 9333  df-inf 9334  df-oi 9403  df-card 9839  df-pnf 11155  df-mnf 11156  df-xr 11157  df-ltxr 11158  df-le 11159  df-sub 11353  df-neg 11354  df-div 11782  df-nn 12133  df-2 12195  df-3 12196  df-n0 12389  df-z 12476  df-uz 12739  df-rp 12893  df-fz 13410  df-fzo 13557  df-fl 13698  df-seq 13911  df-exp 13971  df-hash 14240  df-cj 15008  df-re 15009  df-im 15010  df-sqrt 15144  df-abs 15145  df-clim 15397  df-rlim 15398  df-sum 15596  df-0p 25599  df-ply 26121  df-coe 26123

This theorem is referenced by:  coef  26163  dgrcl  26166  dgrub  26167  dgrlb  26169