ftalem2 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > ftalem2		Structured version Visualization version GIF version

Theorem ftalem2 26990

Description: Lemma for fta 26996. There exists some 𝑟 such that 𝐹 has magnitude greater than 𝐹(0) outside the closed ball B(0,r). (Contributed by Mario Carneiro, 14-Sep-2014.)

**Hypotheses**
Ref	Expression
ftalem.1	⊢ 𝐴 = (coeff‘𝐹)
ftalem.2	⊢ 𝑁 = (deg‘𝐹)
ftalem.3	⊢ (𝜑 → 𝐹 ∈ (Poly‘𝑆))
ftalem.4	⊢ (𝜑 → 𝑁 ∈ ℕ)
ftalem2.5	⊢ 𝑈 = if(if(1 ≤ 𝑠, 𝑠, 1) ≤ 𝑇, 𝑇, if(1 ≤ 𝑠, 𝑠, 1))
ftalem2.6	⊢ 𝑇 = ((abs‘(𝐹‘0)) / ((abs‘(𝐴‘𝑁)) / 2))

**Assertion**
Ref	Expression
ftalem2	⊢ (𝜑 → ∃𝑟 ∈ ℝ⁺ ∀𝑥 ∈ ℂ (𝑟 < (abs‘𝑥) → (abs‘(𝐹‘0)) < (abs‘(𝐹‘𝑥))))

Distinct variable groups: 𝑠,𝑟,𝑥,𝐴 𝑁,𝑟,𝑠,𝑥 𝐹,𝑟,𝑠,𝑥 𝜑,𝑠,𝑥 𝑆,𝑠 𝑇,𝑟,𝑥 𝑈,𝑟,𝑥 Allowed substitution hints: 𝜑(𝑟) 𝑆(𝑥,𝑟) 𝑇(𝑠) 𝑈(𝑠)

Proof of Theorem ftalem2 Dummy variables 𝑘 𝑛 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ftalem.1	. . 3 ⊢ 𝐴 = (coeff‘𝐹)
2		ftalem.2	. . 3 ⊢ 𝑁 = (deg‘𝐹)
3		ftalem.3	. . 3 ⊢ (𝜑 → 𝐹 ∈ (Poly‘𝑆))
4		ftalem.4	. . 3 ⊢ (𝜑 → 𝑁 ∈ ℕ)
5	1	coef3 26143	. . . . . . 7 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐴:ℕ₀⟶ℂ)
6	3, 5	syl 17	. . . . . 6 ⊢ (𝜑 → 𝐴:ℕ₀⟶ℂ)
7	4	nnnn0d 12509	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
8	6, 7	ffvelcdmd 7059	. . . . 5 ⊢ (𝜑 → (𝐴‘𝑁) ∈ ℂ)
9	4	nnne0d 12237	. . . . . 6 ⊢ (𝜑 → 𝑁 ≠ 0)
10	2, 1	dgreq0 26177	. . . . . . . . 9 ⊢ (𝐹 ∈ (Poly‘𝑆) → (𝐹 = 0_𝑝 ↔ (𝐴‘𝑁) = 0))
11		fveq2 6860	. . . . . . . . . . 11 ⊢ (𝐹 = 0_𝑝 → (deg‘𝐹) = (deg‘0_𝑝))
12		dgr0 26174	. . . . . . . . . . 11 ⊢ (deg‘0_𝑝) = 0
13	11, 12	eqtrdi 2781	. . . . . . . . . 10 ⊢ (𝐹 = 0_𝑝 → (deg‘𝐹) = 0)
14	2, 13	eqtrid 2777	. . . . . . . . 9 ⊢ (𝐹 = 0_𝑝 → 𝑁 = 0)
15	10, 14	biimtrrdi 254	. . . . . . . 8 ⊢ (𝐹 ∈ (Poly‘𝑆) → ((𝐴‘𝑁) = 0 → 𝑁 = 0))
16	3, 15	syl 17	. . . . . . 7 ⊢ (𝜑 → ((𝐴‘𝑁) = 0 → 𝑁 = 0))
17	16	necon3d 2947	. . . . . 6 ⊢ (𝜑 → (𝑁 ≠ 0 → (𝐴‘𝑁) ≠ 0))
18	9, 17	mpd 15	. . . . 5 ⊢ (𝜑 → (𝐴‘𝑁) ≠ 0)
19	8, 18	absrpcld 15423	. . . 4 ⊢ (𝜑 → (abs‘(𝐴‘𝑁)) ∈ ℝ⁺)
20	19	rphalfcld 13013	. . 3 ⊢ (𝜑 → ((abs‘(𝐴‘𝑁)) / 2) ∈ ℝ⁺)
21		2fveq3 6865	. . . . 5 ⊢ (𝑛 = 𝑘 → (abs‘(𝐴‘𝑛)) = (abs‘(𝐴‘𝑘)))
22	21	cbvsumv 15668	. . . 4 ⊢ Σ𝑛 ∈ (0...(𝑁 − 1))(abs‘(𝐴‘𝑛)) = Σ𝑘 ∈ (0...(𝑁 − 1))(abs‘(𝐴‘𝑘))
23	22	oveq1i 7399	. . 3 ⊢ (Σ𝑛 ∈ (0...(𝑁 − 1))(abs‘(𝐴‘𝑛)) / ((abs‘(𝐴‘𝑁)) / 2)) = (Σ𝑘 ∈ (0...(𝑁 − 1))(abs‘(𝐴‘𝑘)) / ((abs‘(𝐴‘𝑁)) / 2))
24	1, 2, 3, 4, 20, 23	ftalem1 26989	. 2 ⊢ (𝜑 → ∃𝑠 ∈ ℝ ∀𝑥 ∈ ℂ (𝑠 < (abs‘𝑥) → (abs‘((𝐹‘𝑥) − ((𝐴‘𝑁) · (𝑥↑𝑁)))) < (((abs‘(𝐴‘𝑁)) / 2) · ((abs‘𝑥)↑𝑁))))
25		ftalem2.5	. . . . . 6 ⊢ 𝑈 = if(if(1 ≤ 𝑠, 𝑠, 1) ≤ 𝑇, 𝑇, if(1 ≤ 𝑠, 𝑠, 1))
26		ftalem2.6	. . . . . . . . 9 ⊢ 𝑇 = ((abs‘(𝐹‘0)) / ((abs‘(𝐴‘𝑁)) / 2))
27		plyf 26109	. . . . . . . . . . . . 13 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐹:ℂ⟶ℂ)
28	3, 27	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐹:ℂ⟶ℂ)
29		0cn 11172	. . . . . . . . . . . 12 ⊢ 0 ∈ ℂ
30		ffvelcdm 7055	. . . . . . . . . . . 12 ⊢ ((𝐹:ℂ⟶ℂ ∧ 0 ∈ ℂ) → (𝐹‘0) ∈ ℂ)
31	28, 29, 30	sylancl 586	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐹‘0) ∈ ℂ)
32	31	abscld 15411	. . . . . . . . . 10 ⊢ (𝜑 → (abs‘(𝐹‘0)) ∈ ℝ)
33	32, 20	rerpdivcld 13032	. . . . . . . . 9 ⊢ (𝜑 → ((abs‘(𝐹‘0)) / ((abs‘(𝐴‘𝑁)) / 2)) ∈ ℝ)
34	26, 33	eqeltrid 2833	. . . . . . . 8 ⊢ (𝜑 → 𝑇 ∈ ℝ)
35	34	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → 𝑇 ∈ ℝ)
36		simpr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → 𝑠 ∈ ℝ)
37		1re 11180	. . . . . . . 8 ⊢ 1 ∈ ℝ
38		ifcl 4536	. . . . . . . 8 ⊢ ((𝑠 ∈ ℝ ∧ 1 ∈ ℝ) → if(1 ≤ 𝑠, 𝑠, 1) ∈ ℝ)
39	36, 37, 38	sylancl 586	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → if(1 ≤ 𝑠, 𝑠, 1) ∈ ℝ)
40	35, 39	ifcld 4537	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → if(if(1 ≤ 𝑠, 𝑠, 1) ≤ 𝑇, 𝑇, if(1 ≤ 𝑠, 𝑠, 1)) ∈ ℝ)
41	25, 40	eqeltrid 2833	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → 𝑈 ∈ ℝ)
42		0red 11183	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → 0 ∈ ℝ)
43		1red 11181	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → 1 ∈ ℝ)
44		0lt1 11706	. . . . . . 7 ⊢ 0 < 1
45	44	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → 0 < 1)
46		max1 13151	. . . . . . . 8 ⊢ ((1 ∈ ℝ ∧ 𝑠 ∈ ℝ) → 1 ≤ if(1 ≤ 𝑠, 𝑠, 1))
47	37, 36, 46	sylancr 587	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → 1 ≤ if(1 ≤ 𝑠, 𝑠, 1))
48		max1 13151	. . . . . . . . 9 ⊢ ((if(1 ≤ 𝑠, 𝑠, 1) ∈ ℝ ∧ 𝑇 ∈ ℝ) → if(1 ≤ 𝑠, 𝑠, 1) ≤ if(if(1 ≤ 𝑠, 𝑠, 1) ≤ 𝑇, 𝑇, if(1 ≤ 𝑠, 𝑠, 1)))
49	39, 35, 48	syl2anc 584	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → if(1 ≤ 𝑠, 𝑠, 1) ≤ if(if(1 ≤ 𝑠, 𝑠, 1) ≤ 𝑇, 𝑇, if(1 ≤ 𝑠, 𝑠, 1)))
50	49, 25	breqtrrdi 5151	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → if(1 ≤ 𝑠, 𝑠, 1) ≤ 𝑈)
51	43, 39, 41, 47, 50	letrd 11337	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → 1 ≤ 𝑈)
52	42, 43, 41, 45, 51	ltletrd 11340	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → 0 < 𝑈)
53	41, 52	elrpd 12998	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → 𝑈 ∈ ℝ⁺)
54		max2 13153	. . . . . . . . . . 11 ⊢ ((1 ∈ ℝ ∧ 𝑠 ∈ ℝ) → 𝑠 ≤ if(1 ≤ 𝑠, 𝑠, 1))
55	37, 36, 54	sylancr 587	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → 𝑠 ≤ if(1 ≤ 𝑠, 𝑠, 1))
56	36, 39, 41, 55, 50	letrd 11337	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → 𝑠 ≤ 𝑈)
57	56	adantr 480	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ 𝑥 ∈ ℂ) → 𝑠 ≤ 𝑈)
58		abscl 15250	. . . . . . . . 9 ⊢ (𝑥 ∈ ℂ → (abs‘𝑥) ∈ ℝ)
59		lelttr 11270	. . . . . . . . 9 ⊢ ((𝑠 ∈ ℝ ∧ 𝑈 ∈ ℝ ∧ (abs‘𝑥) ∈ ℝ) → ((𝑠 ≤ 𝑈 ∧ 𝑈 < (abs‘𝑥)) → 𝑠 < (abs‘𝑥)))
60	36, 41, 58, 59	syl2an3an 1424	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ 𝑥 ∈ ℂ) → ((𝑠 ≤ 𝑈 ∧ 𝑈 < (abs‘𝑥)) → 𝑠 < (abs‘𝑥)))
61	57, 60	mpand 695	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ 𝑥 ∈ ℂ) → (𝑈 < (abs‘𝑥) → 𝑠 < (abs‘𝑥)))
62	61	imim1d 82	. . . . . 6 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ 𝑥 ∈ ℂ) → ((𝑠 < (abs‘𝑥) → (abs‘((𝐹‘𝑥) − ((𝐴‘𝑁) · (𝑥↑𝑁)))) < (((abs‘(𝐴‘𝑁)) / 2) · ((abs‘𝑥)↑𝑁))) → (𝑈 < (abs‘𝑥) → (abs‘((𝐹‘𝑥) − ((𝐴‘𝑁) · (𝑥↑𝑁)))) < (((abs‘(𝐴‘𝑁)) / 2) · ((abs‘𝑥)↑𝑁)))))
63	28	ad2antrr 726	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → 𝐹:ℂ⟶ℂ)
64		simprl 770	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → 𝑥 ∈ ℂ)
65	63, 64	ffvelcdmd 7059	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (𝐹‘𝑥) ∈ ℂ)
66	8	ad2antrr 726	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (𝐴‘𝑁) ∈ ℂ)
67	7	ad2antrr 726	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → 𝑁 ∈ ℕ₀)
68	64, 67	expcld 14117	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (𝑥↑𝑁) ∈ ℂ)
69	66, 68	mulcld 11200	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → ((𝐴‘𝑁) · (𝑥↑𝑁)) ∈ ℂ)
70	65, 69	subcld 11539	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → ((𝐹‘𝑥) − ((𝐴‘𝑁) · (𝑥↑𝑁))) ∈ ℂ)
71	70	abscld 15411	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (abs‘((𝐹‘𝑥) − ((𝐴‘𝑁) · (𝑥↑𝑁)))) ∈ ℝ)
72	69	abscld 15411	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) ∈ ℝ)
73	72	rehalfcld 12435	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2) ∈ ℝ)
74	71, 73, 72	ltsub2d 11794	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → ((abs‘((𝐹‘𝑥) − ((𝐴‘𝑁) · (𝑥↑𝑁)))) < ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2) ↔ ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) − ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2)) < ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) − (abs‘((𝐹‘𝑥) − ((𝐴‘𝑁) · (𝑥↑𝑁)))))))
75	66, 68	absmuld 15429	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) = ((abs‘(𝐴‘𝑁)) · (abs‘(𝑥↑𝑁))))
76	64, 67	absexpd 15427	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (abs‘(𝑥↑𝑁)) = ((abs‘𝑥)↑𝑁))
77	76	oveq2d 7405	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → ((abs‘(𝐴‘𝑁)) · (abs‘(𝑥↑𝑁))) = ((abs‘(𝐴‘𝑁)) · ((abs‘𝑥)↑𝑁)))
78	75, 77	eqtrd 2765	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) = ((abs‘(𝐴‘𝑁)) · ((abs‘𝑥)↑𝑁)))
79	78	oveq1d 7404	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2) = (((abs‘(𝐴‘𝑁)) · ((abs‘𝑥)↑𝑁)) / 2))
80	66	abscld 15411	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (abs‘(𝐴‘𝑁)) ∈ ℝ)
81	80	recnd 11208	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (abs‘(𝐴‘𝑁)) ∈ ℂ)
82	58	ad2antrl 728	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (abs‘𝑥) ∈ ℝ)
83	82, 67	reexpcld 14134	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → ((abs‘𝑥)↑𝑁) ∈ ℝ)
84	83	recnd 11208	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → ((abs‘𝑥)↑𝑁) ∈ ℂ)
85		2cnd 12265	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → 2 ∈ ℂ)
86		2ne0 12291	. . . . . . . . . . . . . . 15 ⊢ 2 ≠ 0
87	86	a1i 11	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → 2 ≠ 0)
88	81, 84, 85, 87	div23d 12001	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (((abs‘(𝐴‘𝑁)) · ((abs‘𝑥)↑𝑁)) / 2) = (((abs‘(𝐴‘𝑁)) / 2) · ((abs‘𝑥)↑𝑁)))
89	79, 88	eqtrd 2765	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2) = (((abs‘(𝐴‘𝑁)) / 2) · ((abs‘𝑥)↑𝑁)))
90	89	breq2d 5121	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → ((abs‘((𝐹‘𝑥) − ((𝐴‘𝑁) · (𝑥↑𝑁)))) < ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2) ↔ (abs‘((𝐹‘𝑥) − ((𝐴‘𝑁) · (𝑥↑𝑁)))) < (((abs‘(𝐴‘𝑁)) / 2) · ((abs‘𝑥)↑𝑁))))
91	72	recnd 11208	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) ∈ ℂ)
92	91	2halvesd 12434	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2) + ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2)) = (abs‘((𝐴‘𝑁) · (𝑥↑𝑁))))
93	92	oveq1d 7404	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → ((((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2) + ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2)) − ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2)) = ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) − ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2)))
94	73	recnd 11208	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2) ∈ ℂ)
95	94, 94	pncand 11540	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → ((((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2) + ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2)) − ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2)) = ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2))
96	93, 95	eqtr3d 2767	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) − ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2)) = ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2))
97	96	breq1d 5119	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) − ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2)) < ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) − (abs‘((𝐹‘𝑥) − ((𝐴‘𝑁) · (𝑥↑𝑁))))) ↔ ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2) < ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) − (abs‘((𝐹‘𝑥) − ((𝐴‘𝑁) · (𝑥↑𝑁)))))))
98	74, 90, 97	3bitr3d 309	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → ((abs‘((𝐹‘𝑥) − ((𝐴‘𝑁) · (𝑥↑𝑁)))) < (((abs‘(𝐴‘𝑁)) / 2) · ((abs‘𝑥)↑𝑁)) ↔ ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2) < ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) − (abs‘((𝐹‘𝑥) − ((𝐴‘𝑁) · (𝑥↑𝑁)))))))
99	69, 65	subcld 11539	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (((𝐴‘𝑁) · (𝑥↑𝑁)) − (𝐹‘𝑥)) ∈ ℂ)
100	69, 99	abs2difd 15432	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) − (abs‘(((𝐴‘𝑁) · (𝑥↑𝑁)) − (𝐹‘𝑥)))) ≤ (abs‘(((𝐴‘𝑁) · (𝑥↑𝑁)) − (((𝐴‘𝑁) · (𝑥↑𝑁)) − (𝐹‘𝑥)))))
101	69, 65	abssubd 15428	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (abs‘(((𝐴‘𝑁) · (𝑥↑𝑁)) − (𝐹‘𝑥))) = (abs‘((𝐹‘𝑥) − ((𝐴‘𝑁) · (𝑥↑𝑁)))))
102	101	oveq2d 7405	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) − (abs‘(((𝐴‘𝑁) · (𝑥↑𝑁)) − (𝐹‘𝑥)))) = ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) − (abs‘((𝐹‘𝑥) − ((𝐴‘𝑁) · (𝑥↑𝑁))))))
103	69, 65	nncand 11544	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (((𝐴‘𝑁) · (𝑥↑𝑁)) − (((𝐴‘𝑁) · (𝑥↑𝑁)) − (𝐹‘𝑥))) = (𝐹‘𝑥))
104	103	fveq2d 6864	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (abs‘(((𝐴‘𝑁) · (𝑥↑𝑁)) − (((𝐴‘𝑁) · (𝑥↑𝑁)) − (𝐹‘𝑥)))) = (abs‘(𝐹‘𝑥)))
105	100, 102, 104	3brtr3d 5140	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) − (abs‘((𝐹‘𝑥) − ((𝐴‘𝑁) · (𝑥↑𝑁))))) ≤ (abs‘(𝐹‘𝑥)))
106	72, 71	resubcld 11612	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) − (abs‘((𝐹‘𝑥) − ((𝐴‘𝑁) · (𝑥↑𝑁))))) ∈ ℝ)
107	65	abscld 15411	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (abs‘(𝐹‘𝑥)) ∈ ℝ)
108		ltletr 11272	. . . . . . . . . . . 12 ⊢ ((((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2) ∈ ℝ ∧ ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) − (abs‘((𝐹‘𝑥) − ((𝐴‘𝑁) · (𝑥↑𝑁))))) ∈ ℝ ∧ (abs‘(𝐹‘𝑥)) ∈ ℝ) → ((((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2) < ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) − (abs‘((𝐹‘𝑥) − ((𝐴‘𝑁) · (𝑥↑𝑁))))) ∧ ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) − (abs‘((𝐹‘𝑥) − ((𝐴‘𝑁) · (𝑥↑𝑁))))) ≤ (abs‘(𝐹‘𝑥))) → ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2) < (abs‘(𝐹‘𝑥))))
109	73, 106, 107, 108	syl3anc 1373	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → ((((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2) < ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) − (abs‘((𝐹‘𝑥) − ((𝐴‘𝑁) · (𝑥↑𝑁))))) ∧ ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) − (abs‘((𝐹‘𝑥) − ((𝐴‘𝑁) · (𝑥↑𝑁))))) ≤ (abs‘(𝐹‘𝑥))) → ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2) < (abs‘(𝐹‘𝑥))))
110	105, 109	mpan2d 694	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2) < ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) − (abs‘((𝐹‘𝑥) − ((𝐴‘𝑁) · (𝑥↑𝑁))))) → ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2) < (abs‘(𝐹‘𝑥))))
111	98, 110	sylbid 240	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → ((abs‘((𝐹‘𝑥) − ((𝐴‘𝑁) · (𝑥↑𝑁)))) < (((abs‘(𝐴‘𝑁)) / 2) · ((abs‘𝑥)↑𝑁)) → ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2) < (abs‘(𝐹‘𝑥))))
112	32	ad2antrr 726	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (abs‘(𝐹‘0)) ∈ ℝ)
113	20	ad2antrr 726	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → ((abs‘(𝐴‘𝑁)) / 2) ∈ ℝ⁺)
114	113	rpred 13001	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → ((abs‘(𝐴‘𝑁)) / 2) ∈ ℝ)
115	114, 82	remulcld 11210	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (((abs‘(𝐴‘𝑁)) / 2) · (abs‘𝑥)) ∈ ℝ)
116	89, 73	eqeltrrd 2830	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (((abs‘(𝐴‘𝑁)) / 2) · ((abs‘𝑥)↑𝑁)) ∈ ℝ)
117	35	adantr 480	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → 𝑇 ∈ ℝ)
118	41	adantr 480	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → 𝑈 ∈ ℝ)
119		max2 13153	. . . . . . . . . . . . . . . . . 18 ⊢ ((if(1 ≤ 𝑠, 𝑠, 1) ∈ ℝ ∧ 𝑇 ∈ ℝ) → 𝑇 ≤ if(if(1 ≤ 𝑠, 𝑠, 1) ≤ 𝑇, 𝑇, if(1 ≤ 𝑠, 𝑠, 1)))
120	39, 35, 119	syl2anc 584	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → 𝑇 ≤ if(if(1 ≤ 𝑠, 𝑠, 1) ≤ 𝑇, 𝑇, if(1 ≤ 𝑠, 𝑠, 1)))
121	120, 25	breqtrrdi 5151	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → 𝑇 ≤ 𝑈)
122	121	adantr 480	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → 𝑇 ≤ 𝑈)
123		simprr 772	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → 𝑈 < (abs‘𝑥))
124	117, 118, 82, 122, 123	lelttrd 11338	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → 𝑇 < (abs‘𝑥))
125	26, 124	eqbrtrrid 5145	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → ((abs‘(𝐹‘0)) / ((abs‘(𝐴‘𝑁)) / 2)) < (abs‘𝑥))
126	112, 82, 113	ltdivmuld 13052	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (((abs‘(𝐹‘0)) / ((abs‘(𝐴‘𝑁)) / 2)) < (abs‘𝑥) ↔ (abs‘(𝐹‘0)) < (((abs‘(𝐴‘𝑁)) / 2) · (abs‘𝑥))))
127	125, 126	mpbid 232	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (abs‘(𝐹‘0)) < (((abs‘(𝐴‘𝑁)) / 2) · (abs‘𝑥)))
128	82	recnd 11208	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (abs‘𝑥) ∈ ℂ)
129	128	exp1d 14112	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → ((abs‘𝑥)↑1) = (abs‘𝑥))
130		1red 11181	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → 1 ∈ ℝ)
131	51	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → 1 ≤ 𝑈)
132	130, 118, 82, 131, 123	lelttrd 11338	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → 1 < (abs‘𝑥))
133	130, 82, 132	ltled 11328	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → 1 ≤ (abs‘𝑥))
134	4	ad2antrr 726	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → 𝑁 ∈ ℕ)
135		nnuz 12842	. . . . . . . . . . . . . . . 16 ⊢ ℕ = (ℤ_≥‘1)
136	134, 135	eleqtrdi 2839	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → 𝑁 ∈ (ℤ_≥‘1))
137	82, 133, 136	leexp2ad 14225	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → ((abs‘𝑥)↑1) ≤ ((abs‘𝑥)↑𝑁))
138	129, 137	eqbrtrrd 5133	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (abs‘𝑥) ≤ ((abs‘𝑥)↑𝑁))
139	82, 83, 113	lemul2d 13045	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → ((abs‘𝑥) ≤ ((abs‘𝑥)↑𝑁) ↔ (((abs‘(𝐴‘𝑁)) / 2) · (abs‘𝑥)) ≤ (((abs‘(𝐴‘𝑁)) / 2) · ((abs‘𝑥)↑𝑁))))
140	138, 139	mpbid 232	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (((abs‘(𝐴‘𝑁)) / 2) · (abs‘𝑥)) ≤ (((abs‘(𝐴‘𝑁)) / 2) · ((abs‘𝑥)↑𝑁)))
141	112, 115, 116, 127, 140	ltletrd 11340	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (abs‘(𝐹‘0)) < (((abs‘(𝐴‘𝑁)) / 2) · ((abs‘𝑥)↑𝑁)))
142	141, 89	breqtrrd 5137	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (abs‘(𝐹‘0)) < ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2))
143		lttr 11256	. . . . . . . . . . 11 ⊢ (((abs‘(𝐹‘0)) ∈ ℝ ∧ ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2) ∈ ℝ ∧ (abs‘(𝐹‘𝑥)) ∈ ℝ) → (((abs‘(𝐹‘0)) < ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2) ∧ ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2) < (abs‘(𝐹‘𝑥))) → (abs‘(𝐹‘0)) < (abs‘(𝐹‘𝑥))))
144	112, 73, 107, 143	syl3anc 1373	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (((abs‘(𝐹‘0)) < ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2) ∧ ((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2) < (abs‘(𝐹‘𝑥))) → (abs‘(𝐹‘0)) < (abs‘(𝐹‘𝑥))))
145	142, 144	mpand 695	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → (((abs‘((𝐴‘𝑁) · (𝑥↑𝑁))) / 2) < (abs‘(𝐹‘𝑥)) → (abs‘(𝐹‘0)) < (abs‘(𝐹‘𝑥))))
146	111, 145	syld 47	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ (𝑥 ∈ ℂ ∧ 𝑈 < (abs‘𝑥))) → ((abs‘((𝐹‘𝑥) − ((𝐴‘𝑁) · (𝑥↑𝑁)))) < (((abs‘(𝐴‘𝑁)) / 2) · ((abs‘𝑥)↑𝑁)) → (abs‘(𝐹‘0)) < (abs‘(𝐹‘𝑥))))
147	146	expr 456	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ 𝑥 ∈ ℂ) → (𝑈 < (abs‘𝑥) → ((abs‘((𝐹‘𝑥) − ((𝐴‘𝑁) · (𝑥↑𝑁)))) < (((abs‘(𝐴‘𝑁)) / 2) · ((abs‘𝑥)↑𝑁)) → (abs‘(𝐹‘0)) < (abs‘(𝐹‘𝑥)))))
148	147	a2d 29	. . . . . 6 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ 𝑥 ∈ ℂ) → ((𝑈 < (abs‘𝑥) → (abs‘((𝐹‘𝑥) − ((𝐴‘𝑁) · (𝑥↑𝑁)))) < (((abs‘(𝐴‘𝑁)) / 2) · ((abs‘𝑥)↑𝑁))) → (𝑈 < (abs‘𝑥) → (abs‘(𝐹‘0)) < (abs‘(𝐹‘𝑥)))))
149	62, 148	syld 47	. . . . 5 ⊢ (((𝜑 ∧ 𝑠 ∈ ℝ) ∧ 𝑥 ∈ ℂ) → ((𝑠 < (abs‘𝑥) → (abs‘((𝐹‘𝑥) − ((𝐴‘𝑁) · (𝑥↑𝑁)))) < (((abs‘(𝐴‘𝑁)) / 2) · ((abs‘𝑥)↑𝑁))) → (𝑈 < (abs‘𝑥) → (abs‘(𝐹‘0)) < (abs‘(𝐹‘𝑥)))))
150	149	ralimdva 3146	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → (∀𝑥 ∈ ℂ (𝑠 < (abs‘𝑥) → (abs‘((𝐹‘𝑥) − ((𝐴‘𝑁) · (𝑥↑𝑁)))) < (((abs‘(𝐴‘𝑁)) / 2) · ((abs‘𝑥)↑𝑁))) → ∀𝑥 ∈ ℂ (𝑈 < (abs‘𝑥) → (abs‘(𝐹‘0)) < (abs‘(𝐹‘𝑥)))))
151		breq1 5112	. . . . 5 ⊢ (𝑟 = 𝑈 → (𝑟 < (abs‘𝑥) ↔ 𝑈 < (abs‘𝑥)))
152	151	rspceaimv 3597	. . . 4 ⊢ ((𝑈 ∈ ℝ⁺ ∧ ∀𝑥 ∈ ℂ (𝑈 < (abs‘𝑥) → (abs‘(𝐹‘0)) < (abs‘(𝐹‘𝑥)))) → ∃𝑟 ∈ ℝ⁺ ∀𝑥 ∈ ℂ (𝑟 < (abs‘𝑥) → (abs‘(𝐹‘0)) < (abs‘(𝐹‘𝑥))))
153	53, 150, 152	syl6an 684	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → (∀𝑥 ∈ ℂ (𝑠 < (abs‘𝑥) → (abs‘((𝐹‘𝑥) − ((𝐴‘𝑁) · (𝑥↑𝑁)))) < (((abs‘(𝐴‘𝑁)) / 2) · ((abs‘𝑥)↑𝑁))) → ∃𝑟 ∈ ℝ⁺ ∀𝑥 ∈ ℂ (𝑟 < (abs‘𝑥) → (abs‘(𝐹‘0)) < (abs‘(𝐹‘𝑥)))))
154	153	rexlimdva 3135	. 2 ⊢ (𝜑 → (∃𝑠 ∈ ℝ ∀𝑥 ∈ ℂ (𝑠 < (abs‘𝑥) → (abs‘((𝐹‘𝑥) − ((𝐴‘𝑁) · (𝑥↑𝑁)))) < (((abs‘(𝐴‘𝑁)) / 2) · ((abs‘𝑥)↑𝑁))) → ∃𝑟 ∈ ℝ⁺ ∀𝑥 ∈ ℂ (𝑟 < (abs‘𝑥) → (abs‘(𝐹‘0)) < (abs‘(𝐹‘𝑥)))))
155	24, 154	mpd 15	1 ⊢ (𝜑 → ∃𝑟 ∈ ℝ⁺ ∀𝑥 ∈ ℂ (𝑟 < (abs‘𝑥) → (abs‘(𝐹‘0)) < (abs‘(𝐹‘𝑥))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ≠ wne 2926 ∀wral 3045 ∃wrex 3054 ifcif 4490 class class class wbr 5109 ⟶wf 6509 ‘cfv 6513 (class class class)co 7389 ℂcc 11072 ℝcr 11073 0cc0 11074 1c1 11075 + caddc 11077 · cmul 11079 < clt 11214 ≤ cle 11215 − cmin 11411 / cdiv 11841 ℕcn 12187 2c2 12242 ℕ₀cn0 12448 ℤ_≥cuz 12799 ℝ⁺crp 12957 ...cfz 13474 ↑cexp 14032 abscabs 15206 Σcsu 15658 0_𝑝c0p 25576 Polycply 26095 coeffccoe 26097 degcdgr 26098

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 2702 ax-rep 5236 ax-sep 5253 ax-nul 5263 ax-pow 5322 ax-pr 5389 ax-un 7713 ax-inf2 9600 ax-cnex 11130 ax-resscn 11131 ax-1cn 11132 ax-icn 11133 ax-addcl 11134 ax-addrcl 11135 ax-mulcl 11136 ax-mulrcl 11137 ax-mulcom 11138 ax-addass 11139 ax-mulass 11140 ax-distr 11141 ax-i2m1 11142 ax-1ne0 11143 ax-1rid 11144 ax-rnegex 11145 ax-rrecex 11146 ax-cnre 11147 ax-pre-lttri 11148 ax-pre-lttrn 11149 ax-pre-ltadd 11150 ax-pre-mulgt0 11151 ax-pre-sup 11152

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 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-rmo 3356 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3756 df-csb 3865 df-dif 3919 df-un 3921 df-in 3923 df-ss 3933 df-pss 3936 df-nul 4299 df-if 4491 df-pw 4567 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-int 4913 df-iun 4959 df-br 5110 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5535 df-eprel 5540 df-po 5548 df-so 5549 df-fr 5593 df-se 5594 df-we 5595 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-pred 6276 df-ord 6337 df-on 6338 df-lim 6339 df-suc 6340 df-iota 6466 df-fun 6515 df-fn 6516 df-f 6517 df-f1 6518 df-fo 6519 df-f1o 6520 df-fv 6521 df-isom 6522 df-riota 7346 df-ov 7392 df-oprab 7393 df-mpo 7394 df-of 7655 df-om 7845 df-1st 7970 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8380 df-1o 8436 df-er 8673 df-map 8803 df-pm 8804 df-en 8921 df-dom 8922 df-sdom 8923 df-fin 8924 df-sup 9399 df-inf 9400 df-oi 9469 df-card 9898 df-pnf 11216 df-mnf 11217 df-xr 11218 df-ltxr 11219 df-le 11220 df-sub 11413 df-neg 11414 df-div 11842 df-nn 12188 df-2 12250 df-3 12251 df-n0 12449 df-z 12536 df-uz 12800 df-rp 12958 df-ico 13318 df-fz 13475 df-fzo 13622 df-fl 13760 df-seq 13973 df-exp 14033 df-hash 14302 df-cj 15071 df-re 15072 df-im 15073 df-sqrt 15207 df-abs 15208 df-clim 15460 df-rlim 15461 df-sum 15659 df-0p 25577 df-ply 26099 df-coe 26101 df-dgr 26102

This theorem is referenced by: fta 26996

W3C validator