| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > logbmpt | Structured version Visualization version GIF version | ||
| Description: The general logarithm to a fixed base regarded as mapping. (Contributed by AV, 11-Jun-2020.) |
| Ref | Expression |
|---|---|
| logbmpt | ⊢ ((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0 ∧ 𝐵 ≠ 1) → (curry logb ‘𝐵) = (𝑦 ∈ (ℂ ∖ {0}) ↦ ((log‘𝑦) / (log‘𝐵)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-logb 26888 | . . 3 ⊢ logb = (𝑥 ∈ (ℂ ∖ {0, 1}), 𝑦 ∈ (ℂ ∖ {0}) ↦ ((log‘𝑦) / (log‘𝑥))) | |
| 2 | ovexd 7435 | . . . 4 ⊢ (((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0 ∧ 𝐵 ≠ 1) ∧ (𝑥 ∈ (ℂ ∖ {0, 1}) ∧ 𝑦 ∈ (ℂ ∖ {0}))) → ((log‘𝑦) / (log‘𝑥)) ∈ V) | |
| 3 | 2 | ralrimivva 3208 | . . 3 ⊢ ((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0 ∧ 𝐵 ≠ 1) → ∀𝑥 ∈ (ℂ ∖ {0, 1})∀𝑦 ∈ (ℂ ∖ {0})((log‘𝑦) / (log‘𝑥)) ∈ V) |
| 4 | ax-1cn 11146 | . . . . . 6 ⊢ 1 ∈ ℂ | |
| 5 | ax-1ne0 11157 | . . . . . . 7 ⊢ 1 ≠ 0 | |
| 6 | elsng 4599 | . . . . . . . 8 ⊢ (1 ∈ ℂ → (1 ∈ {0} ↔ 1 = 0)) | |
| 7 | 4, 6 | ax-mp 5 | . . . . . . 7 ⊢ (1 ∈ {0} ↔ 1 = 0) |
| 8 | 5, 7 | nemtbir 3056 | . . . . . 6 ⊢ ¬ 1 ∈ {0} |
| 9 | eldif 3917 | . . . . . 6 ⊢ (1 ∈ (ℂ ∖ {0}) ↔ (1 ∈ ℂ ∧ ¬ 1 ∈ {0})) | |
| 10 | 4, 8, 9 | mpbir2an 723 | . . . . 5 ⊢ 1 ∈ (ℂ ∖ {0}) |
| 11 | 10 | ne0ii 4299 | . . . 4 ⊢ (ℂ ∖ {0}) ≠ ∅ |
| 12 | 11 | a1i 11 | . . 3 ⊢ ((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0 ∧ 𝐵 ≠ 1) → (ℂ ∖ {0}) ≠ ∅) |
| 13 | cnex 11169 | . . . . 5 ⊢ ℂ ∈ V | |
| 14 | 13 | difexi 5291 | . . . 4 ⊢ (ℂ ∖ {0}) ∈ V |
| 15 | 14 | a1i 11 | . . 3 ⊢ ((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0 ∧ 𝐵 ≠ 1) → (ℂ ∖ {0}) ∈ V) |
| 16 | eldifpr 4620 | . . . 4 ⊢ (𝐵 ∈ (ℂ ∖ {0, 1}) ↔ (𝐵 ∈ ℂ ∧ 𝐵 ≠ 0 ∧ 𝐵 ≠ 1)) | |
| 17 | 16 | biimpri 231 | . . 3 ⊢ ((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0 ∧ 𝐵 ≠ 1) → 𝐵 ∈ (ℂ ∖ {0, 1})) |
| 18 | 1, 3, 12, 15, 17 | mpocurryvald 8254 | . 2 ⊢ ((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0 ∧ 𝐵 ≠ 1) → (curry logb ‘𝐵) = (𝑦 ∈ (ℂ ∖ {0}) ↦ ⦋𝐵 / 𝑥⦌((log‘𝑦) / (log‘𝑥)))) |
| 19 | csbov2g 7448 | . . . . 5 ⊢ (𝐵 ∈ ℂ → ⦋𝐵 / 𝑥⦌((log‘𝑦) / (log‘𝑥)) = ((log‘𝑦) / ⦋𝐵 / 𝑥⦌(log‘𝑥))) | |
| 20 | csbfv 6918 | . . . . . . 7 ⊢ ⦋𝐵 / 𝑥⦌(log‘𝑥) = (log‘𝐵) | |
| 21 | 20 | a1i 11 | . . . . . 6 ⊢ (𝐵 ∈ ℂ → ⦋𝐵 / 𝑥⦌(log‘𝑥) = (log‘𝐵)) |
| 22 | 21 | oveq2d 7416 | . . . . 5 ⊢ (𝐵 ∈ ℂ → ((log‘𝑦) / ⦋𝐵 / 𝑥⦌(log‘𝑥)) = ((log‘𝑦) / (log‘𝐵))) |
| 23 | 19, 22 | eqtrd 2800 | . . . 4 ⊢ (𝐵 ∈ ℂ → ⦋𝐵 / 𝑥⦌((log‘𝑦) / (log‘𝑥)) = ((log‘𝑦) / (log‘𝐵))) |
| 24 | 23 | 3ad2ant1 1149 | . . 3 ⊢ ((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0 ∧ 𝐵 ≠ 1) → ⦋𝐵 / 𝑥⦌((log‘𝑦) / (log‘𝑥)) = ((log‘𝑦) / (log‘𝐵))) |
| 25 | 24 | mpteq2dv 5199 | . 2 ⊢ ((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0 ∧ 𝐵 ≠ 1) → (𝑦 ∈ (ℂ ∖ {0}) ↦ ⦋𝐵 / 𝑥⦌((log‘𝑦) / (log‘𝑥))) = (𝑦 ∈ (ℂ ∖ {0}) ↦ ((log‘𝑦) / (log‘𝐵)))) |
| 26 | 18, 25 | eqtrd 2800 | 1 ⊢ ((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0 ∧ 𝐵 ≠ 1) → (curry logb ‘𝐵) = (𝑦 ∈ (ℂ ∖ {0}) ↦ ((log‘𝑦) / (log‘𝐵)))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1101 = wceq 1563 ∈ wcel 2145 ≠ wne 2960 Vcvv 3457 ⦋csb 3855 ∖ cdif 3904 ∅c0 4288 {csn 4585 {cpr 4587 ↦ cmpt 5186 ‘cfv 6525 (class class class)co 7400 curry ccur 8249 ℂcc 11086 0cc0 11088 1c1 11089 / cdiv 11859 logclog 26677 logb clogb 26887 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5232 ax-sep 5251 ax-nul 5261 ax-pr 5395 ax-un 7722 ax-cnex 11144 ax-1cn 11146 ax-1ne0 11157 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3080 df-rex 3090 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-nul 4289 df-if 4484 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-id 5547 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-ov 7403 df-oprab 7404 df-mpo 7405 df-1st 7974 df-2nd 7975 df-cur 8251 df-logb 26888 |
| This theorem is referenced by: logbf 26912 relogbf 26914 logblog 26915 |
| Copyright terms: Public domain | W3C validator |