| Mathbox for Steven Nguyen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > exp11d | Structured version Visualization version GIF version | ||
| Description: exp11nnd 14329 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 3041 | . 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 14329 | . 2 ⊢ ((𝜑 ∧ 𝑁 ∈ ℕ) → 𝐴 = 𝐵) |
| 13 | 5 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝐴 ∈ ℝ+) |
| 14 | 7 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝐵 ∈ ℝ+) |
| 15 | simpr 490 | . . 3 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → -𝑁 ∈ ℕ) | |
| 16 | 13 | rpcnd 13092 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝐴 ∈ ℂ) |
| 17 | 15 | nnnn0d 12593 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → -𝑁 ∈ ℕ0) |
| 18 | 16, 17 | expcld 14214 | . . . 4 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (𝐴↑-𝑁) ∈ ℂ) |
| 19 | 14 | rpcnd 13092 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝐵 ∈ ℂ) |
| 20 | 19, 17 | expcld 14214 | . . . 4 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (𝐵↑-𝑁) ∈ ℂ) |
| 21 | 13 | rpne0d 13095 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝐴 ≠ 0) |
| 22 | 15 | nnzd 12645 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → -𝑁 ∈ ℤ) |
| 23 | 16, 21, 22 | expne0d 14220 | . . . 4 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (𝐴↑-𝑁) ≠ 0) |
| 24 | 14 | rpne0d 13095 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝐵 ≠ 0) |
| 25 | 19, 24, 22 | expne0d 14220 | . . . 4 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (𝐵↑-𝑁) ≠ 0) |
| 26 | 10 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (𝐴↑𝑁) = (𝐵↑𝑁)) |
| 27 | exp11d.3 | . . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℤ) | |
| 28 | 27 | zcnd 12730 | . . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℂ) |
| 29 | 28 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝑁 ∈ ℂ) |
| 30 | expneg2 14138 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℂ ∧ -𝑁 ∈ ℕ0) → (𝐴↑𝑁) = (1 / (𝐴↑-𝑁))) | |
| 31 | 16, 29, 17, 30 | syl3anc 1398 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (𝐴↑𝑁) = (1 / (𝐴↑-𝑁))) |
| 32 | expneg2 14138 | . . . . . 6 ⊢ ((𝐵 ∈ ℂ ∧ 𝑁 ∈ ℂ ∧ -𝑁 ∈ ℕ0) → (𝐵↑𝑁) = (1 / (𝐵↑-𝑁))) | |
| 33 | 19, 29, 17, 32 | syl3anc 1398 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (𝐵↑𝑁) = (1 / (𝐵↑-𝑁))) |
| 34 | 26, 31, 33 | 3eqtr3d 2805 | . . . 4 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (1 / (𝐴↑-𝑁)) = (1 / (𝐵↑-𝑁))) |
| 35 | 18, 20, 23, 25, 34 | rec11d 12040 | . . 3 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (𝐴↑-𝑁) = (𝐵↑-𝑁)) |
| 36 | 13, 14, 15, 35 | exp11nnd 14329 | . 2 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝐴 = 𝐵) |
| 37 | elz 12621 | . . . 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 2957 (class class class)co 7417 ℂcc 11126 ℝcr 11127 0cc0 11128 1c1 11129 -cneg 11470 / cdiv 11899 ℕcn 12261 ℕ0cn0 12532 ℤcz 12619 ℝ+crp 13046 ↑cexp 14129 |
| 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 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 ax-cnex 11184 ax-resscn 11185 ax-1cn 11186 ax-icn 11187 ax-addcl 11188 ax-addrcl 11189 ax-mulcl 11190 ax-mulrcl 11191 ax-mulcom 11192 ax-addass 11193 ax-mulass 11194 ax-distr 11195 ax-i2m1 11196 ax-1ne0 11197 ax-1rid 11198 ax-rnegex 11199 ax-rrecex 11200 ax-cnre 11201 ax-pre-lttri 11202 ax-pre-lttrn 11203 ax-pre-ltadd 11204 ax-pre-mulgt0 11205 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7374 df-ov 7420 df-oprab 7421 df-mpo 7422 df-om 7867 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-er 8700 df-en 8957 df-dom 8958 df-sdom 8959 df-pnf 11273 df-mnf 11274 df-xr 11275 df-ltxr 11276 df-le 11277 df-sub 11471 df-neg 11472 df-div 11900 df-nn 12262 df-n0 12533 df-z 12620 df-uz 12892 df-rp 13047 df-seq 14070 df-exp 14130 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |