| Mathbox for Steven Nguyen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > exp11d | Structured version Visualization version GIF version | ||
| Description: exp11nnd 14308 for nonzero integer exponents. (Contributed by SN, 14-Sep-2023.) |
| Ref | Expression |
|---|---|
| exp11d.1 | ⊢ (𝜑 → 𝐴 ∈ ℝ+) |
| exp11d.2 | ⊢ (𝜑 → 𝐵 ∈ ℝ+) |
| exp11d.3 | ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| exp11d.4 | ⊢ (𝜑 → 𝑁 ≠ 0) |
| exp11d.5 | ⊢ (𝜑 → (𝐴↑𝑁) = (𝐵↑𝑁)) |
| Ref | Expression |
|---|---|
| exp11d | ⊢ (𝜑 → 𝐴 = 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 490 | . . 3 ⊢ ((𝜑 ∧ 𝑁 = 0) → 𝑁 = 0) | |
| 2 | exp11d.4 | . . . 4 ⊢ (𝜑 → 𝑁 ≠ 0) | |
| 3 | 2 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ 𝑁 = 0) → 𝑁 ≠ 0) |
| 4 | 1, 3 | pm2.21ddne 3045 | . 2 ⊢ ((𝜑 ∧ 𝑁 = 0) → 𝐴 = 𝐵) |
| 5 | exp11d.1 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ ℝ+) | |
| 6 | 5 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ 𝑁 ∈ ℕ) → 𝐴 ∈ ℝ+) |
| 7 | exp11d.2 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ ℝ+) | |
| 8 | 7 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ 𝑁 ∈ ℕ) → 𝐵 ∈ ℝ+) |
| 9 | simpr 490 | . . 3 ⊢ ((𝜑 ∧ 𝑁 ∈ ℕ) → 𝑁 ∈ ℕ) | |
| 10 | exp11d.5 | . . . 4 ⊢ (𝜑 → (𝐴↑𝑁) = (𝐵↑𝑁)) | |
| 11 | 10 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ 𝑁 ∈ ℕ) → (𝐴↑𝑁) = (𝐵↑𝑁)) |
| 12 | 6, 8, 9, 11 | exp11nnd 14308 | . 2 ⊢ ((𝜑 ∧ 𝑁 ∈ ℕ) → 𝐴 = 𝐵) |
| 13 | 5 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝐴 ∈ ℝ+) |
| 14 | 7 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝐵 ∈ ℝ+) |
| 15 | simpr 490 | . . 3 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → -𝑁 ∈ ℕ) | |
| 16 | 13 | rpcnd 13072 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝐴 ∈ ℂ) |
| 17 | 15 | nnnn0d 12575 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → -𝑁 ∈ ℕ0) |
| 18 | 16, 17 | expcld 14193 | . . . 4 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (𝐴↑-𝑁) ∈ ℂ) |
| 19 | 14 | rpcnd 13072 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝐵 ∈ ℂ) |
| 20 | 19, 17 | expcld 14193 | . . . 4 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (𝐵↑-𝑁) ∈ ℂ) |
| 21 | 13 | rpne0d 13075 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝐴 ≠ 0) |
| 22 | 15 | nnzd 12627 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → -𝑁 ∈ ℤ) |
| 23 | 16, 21, 22 | expne0d 14199 | . . . 4 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (𝐴↑-𝑁) ≠ 0) |
| 24 | 14 | rpne0d 13075 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝐵 ≠ 0) |
| 25 | 19, 24, 22 | expne0d 14199 | . . . 4 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (𝐵↑-𝑁) ≠ 0) |
| 26 | 10 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (𝐴↑𝑁) = (𝐵↑𝑁)) |
| 27 | exp11d.3 | . . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℤ) | |
| 28 | 27 | zcnd 12711 | . . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℂ) |
| 29 | 28 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝑁 ∈ ℂ) |
| 30 | expneg2 14117 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℂ ∧ -𝑁 ∈ ℕ0) → (𝐴↑𝑁) = (1 / (𝐴↑-𝑁))) | |
| 31 | 16, 29, 17, 30 | syl3anc 1398 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (𝐴↑𝑁) = (1 / (𝐴↑-𝑁))) |
| 32 | expneg2 14117 | . . . . . 6 ⊢ ((𝐵 ∈ ℂ ∧ 𝑁 ∈ ℂ ∧ -𝑁 ∈ ℕ0) → (𝐵↑𝑁) = (1 / (𝐵↑-𝑁))) | |
| 33 | 19, 29, 17, 32 | syl3anc 1398 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (𝐵↑𝑁) = (1 / (𝐵↑-𝑁))) |
| 34 | 26, 31, 33 | 3eqtr3d 2809 | . . . 4 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (1 / (𝐴↑-𝑁)) = (1 / (𝐵↑-𝑁))) |
| 35 | 18, 20, 23, 25, 34 | rec11d 12022 | . . 3 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (𝐴↑-𝑁) = (𝐵↑-𝑁)) |
| 36 | 13, 14, 15, 35 | exp11nnd 14308 | . 2 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝐴 = 𝐵) |
| 37 | elz 12603 | . . . 4 ⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ))) | |
| 38 | 27, 37 | sylib 221 | . . 3 ⊢ (𝜑 → (𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ))) |
| 39 | 38 | simprd 501 | . 2 ⊢ (𝜑 → (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ)) |
| 40 | 4, 12, 36, 39 | mpjao3dan 1459 | 1 ⊢ (𝜑 → 𝐴 = 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∨ w3o 1102 = wceq 1570 ∈ wcel 2146 ≠ wne 2961 (class class class)co 7416 ℂcc 11108 ℝcr 11109 0cc0 11110 1c1 11111 -cneg 11452 / cdiv 11881 ℕcn 12243 ℕ0cn0 12514 ℤcz 12601 ℝ+crp 13026 ↑cexp 14108 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-sep 5260 ax-nul 5272 ax-pow 5339 ax-pr 5407 ax-un 7738 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187 |
| 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 2100 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-nel 3068 df-ral 3083 df-rex 3093 df-rmo 3372 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4491 df-pw 4567 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4876 df-iun 4961 df-br 5113 df-opab 5177 df-mpt 5196 df-tr 5222 df-id 5559 df-eprel 5564 df-po 5572 df-so 5573 df-fr 5617 df-we 5619 df-xp 5670 df-rel 5671 df-cnv 5672 df-co 5673 df-dm 5674 df-rn 5675 df-res 5676 df-ima 5677 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7865 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-er 8696 df-en 8946 df-dom 8947 df-sdom 8948 df-pnf 11255 df-mnf 11256 df-xr 11257 df-ltxr 11258 df-le 11259 df-sub 11453 df-neg 11454 df-div 11882 df-nn 12244 df-n0 12515 df-z 12602 df-uz 12873 df-rp 13027 df-seq 14049 df-exp 14109 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |