Theorem abelthlem7a 26821

Description: Lemma for abelth 26825. (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 4054	. 2 ⊢ (𝜑 → 𝑋 ∈ 𝑆)
3		oveq2 7459	. . . . 5 ⊢ (𝑧 = 𝑋 → (1 − 𝑧) = (1 − 𝑋))
4	3	fveq2d 6920	. . . 4 ⊢ (𝑧 = 𝑋 → (abs‘(1 − 𝑧)) = (abs‘(1 − 𝑋)))
5		fveq2 6916	. . . . . 6 ⊢ (𝑧 = 𝑋 → (abs‘𝑧) = (abs‘𝑋))
6	5	oveq2d 7467	. . . . 5 ⊢ (𝑧 = 𝑋 → (1 − (abs‘𝑧)) = (1 − (abs‘𝑋)))
7	6	oveq2d 7467	. . . 4 ⊢ (𝑧 = 𝑋 → (𝑀 · (1 − (abs‘𝑧))) = (𝑀 · (1 − (abs‘𝑋))))
8	4, 7	breq12d 5121	. . 3 ⊢ (𝑧 = 𝑋 → ((abs‘(1 − 𝑧)) ≤ (𝑀 · (1 − (abs‘𝑧))) ↔ (abs‘(1 − 𝑋)) ≤ (𝑀 · (1 − (abs‘𝑋)))))
9		abelth.5	. . 3 ⊢ 𝑆 = {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (𝑀 · (1 − (abs‘𝑧)))}
10	8, 9	elrab2 3652	. 2 ⊢ (𝑋 ∈ 𝑆 ↔ (𝑋 ∈ ℂ ∧ (abs‘(1 − 𝑋)) ≤ (𝑀 · (1 − (abs‘𝑋)))))
11	2, 10	sylib 221	1 ⊢ (𝜑 → (𝑋 ∈ ℂ ∧ (abs‘(1 − 𝑋)) ≤ (𝑀 · (1 − (abs‘𝑋)))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {crab 3416   ∖ cdif 4048  {csn 4588   class class class wbr 5108   ↦ cmpt 5192  dom cdm 5658  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451  ℂcc 11237  ℝcr 11238  0cc0 11239  1c1 11240   + caddc 11242   · cmul 11244   ≤ cle 11383   − cmin 11580  ℕ₀cn0 12646  seqcseq 14184  ↑cexp 14244  abscabs 15444   ⇝ cli 15695  Σcsu 15897

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-iota 6520  df-fv 6574  df-ov 7454

This theorem is used by:  abelthlem7  26822