| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > exp0 | GIF version | ||
| Description: Value of a complex number raised to the 0th power. Note that under our definition, 0↑0 = 1 (0exp0e1 10696) , following the convention used by Gleason. Part of Definition 10-4.1 of [Gleason] p. 134. (Contributed by NM, 20-May-2004.) (Revised by Mario Carneiro, 4-Jun-2014.) |
| Ref | Expression |
|---|---|
| exp0 | ⊢ (𝐴 ∈ ℂ → (𝐴↑0) = 1) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0zd 9391 | . . 3 ⊢ (𝐴 ∈ ℂ → 0 ∈ ℤ) | |
| 2 | 0le0 9132 | . . . . 5 ⊢ 0 ≤ 0 | |
| 3 | 2 | a1i 9 | . . . 4 ⊢ (𝐴 ∈ ℂ → 0 ≤ 0) |
| 4 | 3 | olcd 736 | . . 3 ⊢ (𝐴 ∈ ℂ → (𝐴 # 0 ∨ 0 ≤ 0)) |
| 5 | exp3val 10693 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 0 ∈ ℤ ∧ (𝐴 # 0 ∨ 0 ≤ 0)) → (𝐴↑0) = if(0 = 0, 1, if(0 < 0, (seq1( · , (ℕ × {𝐴}))‘0), (1 / (seq1( · , (ℕ × {𝐴}))‘-0))))) | |
| 6 | 1, 4, 5 | mpd3an23 1352 | . 2 ⊢ (𝐴 ∈ ℂ → (𝐴↑0) = if(0 = 0, 1, if(0 < 0, (seq1( · , (ℕ × {𝐴}))‘0), (1 / (seq1( · , (ℕ × {𝐴}))‘-0))))) |
| 7 | eqid 2206 | . . 3 ⊢ 0 = 0 | |
| 8 | 7 | iftruei 3578 | . 2 ⊢ if(0 = 0, 1, if(0 < 0, (seq1( · , (ℕ × {𝐴}))‘0), (1 / (seq1( · , (ℕ × {𝐴}))‘-0)))) = 1 |
| 9 | 6, 8 | eqtrdi 2255 | 1 ⊢ (𝐴 ∈ ℂ → (𝐴↑0) = 1) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∨ wo 710 = wceq 1373 ∈ wcel 2177 ifcif 3572 {csn 3634 class class class wbr 4047 × cxp 4677 ‘cfv 5276 (class class class)co 5951 ℂcc 7930 0cc0 7932 1c1 7933 · cmul 7937 < clt 8114 ≤ cle 8115 -cneg 8251 # cap 8661 / cdiv 8752 ℕcn 9043 ℤcz 9379 seqcseq 10599 ↑cexp 10690 |
| 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 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2179 ax-14 2180 ax-ext 2188 ax-coll 4163 ax-sep 4166 ax-nul 4174 ax-pow 4222 ax-pr 4257 ax-un 4484 ax-setind 4589 ax-iinf 4640 ax-cnex 8023 ax-resscn 8024 ax-1cn 8025 ax-1re 8026 ax-icn 8027 ax-addcl 8028 ax-addrcl 8029 ax-mulcl 8030 ax-mulrcl 8031 ax-addcom 8032 ax-mulcom 8033 ax-addass 8034 ax-mulass 8035 ax-distr 8036 ax-i2m1 8037 ax-0lt1 8038 ax-1rid 8039 ax-0id 8040 ax-rnegex 8041 ax-precex 8042 ax-cnre 8043 ax-pre-ltirr 8044 ax-pre-ltwlin 8045 ax-pre-lttrn 8046 ax-pre-apti 8047 ax-pre-ltadd 8048 ax-pre-mulgt0 8049 ax-pre-mulext 8050 |
| This theorem depends on definitions: df-bi 117 df-dc 837 df-3or 982 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ne 2378 df-nel 2473 df-ral 2490 df-rex 2491 df-reu 2492 df-rmo 2493 df-rab 2494 df-v 2775 df-sbc 3000 df-csb 3095 df-dif 3169 df-un 3171 df-in 3173 df-ss 3180 df-nul 3462 df-if 3573 df-pw 3619 df-sn 3640 df-pr 3641 df-op 3643 df-uni 3853 df-int 3888 df-iun 3931 df-br 4048 df-opab 4110 df-mpt 4111 df-tr 4147 df-id 4344 df-po 4347 df-iso 4348 df-iord 4417 df-on 4419 df-ilim 4420 df-suc 4422 df-iom 4643 df-xp 4685 df-rel 4686 df-cnv 4687 df-co 4688 df-dm 4689 df-rn 4690 df-res 4691 df-ima 4692 df-iota 5237 df-fun 5278 df-fn 5279 df-f 5280 df-f1 5281 df-fo 5282 df-f1o 5283 df-fv 5284 df-riota 5906 df-ov 5954 df-oprab 5955 df-mpo 5956 df-1st 6233 df-2nd 6234 df-recs 6398 df-frec 6484 df-pnf 8116 df-mnf 8117 df-xr 8118 df-ltxr 8119 df-le 8120 df-sub 8252 df-neg 8253 df-reap 8655 df-ap 8662 df-div 8753 df-inn 9044 df-n0 9303 df-z 9380 df-uz 9656 df-seqfrec 10600 df-exp 10691 |
| This theorem is referenced by: 0exp0e1 10696 expp1 10698 expnegap0 10699 expcllem 10702 mulexp 10730 expadd 10733 expmul 10736 leexp1a 10746 exple1 10747 bernneq 10812 modqexp 10818 exp0d 10819 cjexp 11248 resqrexlemcalc3 11371 absexp 11434 binom 11839 ege2le3 12026 eft0val 12048 demoivreALT 12129 bits0 12303 0bits 12314 bitsinv1 12317 numexp0 12789 cnfldexp 14383 expcn 15085 expcncf 15125 dvexp 15227 dvexp2 15228 plyconst 15261 lgsquad2lem2 15603 |
| Copyright terms: Public domain | W3C validator |