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 11980 | . . 3 ⊢ 0 ∈ ℤ | |
2 | expval 13427 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 0 ∈ ℤ) → (𝐴↑0) = if(0 = 0, 1, if(0 < 0, (seq1( · , (ℕ × {𝐴}))‘0), (1 / (seq1( · , (ℕ × {𝐴}))‘-0))))) | |
3 | 1, 2 | mpan2 690 | . 2 ⊢ (𝐴 ∈ ℂ → (𝐴↑0) = if(0 = 0, 1, if(0 < 0, (seq1( · , (ℕ × {𝐴}))‘0), (1 / (seq1( · , (ℕ × {𝐴}))‘-0))))) |
4 | eqid 2798 | . . 3 ⊢ 0 = 0 | |
5 | 4 | iftruei 4432 | . 2 ⊢ if(0 = 0, 1, if(0 < 0, (seq1( · , (ℕ × {𝐴}))‘0), (1 / (seq1( · , (ℕ × {𝐴}))‘-0)))) = 1 |
6 | 3, 5 | eqtrdi 2849 | 1 ⊢ (𝐴 ∈ ℂ → (𝐴↑0) = 1) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1538 ∈ wcel 2111 ifcif 4425 {csn 4525 class class class wbr 5030 × cxp 5517 ‘cfv 6324 (class class class)co 7135 ℂcc 10524 0cc0 10526 1c1 10527 · cmul 10531 < clt 10664 -cneg 10860 / cdiv 11286 ℕcn 11625 ℤcz 11969 seqcseq 13364 ↑cexp 13425 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pr 5295 ax-1cn 10584 ax-addrcl 10587 ax-rnegex 10597 ax-cnre 10599 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-sbc 3721 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-iota 6283 df-fun 6326 df-fv 6332 df-ov 7138 df-oprab 7139 df-mpo 7140 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-neg 10862 df-z 11970 df-seq 13365 df-exp 13426 |
This theorem is referenced by: 0exp0e1 13430 expp1 13432 expneg 13433 expcllem 13436 mulexp 13464 expadd 13467 expmul 13470 exp0d 13500 leexp1a 13535 exple1 13536 bernneq 13586 modexp 13595 faclbnd4lem1 13649 faclbnd4lem3 13651 faclbnd4lem4 13652 cjexp 14501 absexp 14656 binom 15177 incexclem 15183 incexc 15184 climcndslem1 15196 pwdif 15215 fprodconst 15324 fallfac0 15374 bpoly0 15396 ege2le3 15435 eft0val 15457 demoivreALT 15546 pwp1fsum 15732 bits0 15767 0bits 15778 bitsinv1 15781 sadcadd 15797 smumullem 15831 numexp0 16402 psgnunilem4 18617 psgn0fv0 18631 psgnsn 18640 psgnprfval1 18642 cnfldexp 20124 expmhm 20160 expcn 23477 iblcnlem1 24391 itgcnlem 24393 dvexp 24556 dvexp2 24557 plyconst 24803 0dgr 24842 0dgrb 24843 aaliou3lem2 24939 cxp0 25261 1cubr 25428 log2ublem3 25534 basellem2 25667 basellem5 25670 lgsquad2lem2 25969 0dp2dp 30611 oddpwdc 31722 breprexp 32014 subfacval2 32547 fwddifn0 33738 stoweidlem19 42661 fmtno0 44057 bits0ALTV 44197 0dig2nn0e 45026 0dig2nn0o 45027 nn0sumshdiglemA 45033 nn0sumshdiglemB 45034 nn0sumshdiglem1 45035 nn0sumshdiglem2 45036 |
Copyright terms: Public domain | W3C validator |