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

Theorem abelthlem7a 26499
Description: Lemma for abelth 26503. (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
StepHypRef Expression
1 abelthlem6.1 . . 3 (𝜑𝑋 ∈ (𝑆 ∖ {1}))
21eldifad 3988 . 2 (𝜑𝑋𝑆)
3 oveq2 7456 . . . . 5 (𝑧 = 𝑋 → (1 − 𝑧) = (1 − 𝑋))
43fveq2d 6924 . . . 4 (𝑧 = 𝑋 → (abs‘(1 − 𝑧)) = (abs‘(1 − 𝑋)))
5 fveq2 6920 . . . . . 6 (𝑧 = 𝑋 → (abs‘𝑧) = (abs‘𝑋))
65oveq2d 7464 . . . . 5 (𝑧 = 𝑋 → (1 − (abs‘𝑧)) = (1 − (abs‘𝑋)))
76oveq2d 7464 . . . 4 (𝑧 = 𝑋 → (𝑀 · (1 − (abs‘𝑧))) = (𝑀 · (1 − (abs‘𝑋))))
84, 7breq12d 5179 . . 3 (𝑧 = 𝑋 → ((abs‘(1 − 𝑧)) ≤ (𝑀 · (1 − (abs‘𝑧))) ↔ (abs‘(1 − 𝑋)) ≤ (𝑀 · (1 − (abs‘𝑋)))))
9 abelth.5 . . 3 𝑆 = {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (𝑀 · (1 − (abs‘𝑧)))}
108, 9elrab2 3711 . 2 (𝑋𝑆 ↔ (𝑋 ∈ ℂ ∧ (abs‘(1 − 𝑋)) ≤ (𝑀 · (1 − (abs‘𝑋)))))
112, 10sylib 218 1 (𝜑 → (𝑋 ∈ ℂ ∧ (abs‘(1 − 𝑋)) ≤ (𝑀 · (1 − (abs‘𝑋)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1537  wcel 2108  {crab 3443  cdif 3973  {csn 4648   class class class wbr 5166  cmpt 5249  dom cdm 5700  wf 6569  cfv 6573  (class class class)co 7448  cc 11182  cr 11183  0cc0 11184  1c1 11185   + caddc 11187   · cmul 11189  cle 11325  cmin 11520  0cn0 12553  seqcseq 14052  cexp 14112  abscabs 15283  cli 15530  Σcsu 15734
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-iota 6525  df-fv 6581  df-ov 7451
This theorem is referenced by:  abelthlem7  26500
  Copyright terms: Public domain W3C validator