Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > expclzlem | Structured version Visualization version GIF version |
Description: Closure law for integer exponentiation. (Contributed by Mario Carneiro, 4-Jun-2014.) |
Ref | Expression |
---|---|
expclzlem | ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ∈ (ℂ ∖ {0})) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eldifsn 4317 | . . . 4 ⊢ (𝐴 ∈ (ℂ ∖ {0}) ↔ (𝐴 ∈ ℂ ∧ 𝐴 ≠ 0)) | |
2 | difss 3737 | . . . . . 6 ⊢ (ℂ ∖ {0}) ⊆ ℂ | |
3 | eldifsn 4317 | . . . . . . 7 ⊢ (𝑥 ∈ (ℂ ∖ {0}) ↔ (𝑥 ∈ ℂ ∧ 𝑥 ≠ 0)) | |
4 | eldifsn 4317 | . . . . . . 7 ⊢ (𝑦 ∈ (ℂ ∖ {0}) ↔ (𝑦 ∈ ℂ ∧ 𝑦 ≠ 0)) | |
5 | mulcl 10020 | . . . . . . . . 9 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 · 𝑦) ∈ ℂ) | |
6 | 5 | ad2ant2r 783 | . . . . . . . 8 ⊢ (((𝑥 ∈ ℂ ∧ 𝑥 ≠ 0) ∧ (𝑦 ∈ ℂ ∧ 𝑦 ≠ 0)) → (𝑥 · 𝑦) ∈ ℂ) |
7 | mulne0 10669 | . . . . . . . 8 ⊢ (((𝑥 ∈ ℂ ∧ 𝑥 ≠ 0) ∧ (𝑦 ∈ ℂ ∧ 𝑦 ≠ 0)) → (𝑥 · 𝑦) ≠ 0) | |
8 | eldifsn 4317 | . . . . . . . 8 ⊢ ((𝑥 · 𝑦) ∈ (ℂ ∖ {0}) ↔ ((𝑥 · 𝑦) ∈ ℂ ∧ (𝑥 · 𝑦) ≠ 0)) | |
9 | 6, 7, 8 | sylanbrc 698 | . . . . . . 7 ⊢ (((𝑥 ∈ ℂ ∧ 𝑥 ≠ 0) ∧ (𝑦 ∈ ℂ ∧ 𝑦 ≠ 0)) → (𝑥 · 𝑦) ∈ (ℂ ∖ {0})) |
10 | 3, 4, 9 | syl2anb 496 | . . . . . 6 ⊢ ((𝑥 ∈ (ℂ ∖ {0}) ∧ 𝑦 ∈ (ℂ ∖ {0})) → (𝑥 · 𝑦) ∈ (ℂ ∖ {0})) |
11 | ax-1cn 9994 | . . . . . . 7 ⊢ 1 ∈ ℂ | |
12 | ax-1ne0 10005 | . . . . . . 7 ⊢ 1 ≠ 0 | |
13 | eldifsn 4317 | . . . . . . 7 ⊢ (1 ∈ (ℂ ∖ {0}) ↔ (1 ∈ ℂ ∧ 1 ≠ 0)) | |
14 | 11, 12, 13 | mpbir2an 955 | . . . . . 6 ⊢ 1 ∈ (ℂ ∖ {0}) |
15 | reccl 10692 | . . . . . . . . 9 ⊢ ((𝑥 ∈ ℂ ∧ 𝑥 ≠ 0) → (1 / 𝑥) ∈ ℂ) | |
16 | recne0 10698 | . . . . . . . . 9 ⊢ ((𝑥 ∈ ℂ ∧ 𝑥 ≠ 0) → (1 / 𝑥) ≠ 0) | |
17 | 15, 16 | jca 554 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℂ ∧ 𝑥 ≠ 0) → ((1 / 𝑥) ∈ ℂ ∧ (1 / 𝑥) ≠ 0)) |
18 | eldifsn 4317 | . . . . . . . 8 ⊢ ((1 / 𝑥) ∈ (ℂ ∖ {0}) ↔ ((1 / 𝑥) ∈ ℂ ∧ (1 / 𝑥) ≠ 0)) | |
19 | 17, 3, 18 | 3imtr4i 281 | . . . . . . 7 ⊢ (𝑥 ∈ (ℂ ∖ {0}) → (1 / 𝑥) ∈ (ℂ ∖ {0})) |
20 | 19 | adantr 481 | . . . . . 6 ⊢ ((𝑥 ∈ (ℂ ∖ {0}) ∧ 𝑥 ≠ 0) → (1 / 𝑥) ∈ (ℂ ∖ {0})) |
21 | 2, 10, 14, 20 | expcl2lem 12872 | . . . . 5 ⊢ ((𝐴 ∈ (ℂ ∖ {0}) ∧ 𝐴 ≠ 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ∈ (ℂ ∖ {0})) |
22 | 21 | 3expia 1267 | . . . 4 ⊢ ((𝐴 ∈ (ℂ ∖ {0}) ∧ 𝐴 ≠ 0) → (𝑁 ∈ ℤ → (𝐴↑𝑁) ∈ (ℂ ∖ {0}))) |
23 | 1, 22 | sylanbr 490 | . . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≠ 0) → (𝑁 ∈ ℤ → (𝐴↑𝑁) ∈ (ℂ ∖ {0}))) |
24 | 23 | anabss3 864 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) → (𝑁 ∈ ℤ → (𝐴↑𝑁) ∈ (ℂ ∖ {0}))) |
25 | 24 | 3impia 1261 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ∈ (ℂ ∖ {0})) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 ∧ w3a 1037 ∈ wcel 1990 ≠ wne 2794 ∖ cdif 3571 {csn 4177 (class class class)co 6650 ℂcc 9934 0cc0 9936 1c1 9937 · cmul 9941 / cdiv 10684 ℤcz 11377 ↑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-8 1992 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-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 |
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-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 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-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-er 7742 df-en 7956 df-dom 7957 df-sdom 7958 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-div 10685 df-nn 11021 df-n0 11293 df-z 11378 df-uz 11688 df-seq 12802 df-exp 12861 |
This theorem is referenced by: expclz 12885 expne0i 12892 expghm 19844 |
Copyright terms: Public domain | W3C validator |