Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 0exp0e1 | Structured version Visualization version GIF version |
Description: 0↑0 = 1. This is our convention. It follows the convention used by Gleason; see Part of Definition 10-4.1 of [Gleason] p. 134. (Contributed by David A. Wheeler, 8-Dec-2018.) |
Ref | Expression |
---|---|
0exp0e1 | ⊢ (0↑0) = 1 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0cn 10633 | . 2 ⊢ 0 ∈ ℂ | |
2 | exp0 13434 | . 2 ⊢ (0 ∈ ℂ → (0↑0) = 1) | |
3 | 1, 2 | ax-mp 5 | 1 ⊢ (0↑0) = 1 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1537 ∈ wcel 2114 (class class class)co 7156 ℂcc 10535 0cc0 10537 1c1 10538 ↑cexp 13430 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pr 5330 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-i2m1 10605 ax-rnegex 10608 ax-cnre 10610 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 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 3773 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-br 5067 df-opab 5129 df-mpt 5147 df-id 5460 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-iota 6314 df-fun 6357 df-fv 6363 df-ov 7159 df-oprab 7160 df-mpo 7161 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-neg 10873 df-z 11983 df-seq 13371 df-exp 13431 |
This theorem is referenced by: faclbnd 13651 faclbnd3 13653 faclbnd4lem3 13656 facubnd 13661 ef0lem 15432 coefv0 24838 tayl0 24950 cxpexp 25251 musum 25768 logexprlim 25801 nn0expgcd 39204 etransclem14 42553 exple2lt6 44432 |
Copyright terms: Public domain | W3C validator |