| 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 37578. (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 7457 | . . . . . 6 ⊢ (𝑦 = 𝐴 → (((2 · 𝑁)↑𝑛) · 𝑦) = (((2 · 𝑁)↑𝑛) · 𝐴)) | |
| 3 | 2 | fveq2d 6918 | . . . . 5 ⊢ (𝑦 = 𝐴 → (𝑇‘(((2 · 𝑁)↑𝑛) · 𝑦)) = (𝑇‘(((2 · 𝑁)↑𝑛) · 𝐴))) |
| 4 | 3 | oveq2d 7465 | . . . 4 ⊢ (𝑦 = 𝐴 → ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝑦))) = ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝐴)))) |
| 5 | 4 | mpteq2dv 5203 | . . 3 ⊢ (𝑦 = 𝐴 → (𝑛 ∈ ℕ0 ↦ ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝑦)))) = (𝑛 ∈ ℕ0 ↦ ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝐴))))) |
| 6 | knoppcnlem1.2 | . . 3 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
| 7 | nn0ex 12650 | . . . . 5 ⊢ ℕ0 ∈ V | |
| 8 | 7 | mptex 7258 | . . . 4 ⊢ (𝑛 ∈ ℕ0 ↦ ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝐴)))) ∈ V |
| 9 | 8 | a1i 11 | . . 3 ⊢ (𝜑 → (𝑛 ∈ ℕ0 ↦ ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝐴)))) ∈ V) |
| 10 | 1, 5, 6, 9 | fvmptd3 7046 | . 2 ⊢ (𝜑 → (𝐹‘𝐴) = (𝑛 ∈ ℕ0 ↦ ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝐴))))) |
| 11 | oveq2 7457 | . . . 4 ⊢ (𝑛 = 𝑀 → (𝐶↑𝑛) = (𝐶↑𝑀)) | |
| 12 | oveq2 7457 | . . . . 5 ⊢ (𝑛 = 𝑀 → ((2 · 𝑁)↑𝑛) = ((2 · 𝑁)↑𝑀)) | |
| 13 | 12 | fvoveq1d 7471 | . . . 4 ⊢ (𝑛 = 𝑀 → (𝑇‘(((2 · 𝑁)↑𝑛) · 𝐴)) = (𝑇‘(((2 · 𝑁)↑𝑀) · 𝐴))) |
| 14 | 11, 13 | oveq12d 7467 | . . 3 ⊢ (𝑛 = 𝑀 → ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝐴))) = ((𝐶↑𝑀) · (𝑇‘(((2 · 𝑁)↑𝑀) · 𝐴)))) |
| 15 | 14 | adantl 487 | . 2 ⊢ ((𝜑 ∧ 𝑛 = 𝑀) → ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝐴))) = ((𝐶↑𝑀) · (𝑇‘(((2 · 𝑁)↑𝑀) · 𝐴)))) |
| 16 | knoppcnlem1.3 | . 2 ⊢ (𝜑 → 𝑀 ∈ ℕ0) | |
| 17 | ovexd 7484 | . 2 ⊢ (𝜑 → ((𝐶↑𝑀) · (𝑇‘(((2 · 𝑁)↑𝑀) · 𝐴))) ∈ V) | |
| 18 | 10, 15, 16, 17 | fvmptd 7030 | 1 ⊢ (𝜑 → ((𝐹‘𝐴)‘𝑀) = ((𝐶↑𝑀) · (𝑇‘(((2 · 𝑁)↑𝑀) · 𝐴)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 Vcvv 3454 ↦ cmpt 5190 ‘cfv 6564 (class class class)co 7449 ℝcr 11236 · cmul 11242 2c2 12435 ℕ0cn0 12644 ↑cexp 14242 |
| 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-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5236 ax-sep 5253 ax-nul 5264 ax-pr 5396 ax-un 7781 ax-cnex 11293 ax-1cn 11295 ax-addcl 11297 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5551 df-eprel 5556 df-po 5564 df-so 5565 df-fr 5609 df-we 5611 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-pred 6328 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6518 df-fun 6566 df-fn 6567 df-f 6568 df-f1 6569 df-fo 6570 df-f1o 6571 df-fv 6572 df-ov 7452 df-om 7910 df-2nd 8034 df-frecs 8335 df-wrecs 8366 df-recs 8415 df-rdg 8454 df-nn 12374 df-n0 12645 |
| This theorem is used by: knoppcnlem3 37569 knoppcnlem4 37570 knoppcnlem10 37576 knoppndvlem6 37591 knoppndvlem7 37592 knoppndvlem11 37596 |
| Copyright terms: Public domain | W3C validator |