| 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 24872 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 24872 | . . . . . 6 ⊢ (𝐵 ∈ ℂ → (𝑥 ∈ ℂ ↦ (𝐵 · 𝑥)) ∈ (ℂ–cn→ℂ)) |
| 4 | 1, 3 | syl 17 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ ℂ ↦ (𝐵 · 𝑥)) ∈ (ℂ–cn→ℂ)) |
| 5 | cncff 24860 | . . . . 5 ⊢ ((𝑥 ∈ ℂ ↦ (𝐵 · 𝑥)) ∈ (ℂ–cn→ℂ) → (𝑥 ∈ ℂ ↦ (𝐵 · 𝑥)):ℂ⟶ℂ) | |
| 6 | 4, 5 | syl 17 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ ℂ ↦ (𝐵 · 𝑥)):ℂ⟶ℂ) |
| 7 | mulc1cncfg.3 | . . . . 5 ⊢ (𝜑 → 𝐹 ∈ (𝐴–cn→ℂ)) | |
| 8 | cncff 24860 | . . . . 5 ⊢ (𝐹 ∈ (𝐴–cn→ℂ) → 𝐹:𝐴⟶ℂ) | |
| 9 | 7, 8 | syl 17 | . . . 4 ⊢ (𝜑 → 𝐹:𝐴⟶ℂ) |
| 10 | fcompt 7086 | . . . 4 ⊢ (((𝑥 ∈ ℂ ↦ (𝐵 · 𝑥)):ℂ⟶ℂ ∧ 𝐹:𝐴⟶ℂ) → ((𝑥 ∈ ℂ ↦ (𝐵 · 𝑥)) ∘ 𝐹) = (𝑡 ∈ 𝐴 ↦ ((𝑥 ∈ ℂ ↦ (𝐵 · 𝑥))‘(𝐹‘𝑡)))) | |
| 11 | 6, 9, 10 | syl2anc 585 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ ℂ ↦ (𝐵 · 𝑥)) ∘ 𝐹) = (𝑡 ∈ 𝐴 ↦ ((𝑥 ∈ ℂ ↦ (𝐵 · 𝑥))‘(𝐹‘𝑡)))) |
| 12 | 9 | ffvelcdmda 7036 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝐴) → (𝐹‘𝑡) ∈ ℂ) |
| 13 | 1 | adantr 480 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝐴) → 𝐵 ∈ ℂ) |
| 14 | 13, 12 | mulcld 11165 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝐴) → (𝐵 · (𝐹‘𝑡)) ∈ ℂ) |
| 15 | mulc1cncfg.1 | . . . . . . . 8 ⊢ Ⅎ𝑥𝐹 | |
| 16 | nfcv 2898 | . . . . . . . 8 ⊢ Ⅎ𝑥𝑡 | |
| 17 | 15, 16 | nffv 6850 | . . . . . . 7 ⊢ Ⅎ𝑥(𝐹‘𝑡) |
| 18 | nfcv 2898 | . . . . . . . 8 ⊢ Ⅎ𝑥𝐵 | |
| 19 | nfcv 2898 | . . . . . . . 8 ⊢ Ⅎ𝑥 · | |
| 20 | 18, 19, 17 | nfov 7397 | . . . . . . 7 ⊢ Ⅎ𝑥(𝐵 · (𝐹‘𝑡)) |
| 21 | oveq2 7375 | . . . . . . 7 ⊢ (𝑥 = (𝐹‘𝑡) → (𝐵 · 𝑥) = (𝐵 · (𝐹‘𝑡))) | |
| 22 | 17, 20, 21, 2 | fvmptf 6969 | . . . . . 6 ⊢ (((𝐹‘𝑡) ∈ ℂ ∧ (𝐵 · (𝐹‘𝑡)) ∈ ℂ) → ((𝑥 ∈ ℂ ↦ (𝐵 · 𝑥))‘(𝐹‘𝑡)) = (𝐵 · (𝐹‘𝑡))) |
| 23 | 12, 14, 22 | syl2anc 585 | . . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝐴) → ((𝑥 ∈ ℂ ↦ (𝐵 · 𝑥))‘(𝐹‘𝑡)) = (𝐵 · (𝐹‘𝑡))) |
| 24 | 23 | mpteq2dva 5178 | . . . 4 ⊢ (𝜑 → (𝑡 ∈ 𝐴 ↦ ((𝑥 ∈ ℂ ↦ (𝐵 · 𝑥))‘(𝐹‘𝑡))) = (𝑡 ∈ 𝐴 ↦ (𝐵 · (𝐹‘𝑡)))) |
| 25 | nfcv 2898 | . . . . . 6 ⊢ Ⅎ𝑡𝐵 | |
| 26 | nfcv 2898 | . . . . . 6 ⊢ Ⅎ𝑡 · | |
| 27 | nfcv 2898 | . . . . . 6 ⊢ Ⅎ𝑡(𝐹‘𝑥) | |
| 28 | 25, 26, 27 | nfov 7397 | . . . . 5 ⊢ Ⅎ𝑡(𝐵 · (𝐹‘𝑥)) |
| 29 | fveq2 6840 | . . . . . 6 ⊢ (𝑡 = 𝑥 → (𝐹‘𝑡) = (𝐹‘𝑥)) | |
| 30 | 29 | oveq2d 7383 | . . . . 5 ⊢ (𝑡 = 𝑥 → (𝐵 · (𝐹‘𝑡)) = (𝐵 · (𝐹‘𝑥))) |
| 31 | 20, 28, 30 | cbvmpt 5187 | . . . 4 ⊢ (𝑡 ∈ 𝐴 ↦ (𝐵 · (𝐹‘𝑡))) = (𝑥 ∈ 𝐴 ↦ (𝐵 · (𝐹‘𝑥))) |
| 32 | 24, 31 | eqtrdi 2787 | . . 3 ⊢ (𝜑 → (𝑡 ∈ 𝐴 ↦ ((𝑥 ∈ ℂ ↦ (𝐵 · 𝑥))‘(𝐹‘𝑡))) = (𝑥 ∈ 𝐴 ↦ (𝐵 · (𝐹‘𝑥)))) |
| 33 | 11, 32 | eqtrd 2771 | . 2 ⊢ (𝜑 → ((𝑥 ∈ ℂ ↦ (𝐵 · 𝑥)) ∘ 𝐹) = (𝑥 ∈ 𝐴 ↦ (𝐵 · (𝐹‘𝑥)))) |
| 34 | 7, 4 | cncfco 24874 | . 2 ⊢ (𝜑 → ((𝑥 ∈ ℂ ↦ (𝐵 · 𝑥)) ∘ 𝐹) ∈ (𝐴–cn→ℂ)) |
| 35 | 33, 34 | eqeltrrd 2837 | 1 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐵 · (𝐹‘𝑥))) ∈ (𝐴–cn→ℂ)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 Ⅎwnf 1785 ∈ wcel 2114 Ⅎwnfc 2883 ↦ cmpt 5166 ∘ ccom 5635 ⟶wf 6494 ‘cfv 6498 (class class class)co 7367 ℂcc 11036 · cmul 11043 –cn→ccncf 24843 |
| 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-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 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 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-er 8643 df-map 8775 df-en 8894 df-dom 8895 df-sdom 8896 df-sup 9355 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-div 11808 df-nn 12175 df-2 12244 df-3 12245 df-n0 12438 df-z 12525 df-uz 12789 df-rp 12943 df-seq 13964 df-exp 14024 df-cj 15061 df-re 15062 df-im 15063 df-sqrt 15197 df-abs 15198 df-cncf 24845 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |