| Mathbox for Asger C. Ipsen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > knoppcnlem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for knoppcn 37350. (Contributed by Asger C. Ipsen, 4-Apr-2021.) |
| Ref | Expression |
|---|---|
| knoppcnlem1.f | ⊢ 𝐹 = (𝑦 ∈ ℝ ↦ (𝑛 ∈ ℕ0 ↦ ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝑦))))) |
| knoppcnlem1.2 | ⊢ (𝜑 → 𝐴 ∈ ℝ) |
| knoppcnlem1.3 | ⊢ (𝜑 → 𝑀 ∈ ℕ0) |
| Ref | Expression |
|---|---|
| knoppcnlem1 | ⊢ (𝜑 → ((𝐹‘𝐴)‘𝑀) = ((𝐶↑𝑀) · (𝑇‘(((2 · 𝑁)↑𝑀) · 𝐴)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | knoppcnlem1.f | . . 3 ⊢ 𝐹 = (𝑦 ∈ ℝ ↦ (𝑛 ∈ ℕ0 ↦ ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝑦))))) | |
| 2 | oveq2 7426 | . . . . . 6 ⊢ (𝑦 = 𝐴 → (((2 · 𝑁)↑𝑛) · 𝑦) = (((2 · 𝑁)↑𝑛) · 𝐴)) | |
| 3 | 2 | fveq2d 6887 | . . . . 5 ⊢ (𝑦 = 𝐴 → (𝑇‘(((2 · 𝑁)↑𝑛) · 𝑦)) = (𝑇‘(((2 · 𝑁)↑𝑛) · 𝐴))) |
| 4 | 3 | oveq2d 7434 | . . . 4 ⊢ (𝑦 = 𝐴 → ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝑦))) = ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝐴)))) |
| 5 | 4 | mpteq2dv 5199 | . . 3 ⊢ (𝑦 = 𝐴 → (𝑛 ∈ ℕ0 ↦ ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝑦)))) = (𝑛 ∈ ℕ0 ↦ ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝐴))))) |
| 6 | knoppcnlem1.2 | . . 3 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
| 7 | nn0ex 12605 | . . . . 5 ⊢ ℕ0 ∈ V | |
| 8 | 7 | mptex 7227 | . . . 4 ⊢ (𝑛 ∈ ℕ0 ↦ ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝐴)))) ∈ V |
| 9 | 8 | a1i 11 | . . 3 ⊢ (𝜑 → (𝑛 ∈ ℕ0 ↦ ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝐴)))) ∈ V) |
| 10 | 1, 5, 6, 9 | fvmptd3 7015 | . 2 ⊢ (𝜑 → (𝐹‘𝐴) = (𝑛 ∈ ℕ0 ↦ ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝐴))))) |
| 11 | oveq2 7426 | . . . 4 ⊢ (𝑛 = 𝑀 → (𝐶↑𝑛) = (𝐶↑𝑀)) | |
| 12 | oveq2 7426 | . . . . 5 ⊢ (𝑛 = 𝑀 → ((2 · 𝑁)↑𝑛) = ((2 · 𝑁)↑𝑀)) | |
| 13 | 12 | fvoveq1d 7440 | . . . 4 ⊢ (𝑛 = 𝑀 → (𝑇‘(((2 · 𝑁)↑𝑛) · 𝐴)) = (𝑇‘(((2 · 𝑁)↑𝑀) · 𝐴))) |
| 14 | 11, 13 | oveq12d 7436 | . . 3 ⊢ (𝑛 = 𝑀 → ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝐴))) = ((𝐶↑𝑀) · (𝑇‘(((2 · 𝑁)↑𝑀) · 𝐴)))) |
| 15 | 14 | adantl 487 | . 2 ⊢ ((𝜑 ∧ 𝑛 = 𝑀) → ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝐴))) = ((𝐶↑𝑀) · (𝑇‘(((2 · 𝑁)↑𝑀) · 𝐴)))) |
| 16 | knoppcnlem1.3 | . 2 ⊢ (𝜑 → 𝑀 ∈ ℕ0) | |
| 17 | ovexd 7453 | . 2 ⊢ (𝜑 → ((𝐶↑𝑀) · (𝑇‘(((2 · 𝑁)↑𝑀) · 𝐴))) ∈ V) | |
| 18 | 10, 15, 16, 17 | fvmptd 6999 | 1 ⊢ (𝜑 → ((𝐹‘𝐴)‘𝑀) = ((𝐶↑𝑀) · (𝑇‘(((2 · 𝑁)↑𝑀) · 𝐴)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 Vcvv 3451 ↦ cmpt 5186 ‘cfv 6537 (class class class)co 7418 ℝcr 11192 · cmul 11198 2c2 12390 ℕ0cn0 12599 ↑cexp 14197 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pr 5391 ax-un 7749 ax-cnex 11249 ax-1cn 11251 ax-addcl 11253 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7421 df-om 7876 df-2nd 8000 df-frecs 8292 df-wrecs 8323 df-recs 8372 df-rdg 8411 df-nn 12329 df-n0 12600 |
| This theorem is used by: knoppcnlem3 37341 knoppcnlem4 37342 knoppcnlem10 37348 knoppndvlem6 37363 knoppndvlem7 37364 knoppndvlem11 37368 |
| Copyright terms: Public domain | W3C validator |