|   | 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 36505. (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 7439 | . . . . . 6 ⊢ (𝑦 = 𝐴 → (((2 · 𝑁)↑𝑛) · 𝑦) = (((2 · 𝑁)↑𝑛) · 𝐴)) | |
| 3 | 2 | fveq2d 6910 | . . . . 5 ⊢ (𝑦 = 𝐴 → (𝑇‘(((2 · 𝑁)↑𝑛) · 𝑦)) = (𝑇‘(((2 · 𝑁)↑𝑛) · 𝐴))) | 
| 4 | 3 | oveq2d 7447 | . . . 4 ⊢ (𝑦 = 𝐴 → ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝑦))) = ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝐴)))) | 
| 5 | 4 | mpteq2dv 5244 | . . 3 ⊢ (𝑦 = 𝐴 → (𝑛 ∈ ℕ0 ↦ ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝑦)))) = (𝑛 ∈ ℕ0 ↦ ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝐴))))) | 
| 6 | knoppcnlem1.2 | . . 3 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
| 7 | nn0ex 12532 | . . . . 5 ⊢ ℕ0 ∈ V | |
| 8 | 7 | mptex 7243 | . . . 4 ⊢ (𝑛 ∈ ℕ0 ↦ ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝐴)))) ∈ V | 
| 9 | 8 | a1i 11 | . . 3 ⊢ (𝜑 → (𝑛 ∈ ℕ0 ↦ ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝐴)))) ∈ V) | 
| 10 | 1, 5, 6, 9 | fvmptd3 7039 | . 2 ⊢ (𝜑 → (𝐹‘𝐴) = (𝑛 ∈ ℕ0 ↦ ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝐴))))) | 
| 11 | oveq2 7439 | . . . 4 ⊢ (𝑛 = 𝑀 → (𝐶↑𝑛) = (𝐶↑𝑀)) | |
| 12 | oveq2 7439 | . . . . 5 ⊢ (𝑛 = 𝑀 → ((2 · 𝑁)↑𝑛) = ((2 · 𝑁)↑𝑀)) | |
| 13 | 12 | fvoveq1d 7453 | . . . 4 ⊢ (𝑛 = 𝑀 → (𝑇‘(((2 · 𝑁)↑𝑛) · 𝐴)) = (𝑇‘(((2 · 𝑁)↑𝑀) · 𝐴))) | 
| 14 | 11, 13 | oveq12d 7449 | . . 3 ⊢ (𝑛 = 𝑀 → ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝐴))) = ((𝐶↑𝑀) · (𝑇‘(((2 · 𝑁)↑𝑀) · 𝐴)))) | 
| 15 | 14 | adantl 481 | . 2 ⊢ ((𝜑 ∧ 𝑛 = 𝑀) → ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝐴))) = ((𝐶↑𝑀) · (𝑇‘(((2 · 𝑁)↑𝑀) · 𝐴)))) | 
| 16 | knoppcnlem1.3 | . 2 ⊢ (𝜑 → 𝑀 ∈ ℕ0) | |
| 17 | ovexd 7466 | . 2 ⊢ (𝜑 → ((𝐶↑𝑀) · (𝑇‘(((2 · 𝑁)↑𝑀) · 𝐴))) ∈ V) | |
| 18 | 10, 15, 16, 17 | fvmptd 7023 | 1 ⊢ (𝜑 → ((𝐹‘𝐴)‘𝑀) = ((𝐶↑𝑀) · (𝑇‘(((2 · 𝑁)↑𝑀) · 𝐴)))) | 
| Colors of variables: wff setvar class | 
| Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2108 Vcvv 3480 ↦ cmpt 5225 ‘cfv 6561 (class class class)co 7431 ℝcr 11154 · cmul 11160 2c2 12321 ℕ0cn0 12526 ↑cexp 14102 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-rep 5279 ax-sep 5296 ax-nul 5306 ax-pr 5432 ax-un 7755 ax-cnex 11211 ax-1cn 11213 ax-addcl 11215 | 
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-ral 3062 df-rex 3071 df-reu 3381 df-rab 3437 df-v 3482 df-sbc 3789 df-csb 3900 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-pss 3971 df-nul 4334 df-if 4526 df-pw 4602 df-sn 4627 df-pr 4629 df-op 4633 df-uni 4908 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5226 df-tr 5260 df-id 5578 df-eprel 5584 df-po 5592 df-so 5593 df-fr 5637 df-we 5639 df-xp 5691 df-rel 5692 df-cnv 5693 df-co 5694 df-dm 5695 df-rn 5696 df-res 5697 df-ima 5698 df-pred 6321 df-ord 6387 df-on 6388 df-lim 6389 df-suc 6390 df-iota 6514 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-ov 7434 df-om 7888 df-2nd 8015 df-frecs 8306 df-wrecs 8337 df-recs 8411 df-rdg 8450 df-nn 12267 df-n0 12527 | 
| This theorem is referenced by: knoppcnlem3 36496 knoppcnlem4 36497 knoppcnlem10 36503 knoppndvlem6 36518 knoppndvlem7 36519 knoppndvlem11 36523 | 
| Copyright terms: Public domain | W3C validator |