| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > abelthlem7a | Structured version Visualization version GIF version | ||
| Description: Lemma for abelth 26419. (Contributed by Mario Carneiro, 8-May-2015.) |
| 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})) |
| Ref | Expression |
|---|---|
| abelthlem7a | ⊢ (𝜑 → (𝑋 ∈ ℂ ∧ (abs‘(1 − 𝑋)) ≤ (𝑀 · (1 − (abs‘𝑋))))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | abelthlem6.1 | . . 3 ⊢ (𝜑 → 𝑋 ∈ (𝑆 ∖ {1})) | |
| 2 | 1 | eldifad 3915 | . 2 ⊢ (𝜑 → 𝑋 ∈ 𝑆) |
| 3 | oveq2 7376 | . . . . 5 ⊢ (𝑧 = 𝑋 → (1 − 𝑧) = (1 − 𝑋)) | |
| 4 | 3 | fveq2d 6846 | . . . 4 ⊢ (𝑧 = 𝑋 → (abs‘(1 − 𝑧)) = (abs‘(1 − 𝑋))) |
| 5 | fveq2 6842 | . . . . . 6 ⊢ (𝑧 = 𝑋 → (abs‘𝑧) = (abs‘𝑋)) | |
| 6 | 5 | oveq2d 7384 | . . . . 5 ⊢ (𝑧 = 𝑋 → (1 − (abs‘𝑧)) = (1 − (abs‘𝑋))) |
| 7 | 6 | oveq2d 7384 | . . . 4 ⊢ (𝑧 = 𝑋 → (𝑀 · (1 − (abs‘𝑧))) = (𝑀 · (1 − (abs‘𝑋)))) |
| 8 | 4, 7 | breq12d 5113 | . . 3 ⊢ (𝑧 = 𝑋 → ((abs‘(1 − 𝑧)) ≤ (𝑀 · (1 − (abs‘𝑧))) ↔ (abs‘(1 − 𝑋)) ≤ (𝑀 · (1 − (abs‘𝑋))))) |
| 9 | abelth.5 | . . 3 ⊢ 𝑆 = {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (𝑀 · (1 − (abs‘𝑧)))} | |
| 10 | 8, 9 | elrab2 3651 | . 2 ⊢ (𝑋 ∈ 𝑆 ↔ (𝑋 ∈ ℂ ∧ (abs‘(1 − 𝑋)) ≤ (𝑀 · (1 − (abs‘𝑋))))) |
| 11 | 2, 10 | sylib 218 | 1 ⊢ (𝜑 → (𝑋 ∈ ℂ ∧ (abs‘(1 − 𝑋)) ≤ (𝑀 · (1 − (abs‘𝑋))))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 {crab 3401 ∖ cdif 3900 {csn 4582 class class class wbr 5100 ↦ cmpt 5181 dom cdm 5632 ⟶wf 6496 ‘cfv 6500 (class class class)co 7368 ℂcc 11036 ℝcr 11037 0cc0 11038 1c1 11039 + caddc 11041 · cmul 11043 ≤ cle 11179 − cmin 11376 ℕ0cn0 12413 seqcseq 13936 ↑cexp 13996 abscabs 15169 ⇝ cli 15419 Σcsu 15621 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-iota 6456 df-fv 6508 df-ov 7371 |
| This theorem is referenced by: abelthlem7 26416 |
| Copyright terms: Public domain | W3C validator |