| 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 9594 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → 𝑁 ∈ ℤ) |
| 4 | 2 | nnnn0d 9448 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → 𝑁 ∈ ℕ0) |
| 5 | 4 | nn0ge0d 9451 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → 0 ≤ 𝑁) |
| 6 | 5 | olcd 739 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴 # 0 ∨ 0 ≤ 𝑁)) |
| 7 | exp3val 10796 | . . 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 9164 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → 𝑁 ≠ 0) | |
| 10 | 9 | neneqd 2421 | . . . . 5 ⊢ (𝑁 ∈ ℕ → ¬ 𝑁 = 0) |
| 11 | 10 | iffalsed 3613 | . . . 4 ⊢ (𝑁 ∈ ℕ → if(𝑁 = 0, 1, if(0 < 𝑁, (seq1( · , (ℕ × {𝐴}))‘𝑁), (1 / (seq1( · , (ℕ × {𝐴}))‘-𝑁)))) = if(0 < 𝑁, (seq1( · , (ℕ × {𝐴}))‘𝑁), (1 / (seq1( · , (ℕ × {𝐴}))‘-𝑁)))) |
| 12 | nngt0 9161 | . . . . 5 ⊢ (𝑁 ∈ ℕ → 0 < 𝑁) | |
| 13 | 12 | iftrued 3610 | . . . 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 3603 {csn 3667 class class class wbr 4086 × cxp 4721 ‘cfv 5324 (class class class)co 6013 ℂcc 8023 0cc0 8025 1c1 8026 · cmul 8030 < clt 8207 ≤ cle 8208 -cneg 8344 # cap 8754 / cdiv 8845 ℕcn 9136 ℤcz 9472 seqcseq 10702 ↑cexp 10793 |
| 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 4202 ax-sep 4205 ax-nul 4213 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-iinf 4684 ax-cnex 8116 ax-resscn 8117 ax-1cn 8118 ax-1re 8119 ax-icn 8120 ax-addcl 8121 ax-addrcl 8122 ax-mulcl 8123 ax-mulrcl 8124 ax-addcom 8125 ax-mulcom 8126 ax-addass 8127 ax-mulass 8128 ax-distr 8129 ax-i2m1 8130 ax-0lt1 8131 ax-1rid 8132 ax-0id 8133 ax-rnegex 8134 ax-precex 8135 ax-cnre 8136 ax-pre-ltirr 8137 ax-pre-ltwlin 8138 ax-pre-lttrn 8139 ax-pre-apti 8140 ax-pre-ltadd 8141 ax-pre-mulgt0 8142 ax-pre-mulext 8143 |
| 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 2802 df-sbc 3030 df-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-nul 3493 df-if 3604 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 df-tr 4186 df-id 4388 df-po 4391 df-iso 4392 df-iord 4461 df-on 4463 df-ilim 4464 df-suc 4466 df-iom 4687 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-1st 6298 df-2nd 6299 df-recs 6466 df-frec 6552 df-pnf 8209 df-mnf 8210 df-xr 8211 df-ltxr 8212 df-le 8213 df-sub 8345 df-neg 8346 df-reap 8748 df-ap 8755 df-div 8846 df-inn 9137 df-n0 9396 df-z 9473 df-uz 9749 df-seqfrec 10703 df-exp 10794 |
| This theorem is referenced by: exp1 10800 expp1 10801 expnegap0 10802 |
| Copyright terms: Public domain | W3C validator |