Theorem dgrlem 26150

Description: Lemma for dgrcl 26154 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 26117	. . . 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 26115	. . . . . . . . . . 11 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝑆 ⊆ ℂ)
6	4, 5	syl 17	. . . . . . . . . 10 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → 𝑆 ⊆ ℂ)
7		0cnd 11127	. . . . . . . . . . 11 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → 0 ∈ ℂ)
8	7	snssd 4763	. . . . . . . . . 10 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → {0} ⊆ ℂ)
9	6, 8	unssd 4145	. . . . . . . . 9 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → (𝑆 ∪ {0}) ⊆ ℂ)
10		cnex 11109	. . . . . . . . 9 ⊢ ℂ ∈ V
11		ssexg 5265	. . . . . . . . 9 ⊢ (((𝑆 ∪ {0}) ⊆ ℂ ∧ ℂ ∈ V) → (𝑆 ∪ {0}) ∈ V)
12	9, 10, 11	sylancl 586	. . . . . . . 8 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → (𝑆 ∪ {0}) ∈ V)
13		nn0ex 12408	. . . . . . . 8 ⊢ ℕ0 ∈ V
14		elmapg 8773	. . . . . . . 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 26148	. . . . . . . 8 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → (coeff‘𝐹) = 𝑎)
23	17, 22	eqtr2id 2777	. . . . . . 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 3186	. . 3 ⊢ (𝐹 ∈ (Poly‘𝑆) → (∃𝑛 ∈ ℕ0 ∃𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0)((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘)))) → 𝐴:ℕ0⟶(𝑆 ∪ {0})))
28	2, 27	mpd 15	. 2 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐴:ℕ0⟶(𝑆 ∪ {0}))
29		nn0ssz 12512	. . 3 ⊢ ℕ0 ⊆ ℤ
30		ffn 6656	. . . . . . . . . . . . . 14 ⊢ (𝑎:ℕ0⟶ℂ → 𝑎 Fn ℕ0)
31		elpreima 6996	. . . . . . . . . . . . . 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 4744	. . . . . . . . . . . 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 26113	. . . . . . . . . . . . . . 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 3221	. . . . . . . . . . . 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 3121	. . . . . . . . 9 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → ∀𝑥 ∈ (◡𝑎 “ (ℂ ∖ {0}))𝑥 ≤ 𝑛)
44	23	cnveqd 5822	. . . . . . . . . 10 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → ◡𝑎 = ◡𝐴)
45	44	imaeq1d 6014	. . . . . . . . 9 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ (𝑛 ∈ ℕ0 ∧ 𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0))) ∧ ((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))) → (◡𝑎 “ (ℂ ∖ {0})) = (◡𝐴 “ (ℂ ∖ {0})))
46	43, 45	raleqtrdv 3292	. . . . . . . 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 3128	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑛 ∈ ℕ0) → (∃𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0)((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘)))) → ∀𝑥 ∈ (◡𝐴 “ (ℂ ∖ {0}))𝑥 ≤ 𝑛))
50	49	reximdva 3142	. . . 4 ⊢ (𝐹 ∈ (Poly‘𝑆) → (∃𝑛 ∈ ℕ0 ∃𝑎 ∈ ((𝑆 ∪ {0}) ↑m ℕ0)((𝑎 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘)))) → ∃𝑛 ∈ ℕ0 ∀𝑥 ∈ (◡𝐴 “ (ℂ ∖ {0}))𝑥 ≤ 𝑛))
51	2, 50	mpd 15	. . 3 ⊢ (𝐹 ∈ (Poly‘𝑆) → ∃𝑛 ∈ ℕ0 ∀𝑥 ∈ (◡𝐴 “ (ℂ ∖ {0}))𝑥 ≤ 𝑛)
52		ssrexv 4007	. . 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 1540   ∈ wcel 2109   ≠ wne 2925  ∀wral 3044  ∃wrex 3053  Vcvv 3438   ∖ cdif 3902   ∪ cun 3903   ⊆ wss 3905  {csn 4579   class class class wbr 5095   ↦ cmpt 5176  ^◡ccnv 5622   “ cima 5626   Fn wfn 6481  ⟶wf 6482  ‘cfv 6486  (class class class)co 7353   ↑_m cmap 8760  ℂcc 11026  0cc0 11028  1c1 11029   + caddc 11031   · cmul 11033   ≤ cle 11169  ℕ₀cn0 12402  ℤcz 12489  ℤ_≥cuz 12753  ...cfz 13428  ↑cexp 13986  Σcsu 15611  Polycply 26105  coeffccoe 26107

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7675  ax-inf2 9556  ax-cnex 11084  ax-resscn 11085  ax-1cn 11086  ax-icn 11087  ax-addcl 11088  ax-addrcl 11089  ax-mulcl 11090  ax-mulrcl 11091  ax-mulcom 11092  ax-addass 11093  ax-mulass 11094  ax-distr 11095  ax-i2m1 11096  ax-1ne0 11097  ax-1rid 11098  ax-rnegex 11099  ax-rrecex 11100  ax-cnre 11101  ax-pre-lttri 11102  ax-pre-lttrn 11103  ax-pre-ltadd 11104  ax-pre-mulgt0 11105  ax-pre-sup 11106

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-rmo 3345  df-reu 3346  df-rab 3397  df-v 3440  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4862  df-int 4900  df-iun 4946  df-br 5096  df-opab 5158  df-mpt 5177  df-tr 5203  df-id 5518  df-eprel 5523  df-po 5531  df-so 5532  df-fr 5576  df-se 5577  df-we 5578  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  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 7310  df-ov 7356  df-oprab 7357  df-mpo 7358  df-of 7617  df-om 7807  df-1st 7931  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-rdg 8339  df-1o 8395  df-er 8632  df-map 8762  df-pm 8763  df-en 8880  df-dom 8881  df-sdom 8882  df-fin 8883  df-sup 9351  df-inf 9352  df-oi 9421  df-card 9854  df-pnf 11170  df-mnf 11171  df-xr 11172  df-ltxr 11173  df-le 11174  df-sub 11367  df-neg 11368  df-div 11796  df-nn 12147  df-2 12209  df-3 12210  df-n0 12403  df-z 12490  df-uz 12754  df-rp 12912  df-fz 13429  df-fzo 13576  df-fl 13714  df-seq 13927  df-exp 13987  df-hash 14256  df-cj 15024  df-re 15025  df-im 15026  df-sqrt 15160  df-abs 15161  df-clim 15413  df-rlim 15414  df-sum 15612  df-0p 25587  df-ply 26109  df-coe 26111

This theorem is referenced by:  coef  26151  dgrcl  26154  dgrub  26155  dgrlb  26157