Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > exp0 | Structured version Visualization version GIF version |
Description: Value of a complex number raised to the 0th power. Note that under our definition, 0↑0 = 1, 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 | 0z 11986 | . . 3 ⊢ 0 ∈ ℤ | |
2 | expval 13425 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 0 ∈ ℤ) → (𝐴↑0) = if(0 = 0, 1, if(0 < 0, (seq1( · , (ℕ × {𝐴}))‘0), (1 / (seq1( · , (ℕ × {𝐴}))‘-0))))) | |
3 | 1, 2 | mpan2 689 | . 2 ⊢ (𝐴 ∈ ℂ → (𝐴↑0) = if(0 = 0, 1, if(0 < 0, (seq1( · , (ℕ × {𝐴}))‘0), (1 / (seq1( · , (ℕ × {𝐴}))‘-0))))) |
4 | eqid 2821 | . . 3 ⊢ 0 = 0 | |
5 | 4 | iftruei 4473 | . 2 ⊢ if(0 = 0, 1, if(0 < 0, (seq1( · , (ℕ × {𝐴}))‘0), (1 / (seq1( · , (ℕ × {𝐴}))‘-0)))) = 1 |
6 | 3, 5 | syl6eq 2872 | 1 ⊢ (𝐴 ∈ ℂ → (𝐴↑0) = 1) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 ∈ wcel 2110 ifcif 4466 {csn 4560 class class class wbr 5058 × cxp 5547 ‘cfv 6349 (class class class)co 7150 ℂcc 10529 0cc0 10531 1c1 10532 · cmul 10536 < clt 10669 -cneg 10865 / cdiv 11291 ℕcn 11632 ℤcz 11975 seqcseq 13363 ↑cexp 13423 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5195 ax-nul 5202 ax-pr 5321 ax-1cn 10589 ax-addrcl 10592 ax-rnegex 10602 ax-cnre 10604 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3772 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-sn 4561 df-pr 4563 df-op 4567 df-uni 4832 df-br 5059 df-opab 5121 df-mpt 5139 df-id 5454 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-pred 6142 df-iota 6308 df-fun 6351 df-fv 6357 df-ov 7153 df-oprab 7154 df-mpo 7155 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-neg 10867 df-z 11976 df-seq 13364 df-exp 13424 |
This theorem is referenced by: 0exp0e1 13428 expp1 13430 expneg 13431 expcllem 13434 mulexp 13462 expadd 13465 expmul 13468 exp0d 13498 leexp1a 13533 exple1 13534 bernneq 13584 modexp 13593 faclbnd4lem1 13647 faclbnd4lem3 13649 faclbnd4lem4 13650 cjexp 14503 absexp 14658 binom 15179 incexclem 15185 incexc 15186 climcndslem1 15198 pwdif 15217 fprodconst 15326 fallfac0 15376 bpoly0 15398 ege2le3 15437 eft0val 15459 demoivreALT 15548 pwp1fsum 15736 bits0 15771 0bits 15782 bitsinv1 15785 sadcadd 15801 smumullem 15835 numexp0 16406 psgnunilem4 18619 psgn0fv0 18633 psgnsn 18642 psgnprfval1 18644 cnfldexp 20572 expmhm 20608 expcn 23474 iblcnlem1 24382 itgcnlem 24384 dvexp 24544 dvexp2 24545 plyconst 24790 0dgr 24829 0dgrb 24830 aaliou3lem2 24926 cxp0 25247 1cubr 25414 log2ublem3 25520 basellem2 25653 basellem5 25656 lgsquad2lem2 25955 0dp2dp 30580 oddpwdc 31607 breprexp 31899 subfacval2 32429 fwddifn0 33620 stoweidlem19 42298 fmtno0 43696 bits0ALTV 43838 0dig2nn0e 44666 0dig2nn0o 44667 nn0sumshdiglemA 44673 nn0sumshdiglemB 44674 nn0sumshdiglem1 44675 nn0sumshdiglem2 44676 |
Copyright terms: Public domain | W3C validator |