| Mathbox for Steven Nguyen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > exp11d | Structured version Visualization version GIF version | ||
| Description: exp11nnd 14385 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 3040 | . 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 14385 | . 2 ⊢ ((𝜑 ∧ 𝑁 ∈ ℕ) → 𝐴 = 𝐵) |
| 13 | 5 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝐴 ∈ ℝ+) |
| 14 | 7 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝐵 ∈ ℝ+) |
| 15 | simpr 490 | . . 3 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → -𝑁 ∈ ℕ) | |
| 16 | 13 | rpcnd 13147 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝐴 ∈ ℂ) |
| 17 | 15 | nnnn0d 12648 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → -𝑁 ∈ ℕ0) |
| 18 | 16, 17 | expcld 14269 | . . . 4 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (𝐴↑-𝑁) ∈ ℂ) |
| 19 | 14 | rpcnd 13147 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝐵 ∈ ℂ) |
| 20 | 19, 17 | expcld 14269 | . . . 4 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (𝐵↑-𝑁) ∈ ℂ) |
| 21 | 13 | rpne0d 13150 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝐴 ≠ 0) |
| 22 | 15 | nnzd 12700 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → -𝑁 ∈ ℤ) |
| 23 | 16, 21, 22 | expne0d 14275 | . . . 4 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (𝐴↑-𝑁) ≠ 0) |
| 24 | 14 | rpne0d 13150 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝐵 ≠ 0) |
| 25 | 19, 24, 22 | expne0d 14275 | . . . 4 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (𝐵↑-𝑁) ≠ 0) |
| 26 | 10 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (𝐴↑𝑁) = (𝐵↑𝑁)) |
| 27 | exp11d.3 | . . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℤ) | |
| 28 | 27 | zcnd 12785 | . . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℂ) |
| 29 | 28 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝑁 ∈ ℂ) |
| 30 | expneg2 14193 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℂ ∧ -𝑁 ∈ ℕ0) → (𝐴↑𝑁) = (1 / (𝐴↑-𝑁))) | |
| 31 | 16, 29, 17, 30 | syl3anc 1398 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (𝐴↑𝑁) = (1 / (𝐴↑-𝑁))) |
| 32 | expneg2 14193 | . . . . . 6 ⊢ ((𝐵 ∈ ℂ ∧ 𝑁 ∈ ℂ ∧ -𝑁 ∈ ℕ0) → (𝐵↑𝑁) = (1 / (𝐵↑-𝑁))) | |
| 33 | 19, 29, 17, 32 | syl3anc 1398 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (𝐵↑𝑁) = (1 / (𝐵↑-𝑁))) |
| 34 | 26, 31, 33 | 3eqtr3d 2804 | . . . 4 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (1 / (𝐴↑-𝑁)) = (1 / (𝐵↑-𝑁))) |
| 35 | 18, 20, 23, 25, 34 | rec11d 12095 | . . 3 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (𝐴↑-𝑁) = (𝐵↑-𝑁)) |
| 36 | 13, 14, 15, 35 | exp11nnd 14385 | . 2 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝐴 = 𝐵) |
| 37 | elz 12676 | . . . 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 2145 ≠ wne 2956 (class class class)co 7412 ℂcc 11179 ℝcr 11180 0cc0 11181 1c1 11182 -cneg 11523 / cdiv 11954 ℕcn 12316 ℕ0cn0 12587 ℤcz 12674 ℝ+crp 13101 ↑cexp 14184 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-cnex 11237 ax-resscn 11238 ax-1cn 11239 ax-icn 11240 ax-addcl 11241 ax-addrcl 11242 ax-mulcl 11243 ax-mulrcl 11244 ax-mulcom 11245 ax-addass 11246 ax-mulass 11247 ax-distr 11248 ax-i2m1 11249 ax-1ne0 11250 ax-1rid 11251 ax-rnegex 11252 ax-rrecex 11253 ax-cnre 11254 ax-pre-lttri 11255 ax-pre-lttrn 11256 ax-pre-ltadd 11257 ax-pre-mulgt0 11258 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7867 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-er 8701 df-en 8958 df-dom 8959 df-sdom 8960 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11524 df-neg 11525 df-div 11955 df-nn 12317 df-n0 12588 df-z 12675 df-uz 12947 df-rp 13102 df-seq 14125 df-exp 14185 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |