| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > mulc1cncfg | Structured version Visualization version GIF version | ||
| Description: A version of mulc1cncf 24854 using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Glauco Siliprandi, 30-Jun-2017.) |
| Ref | Expression |
|---|---|
| mulc1cncfg.1 | ⊢ Ⅎ𝑥𝐹 |
| mulc1cncfg.2 | ⊢ Ⅎ𝑥𝜑 |
| mulc1cncfg.3 | ⊢ (𝜑 → 𝐹 ∈ (𝐴–cn→ℂ)) |
| mulc1cncfg.4 | ⊢ (𝜑 → 𝐵 ∈ ℂ) |
| Ref | Expression |
|---|---|
| mulc1cncfg | ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐵 · (𝐹‘𝑥))) ∈ (𝐴–cn→ℂ)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mulc1cncfg.4 | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ ℂ) | |
| 2 | eqid 2736 | . . . . . . 7 ⊢ (𝑥 ∈ ℂ ↦ (𝐵 · 𝑥)) = (𝑥 ∈ ℂ ↦ (𝐵 · 𝑥)) | |
| 3 | 2 | mulc1cncf 24854 | . . . . . 6 ⊢ (𝐵 ∈ ℂ → (𝑥 ∈ ℂ ↦ (𝐵 · 𝑥)) ∈ (ℂ–cn→ℂ)) |
| 4 | 1, 3 | syl 17 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ ℂ ↦ (𝐵 · 𝑥)) ∈ (ℂ–cn→ℂ)) |
| 5 | cncff 24842 | . . . . 5 ⊢ ((𝑥 ∈ ℂ ↦ (𝐵 · 𝑥)) ∈ (ℂ–cn→ℂ) → (𝑥 ∈ ℂ ↦ (𝐵 · 𝑥)):ℂ⟶ℂ) | |
| 6 | 4, 5 | syl 17 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ ℂ ↦ (𝐵 · 𝑥)):ℂ⟶ℂ) |
| 7 | mulc1cncfg.3 | . . . . 5 ⊢ (𝜑 → 𝐹 ∈ (𝐴–cn→ℂ)) | |
| 8 | cncff 24842 | . . . . 5 ⊢ (𝐹 ∈ (𝐴–cn→ℂ) → 𝐹:𝐴⟶ℂ) | |
| 9 | 7, 8 | syl 17 | . . . 4 ⊢ (𝜑 → 𝐹:𝐴⟶ℂ) |
| 10 | fcompt 7078 | . . . 4 ⊢ (((𝑥 ∈ ℂ ↦ (𝐵 · 𝑥)):ℂ⟶ℂ ∧ 𝐹:𝐴⟶ℂ) → ((𝑥 ∈ ℂ ↦ (𝐵 · 𝑥)) ∘ 𝐹) = (𝑡 ∈ 𝐴 ↦ ((𝑥 ∈ ℂ ↦ (𝐵 · 𝑥))‘(𝐹‘𝑡)))) | |
| 11 | 6, 9, 10 | syl2anc 584 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ ℂ ↦ (𝐵 · 𝑥)) ∘ 𝐹) = (𝑡 ∈ 𝐴 ↦ ((𝑥 ∈ ℂ ↦ (𝐵 · 𝑥))‘(𝐹‘𝑡)))) |
| 12 | 9 | ffvelcdmda 7029 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝐴) → (𝐹‘𝑡) ∈ ℂ) |
| 13 | 1 | adantr 480 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝐴) → 𝐵 ∈ ℂ) |
| 14 | 13, 12 | mulcld 11152 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝐴) → (𝐵 · (𝐹‘𝑡)) ∈ ℂ) |
| 15 | mulc1cncfg.1 | . . . . . . . 8 ⊢ Ⅎ𝑥𝐹 | |
| 16 | nfcv 2898 | . . . . . . . 8 ⊢ Ⅎ𝑥𝑡 | |
| 17 | 15, 16 | nffv 6844 | . . . . . . 7 ⊢ Ⅎ𝑥(𝐹‘𝑡) |
| 18 | nfcv 2898 | . . . . . . . 8 ⊢ Ⅎ𝑥𝐵 | |
| 19 | nfcv 2898 | . . . . . . . 8 ⊢ Ⅎ𝑥 · | |
| 20 | 18, 19, 17 | nfov 7388 | . . . . . . 7 ⊢ Ⅎ𝑥(𝐵 · (𝐹‘𝑡)) |
| 21 | oveq2 7366 | . . . . . . 7 ⊢ (𝑥 = (𝐹‘𝑡) → (𝐵 · 𝑥) = (𝐵 · (𝐹‘𝑡))) | |
| 22 | 17, 20, 21, 2 | fvmptf 6962 | . . . . . 6 ⊢ (((𝐹‘𝑡) ∈ ℂ ∧ (𝐵 · (𝐹‘𝑡)) ∈ ℂ) → ((𝑥 ∈ ℂ ↦ (𝐵 · 𝑥))‘(𝐹‘𝑡)) = (𝐵 · (𝐹‘𝑡))) |
| 23 | 12, 14, 22 | syl2anc 584 | . . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝐴) → ((𝑥 ∈ ℂ ↦ (𝐵 · 𝑥))‘(𝐹‘𝑡)) = (𝐵 · (𝐹‘𝑡))) |
| 24 | 23 | mpteq2dva 5191 | . . . 4 ⊢ (𝜑 → (𝑡 ∈ 𝐴 ↦ ((𝑥 ∈ ℂ ↦ (𝐵 · 𝑥))‘(𝐹‘𝑡))) = (𝑡 ∈ 𝐴 ↦ (𝐵 · (𝐹‘𝑡)))) |
| 25 | nfcv 2898 | . . . . . 6 ⊢ Ⅎ𝑡𝐵 | |
| 26 | nfcv 2898 | . . . . . 6 ⊢ Ⅎ𝑡 · | |
| 27 | nfcv 2898 | . . . . . 6 ⊢ Ⅎ𝑡(𝐹‘𝑥) | |
| 28 | 25, 26, 27 | nfov 7388 | . . . . 5 ⊢ Ⅎ𝑡(𝐵 · (𝐹‘𝑥)) |
| 29 | fveq2 6834 | . . . . . 6 ⊢ (𝑡 = 𝑥 → (𝐹‘𝑡) = (𝐹‘𝑥)) | |
| 30 | 29 | oveq2d 7374 | . . . . 5 ⊢ (𝑡 = 𝑥 → (𝐵 · (𝐹‘𝑡)) = (𝐵 · (𝐹‘𝑥))) |
| 31 | 20, 28, 30 | cbvmpt 5200 | . . . 4 ⊢ (𝑡 ∈ 𝐴 ↦ (𝐵 · (𝐹‘𝑡))) = (𝑥 ∈ 𝐴 ↦ (𝐵 · (𝐹‘𝑥))) |
| 32 | 24, 31 | eqtrdi 2787 | . . 3 ⊢ (𝜑 → (𝑡 ∈ 𝐴 ↦ ((𝑥 ∈ ℂ ↦ (𝐵 · 𝑥))‘(𝐹‘𝑡))) = (𝑥 ∈ 𝐴 ↦ (𝐵 · (𝐹‘𝑥)))) |
| 33 | 11, 32 | eqtrd 2771 | . 2 ⊢ (𝜑 → ((𝑥 ∈ ℂ ↦ (𝐵 · 𝑥)) ∘ 𝐹) = (𝑥 ∈ 𝐴 ↦ (𝐵 · (𝐹‘𝑥)))) |
| 34 | 7, 4 | cncfco 24856 | . 2 ⊢ (𝜑 → ((𝑥 ∈ ℂ ↦ (𝐵 · 𝑥)) ∘ 𝐹) ∈ (𝐴–cn→ℂ)) |
| 35 | 33, 34 | eqeltrrd 2837 | 1 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐵 · (𝐹‘𝑥))) ∈ (𝐴–cn→ℂ)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 Ⅎwnf 1784 ∈ wcel 2113 Ⅎwnfc 2883 ↦ cmpt 5179 ∘ ccom 5628 ⟶wf 6488 ‘cfv 6492 (class class class)co 7358 ℂcc 11024 · cmul 11031 –cn→ccncf 24825 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 ax-pre-sup 11104 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-er 8635 df-map 8765 df-en 8884 df-dom 8885 df-sdom 8886 df-sup 9345 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-div 11795 df-nn 12146 df-2 12208 df-3 12209 df-n0 12402 df-z 12489 df-uz 12752 df-rp 12906 df-seq 13925 df-exp 13985 df-cj 15022 df-re 15023 df-im 15024 df-sqrt 15158 df-abs 15159 df-cncf 24827 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |