| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > expnnval | GIF version | ||
| Description: Value of exponentiation to positive integer powers. (Contributed by Mario Carneiro, 4-Jun-2014.) |
| Ref | Expression |
|---|---|
| expnnval | ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑𝑁) = (seq1( · , (ℕ × {𝐴}))‘𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 109 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → 𝐴 ∈ ℂ) | |
| 2 | simpr 110 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → 𝑁 ∈ ℕ) | |
| 3 | 2 | nnzd 9576 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → 𝑁 ∈ ℤ) |
| 4 | 2 | nnnn0d 9430 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → 𝑁 ∈ ℕ0) |
| 5 | 4 | nn0ge0d 9433 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → 0 ≤ 𝑁) |
| 6 | 5 | olcd 739 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴 # 0 ∨ 0 ≤ 𝑁)) |
| 7 | exp3val 10771 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℤ ∧ (𝐴 # 0 ∨ 0 ≤ 𝑁)) → (𝐴↑𝑁) = if(𝑁 = 0, 1, if(0 < 𝑁, (seq1( · , (ℕ × {𝐴}))‘𝑁), (1 / (seq1( · , (ℕ × {𝐴}))‘-𝑁))))) | |
| 8 | 1, 3, 6, 7 | syl3anc 1271 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑𝑁) = if(𝑁 = 0, 1, if(0 < 𝑁, (seq1( · , (ℕ × {𝐴}))‘𝑁), (1 / (seq1( · , (ℕ × {𝐴}))‘-𝑁))))) |
| 9 | nnne0 9146 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → 𝑁 ≠ 0) | |
| 10 | 9 | neneqd 2421 | . . . . 5 ⊢ (𝑁 ∈ ℕ → ¬ 𝑁 = 0) |
| 11 | 10 | iffalsed 3612 | . . . 4 ⊢ (𝑁 ∈ ℕ → if(𝑁 = 0, 1, if(0 < 𝑁, (seq1( · , (ℕ × {𝐴}))‘𝑁), (1 / (seq1( · , (ℕ × {𝐴}))‘-𝑁)))) = if(0 < 𝑁, (seq1( · , (ℕ × {𝐴}))‘𝑁), (1 / (seq1( · , (ℕ × {𝐴}))‘-𝑁)))) |
| 12 | nngt0 9143 | . . . . 5 ⊢ (𝑁 ∈ ℕ → 0 < 𝑁) | |
| 13 | 12 | iftrued 3609 | . . . 4 ⊢ (𝑁 ∈ ℕ → if(0 < 𝑁, (seq1( · , (ℕ × {𝐴}))‘𝑁), (1 / (seq1( · , (ℕ × {𝐴}))‘-𝑁))) = (seq1( · , (ℕ × {𝐴}))‘𝑁)) |
| 14 | 11, 13 | eqtrd 2262 | . . 3 ⊢ (𝑁 ∈ ℕ → if(𝑁 = 0, 1, if(0 < 𝑁, (seq1( · , (ℕ × {𝐴}))‘𝑁), (1 / (seq1( · , (ℕ × {𝐴}))‘-𝑁)))) = (seq1( · , (ℕ × {𝐴}))‘𝑁)) |
| 15 | 14 | adantl 277 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → if(𝑁 = 0, 1, if(0 < 𝑁, (seq1( · , (ℕ × {𝐴}))‘𝑁), (1 / (seq1( · , (ℕ × {𝐴}))‘-𝑁)))) = (seq1( · , (ℕ × {𝐴}))‘𝑁)) |
| 16 | 8, 15 | eqtrd 2262 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑𝑁) = (seq1( · , (ℕ × {𝐴}))‘𝑁)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∨ wo 713 = wceq 1395 ∈ wcel 2200 ifcif 3602 {csn 3666 class class class wbr 4083 × cxp 4717 ‘cfv 5318 (class class class)co 6007 ℂcc 8005 0cc0 8007 1c1 8008 · cmul 8012 < clt 8189 ≤ cle 8190 -cneg 8326 # cap 8736 / cdiv 8827 ℕcn 9118 ℤcz 9454 seqcseq 10677 ↑cexp 10768 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-nul 4210 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-iinf 4680 ax-cnex 8098 ax-resscn 8099 ax-1cn 8100 ax-1re 8101 ax-icn 8102 ax-addcl 8103 ax-addrcl 8104 ax-mulcl 8105 ax-mulrcl 8106 ax-addcom 8107 ax-mulcom 8108 ax-addass 8109 ax-mulass 8110 ax-distr 8111 ax-i2m1 8112 ax-0lt1 8113 ax-1rid 8114 ax-0id 8115 ax-rnegex 8116 ax-precex 8117 ax-cnre 8118 ax-pre-ltirr 8119 ax-pre-ltwlin 8120 ax-pre-lttrn 8121 ax-pre-apti 8122 ax-pre-ltadd 8123 ax-pre-mulgt0 8124 ax-pre-mulext 8125 |
| This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-if 3603 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-tr 4183 df-id 4384 df-po 4387 df-iso 4388 df-iord 4457 df-on 4459 df-ilim 4460 df-suc 4462 df-iom 4683 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-f1 5323 df-fo 5324 df-f1o 5325 df-fv 5326 df-riota 5960 df-ov 6010 df-oprab 6011 df-mpo 6012 df-1st 6292 df-2nd 6293 df-recs 6457 df-frec 6543 df-pnf 8191 df-mnf 8192 df-xr 8193 df-ltxr 8194 df-le 8195 df-sub 8327 df-neg 8328 df-reap 8730 df-ap 8737 df-div 8828 df-inn 9119 df-n0 9378 df-z 9455 df-uz 9731 df-seqfrec 10678 df-exp 10769 |
| This theorem is referenced by: exp1 10775 expp1 10776 expnegap0 10777 |
| Copyright terms: Public domain | W3C validator |