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 11388 | . . 3 ⊢ 0 ∈ ℤ | |
2 | expval 12862 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 0 ∈ ℤ) → (𝐴↑0) = if(0 = 0, 1, if(0 < 0, (seq1( · , (ℕ × {𝐴}))‘0), (1 / (seq1( · , (ℕ × {𝐴}))‘-0))))) | |
3 | 1, 2 | mpan2 707 | . 2 ⊢ (𝐴 ∈ ℂ → (𝐴↑0) = if(0 = 0, 1, if(0 < 0, (seq1( · , (ℕ × {𝐴}))‘0), (1 / (seq1( · , (ℕ × {𝐴}))‘-0))))) |
4 | eqid 2622 | . . 3 ⊢ 0 = 0 | |
5 | 4 | iftruei 4093 | . 2 ⊢ if(0 = 0, 1, if(0 < 0, (seq1( · , (ℕ × {𝐴}))‘0), (1 / (seq1( · , (ℕ × {𝐴}))‘-0)))) = 1 |
6 | 3, 5 | syl6eq 2672 | 1 ⊢ (𝐴 ∈ ℂ → (𝐴↑0) = 1) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1483 ∈ wcel 1990 ifcif 4086 {csn 4177 class class class wbr 4653 × cxp 5112 ‘cfv 5888 (class class class)co 6650 ℂcc 9934 0cc0 9936 1c1 9937 · cmul 9941 < clt 10074 -cneg 10267 / cdiv 10684 ℕcn 11020 ℤcz 11377 seqcseq 12801 ↑cexp 12860 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pr 4906 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-i2m1 10004 ax-1ne0 10005 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-sbc 3436 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-iota 5851 df-fun 5890 df-fv 5896 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-neg 10269 df-z 11378 df-seq 12802 df-exp 12861 |
This theorem is referenced by: 0exp0e1 12865 expp1 12867 expneg 12868 expcllem 12871 mulexp 12899 expadd 12902 expmul 12905 leexp1a 12919 exple1 12920 bernneq 12990 modexp 12999 exp0d 13002 faclbnd4lem1 13080 faclbnd4lem3 13082 faclbnd4lem4 13083 cjexp 13890 absexp 14044 binom 14562 incexclem 14568 incexc 14569 climcndslem1 14581 fprodconst 14708 fallfac0 14759 bpoly0 14781 ege2le3 14820 eft0val 14842 demoivreALT 14931 pwp1fsum 15114 bits0 15150 0bits 15161 bitsinv1 15164 sadcadd 15180 smumullem 15214 numexp0 15780 psgnunilem4 17917 psgn0fv0 17931 psgnsn 17940 psgnprfval1 17942 cnfldexp 19779 expmhm 19815 expcn 22675 iblcnlem1 23554 itgcnlem 23556 dvexp 23716 dvexp2 23717 plyconst 23962 0dgr 24001 0dgrb 24002 aaliou3lem2 24098 cxp0 24416 1cubr 24569 log2ublem3 24675 basellem2 24808 basellem5 24811 lgsquad2lem2 25110 0dp2dp 29617 oddpwdc 30416 breprexp 30711 subfacval2 31169 fwddifn0 32271 stoweidlem19 40236 fmtno0 41452 pwdif 41501 bits0ALTV 41590 0dig2nn0e 42406 0dig2nn0o 42407 nn0sumshdiglemA 42413 nn0sumshdiglemB 42414 nn0sumshdiglem1 42415 nn0sumshdiglem2 42416 |
Copyright terms: Public domain | W3C validator |