| Mathbox for Steven Nguyen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > exp11d | Structured version Visualization version GIF version | ||
| Description: exp11nnd 14317 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 14317 | . 2 ⊢ ((𝜑 ∧ 𝑁 ∈ ℕ) → 𝐴 = 𝐵) |
| 13 | 5 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝐴 ∈ ℝ+) |
| 14 | 7 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝐵 ∈ ℝ+) |
| 15 | simpr 490 | . . 3 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → -𝑁 ∈ ℕ) | |
| 16 | 13 | rpcnd 13080 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝐴 ∈ ℂ) |
| 17 | 15 | nnnn0d 12583 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → -𝑁 ∈ ℕ0) |
| 18 | 16, 17 | expcld 14202 | . . . 4 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (𝐴↑-𝑁) ∈ ℂ) |
| 19 | 14 | rpcnd 13080 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝐵 ∈ ℂ) |
| 20 | 19, 17 | expcld 14202 | . . . 4 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (𝐵↑-𝑁) ∈ ℂ) |
| 21 | 13 | rpne0d 13083 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝐴 ≠ 0) |
| 22 | 15 | nnzd 12635 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → -𝑁 ∈ ℤ) |
| 23 | 16, 21, 22 | expne0d 14208 | . . . 4 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (𝐴↑-𝑁) ≠ 0) |
| 24 | 14 | rpne0d 13083 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝐵 ≠ 0) |
| 25 | 19, 24, 22 | expne0d 14208 | . . . 4 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (𝐵↑-𝑁) ≠ 0) |
| 26 | 10 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (𝐴↑𝑁) = (𝐵↑𝑁)) |
| 27 | exp11d.3 | . . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℤ) | |
| 28 | 27 | zcnd 12719 | . . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℂ) |
| 29 | 28 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝑁 ∈ ℂ) |
| 30 | expneg2 14126 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℂ ∧ -𝑁 ∈ ℕ0) → (𝐴↑𝑁) = (1 / (𝐴↑-𝑁))) | |
| 31 | 16, 29, 17, 30 | syl3anc 1398 | . . . . 5 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (𝐴↑𝑁) = (1 / (𝐴↑-𝑁))) |
| 32 | expneg2 14126 | . . . . . 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 12030 | . . 3 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → (𝐴↑-𝑁) = (𝐵↑-𝑁)) |
| 36 | 13, 14, 15, 35 | exp11nnd 14317 | . 2 ⊢ ((𝜑 ∧ -𝑁 ∈ ℕ) → 𝐴 = 𝐵) |
| 37 | elz 12611 | . . . 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 7423 ℂcc 11116 ℝcr 11117 0cc0 11118 1c1 11119 -cneg 11460 / cdiv 11889 ℕcn 12251 ℕ0cn0 12522 ℤcz 12609 ℝ+crp 13034 ↑cexp 14117 |
| 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 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 ax-cnex 11174 ax-resscn 11175 ax-1cn 11176 ax-icn 11177 ax-addcl 11178 ax-addrcl 11179 ax-mulcl 11180 ax-mulrcl 11181 ax-mulcom 11182 ax-addass 11183 ax-mulass 11184 ax-distr 11185 ax-i2m1 11186 ax-1ne0 11187 ax-1rid 11188 ax-rnegex 11189 ax-rrecex 11190 ax-cnre 11191 ax-pre-lttri 11192 ax-pre-lttrn 11193 ax-pre-ltadd 11194 ax-pre-mulgt0 11195 |
| 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 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5561 df-eprel 5566 df-po 5574 df-so 5575 df-fr 5619 df-we 5621 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6309 df-ord 6370 df-on 6371 df-lim 6372 df-suc 6373 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7380 df-ov 7426 df-oprab 7427 df-mpo 7428 df-om 7872 df-2nd 7996 df-frecs 8287 df-wrecs 8318 df-recs 8367 df-rdg 8406 df-er 8703 df-en 8953 df-dom 8954 df-sdom 8955 df-pnf 11263 df-mnf 11264 df-xr 11265 df-ltxr 11266 df-le 11267 df-sub 11461 df-neg 11462 df-div 11890 df-nn 12252 df-n0 12523 df-z 12610 df-uz 12881 df-rp 13035 df-seq 14058 df-exp 14118 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |