Theorem abelthlem7a 24191

Description: Lemma for abelth 24195. (Contributed by Mario Carneiro, 8-May-2015.)

Hypotheses

Ref	Expression
abelth.1	⊢ (𝜑 → 𝐴:ℕ0⟶ℂ)
abelth.2	⊢ (𝜑 → seq0( + , 𝐴) ∈ dom ⇝ )
abelth.3	⊢ (𝜑 → 𝑀 ∈ ℝ)
abelth.4	⊢ (𝜑 → 0 ≤ 𝑀)
abelth.5	⊢ 𝑆 = {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (𝑀 · (1 − (abs‘𝑧)))}
abelth.6	⊢ 𝐹 = (𝑥 ∈ 𝑆 ↦ Σ𝑛 ∈ ℕ0 ((𝐴‘𝑛) · (𝑥↑𝑛)))
abelth.7	⊢ (𝜑 → seq0( + , 𝐴) ⇝ 0)
abelthlem6.1	⊢ (𝜑 → 𝑋 ∈ (𝑆 ∖ {1}))

Assertion

Ref	Expression
abelthlem7a	⊢ (𝜑 → (𝑋 ∈ ℂ ∧ (abs‘(1 − 𝑋)) ≤ (𝑀 · (1 − (abs‘𝑋)))))

Distinct variable groups:   𝑥,𝑛,𝑧,𝑀   𝑛,𝑋,𝑥,𝑧   𝐴,𝑛,𝑥,𝑧   𝜑,𝑛,𝑥   𝑆,𝑛,𝑥

Allowed substitution hints:   𝜑(𝑧)   𝑆(𝑧)   𝐹(𝑥,𝑧,𝑛)

Proof of Theorem abelthlem7a

Step	Hyp	Ref	Expression
1		abelthlem6.1	. . 3 ⊢ (𝜑 → 𝑋 ∈ (𝑆 ∖ {1}))
2	1	eldifad 3586	. 2 ⊢ (𝜑 → 𝑋 ∈ 𝑆)
3		oveq2 6658	. . . . 5 ⊢ (𝑧 = 𝑋 → (1 − 𝑧) = (1 − 𝑋))
4	3	fveq2d 6195	. . . 4 ⊢ (𝑧 = 𝑋 → (abs‘(1 − 𝑧)) = (abs‘(1 − 𝑋)))
5		fveq2 6191	. . . . . 6 ⊢ (𝑧 = 𝑋 → (abs‘𝑧) = (abs‘𝑋))
6	5	oveq2d 6666	. . . . 5 ⊢ (𝑧 = 𝑋 → (1 − (abs‘𝑧)) = (1 − (abs‘𝑋)))
7	6	oveq2d 6666	. . . 4 ⊢ (𝑧 = 𝑋 → (𝑀 · (1 − (abs‘𝑧))) = (𝑀 · (1 − (abs‘𝑋))))
8	4, 7	breq12d 4666	. . 3 ⊢ (𝑧 = 𝑋 → ((abs‘(1 − 𝑧)) ≤ (𝑀 · (1 − (abs‘𝑧))) ↔ (abs‘(1 − 𝑋)) ≤ (𝑀 · (1 − (abs‘𝑋)))))
9		abelth.5	. . 3 ⊢ 𝑆 = {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (𝑀 · (1 − (abs‘𝑧)))}
10	8, 9	elrab2 3366	. 2 ⊢ (𝑋 ∈ 𝑆 ↔ (𝑋 ∈ ℂ ∧ (abs‘(1 − 𝑋)) ≤ (𝑀 · (1 − (abs‘𝑋)))))
11	2, 10	sylib 208	1 ⊢ (𝜑 → (𝑋 ∈ ℂ ∧ (abs‘(1 − 𝑋)) ≤ (𝑀 · (1 − (abs‘𝑋)))))

Syntax hints:   → wi 4   ∧ wa 384   = wceq 1483   ∈ wcel 1990  {crab 2916   ∖ cdif 3571  {csn 4177   class class class wbr 4653   ↦ cmpt 4729  dom cdm 5114  ⟶wf 5884  ‘cfv 5888  (class class class)co 6650  ℂcc 9934  ℝcr 9935  0cc0 9936  1c1 9937   + caddc 9939   · cmul 9941   ≤ cle 10075   − cmin 10266  ℕ₀cn0 11292  seqcseq 12801  ↑cexp 12860  abscabs 13974   ⇝ cli 14215  Σcsu 14416

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-iota 5851  df-fv 5896  df-ov 6653

This theorem is referenced by:  abelthlem7  24192