| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > expclzaplem | GIF version | ||
| Description: Closure law for integer exponentiation. Lemma for expclzap 10979 and expap0i 10986. (Contributed by Jim Kingdon, 9-Jun-2020.) |
| Ref | Expression |
|---|---|
| expclzaplem | ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | breq1 4128 | . . . . 5 ⊢ (𝑧 = 𝐴 → (𝑧 # 0 ↔ 𝐴 # 0)) | |
| 2 | 1 | elrab 2982 | . . . 4 ⊢ (𝐴 ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0} ↔ (𝐴 ∈ ℂ ∧ 𝐴 # 0)) |
| 3 | ssrab2 3333 | . . . . . 6 ⊢ {𝑧 ∈ ℂ ∣ 𝑧 # 0} ⊆ ℂ | |
| 4 | breq1 4128 | . . . . . . . 8 ⊢ (𝑧 = 𝑥 → (𝑧 # 0 ↔ 𝑥 # 0)) | |
| 5 | 4 | elrab 2982 | . . . . . . 7 ⊢ (𝑥 ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0} ↔ (𝑥 ∈ ℂ ∧ 𝑥 # 0)) |
| 6 | breq1 4128 | . . . . . . . 8 ⊢ (𝑧 = 𝑦 → (𝑧 # 0 ↔ 𝑦 # 0)) | |
| 7 | 6 | elrab 2982 | . . . . . . 7 ⊢ (𝑦 ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0} ↔ (𝑦 ∈ ℂ ∧ 𝑦 # 0)) |
| 8 | mulcl 8296 | . . . . . . . . 9 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 · 𝑦) ∈ ℂ) | |
| 9 | 8 | ad2ant2r 513 | . . . . . . . 8 ⊢ (((𝑥 ∈ ℂ ∧ 𝑥 # 0) ∧ (𝑦 ∈ ℂ ∧ 𝑦 # 0)) → (𝑥 · 𝑦) ∈ ℂ) |
| 10 | mulap0 8972 | . . . . . . . 8 ⊢ (((𝑥 ∈ ℂ ∧ 𝑥 # 0) ∧ (𝑦 ∈ ℂ ∧ 𝑦 # 0)) → (𝑥 · 𝑦) # 0) | |
| 11 | breq1 4128 | . . . . . . . . 9 ⊢ (𝑧 = (𝑥 · 𝑦) → (𝑧 # 0 ↔ (𝑥 · 𝑦) # 0)) | |
| 12 | 11 | elrab 2982 | . . . . . . . 8 ⊢ ((𝑥 · 𝑦) ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0} ↔ ((𝑥 · 𝑦) ∈ ℂ ∧ (𝑥 · 𝑦) # 0)) |
| 13 | 9, 10, 12 | sylanbrc 421 | . . . . . . 7 ⊢ (((𝑥 ∈ ℂ ∧ 𝑥 # 0) ∧ (𝑦 ∈ ℂ ∧ 𝑦 # 0)) → (𝑥 · 𝑦) ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0}) |
| 14 | 5, 7, 13 | syl2anb 291 | . . . . . 6 ⊢ ((𝑥 ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0} ∧ 𝑦 ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0}) → (𝑥 · 𝑦) ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0}) |
| 15 | ax-1cn 8262 | . . . . . . 7 ⊢ 1 ∈ ℂ | |
| 16 | 1ap0 8908 | . . . . . . 7 ⊢ 1 # 0 | |
| 17 | breq1 4128 | . . . . . . . 8 ⊢ (𝑧 = 1 → (𝑧 # 0 ↔ 1 # 0)) | |
| 18 | 17 | elrab 2982 | . . . . . . 7 ⊢ (1 ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0} ↔ (1 ∈ ℂ ∧ 1 # 0)) |
| 19 | 15, 16, 18 | mpbir2an 955 | . . . . . 6 ⊢ 1 ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0} |
| 20 | recclap 8999 | . . . . . . . . 9 ⊢ ((𝑥 ∈ ℂ ∧ 𝑥 # 0) → (1 / 𝑥) ∈ ℂ) | |
| 21 | recap0 9005 | . . . . . . . . 9 ⊢ ((𝑥 ∈ ℂ ∧ 𝑥 # 0) → (1 / 𝑥) # 0) | |
| 22 | 20, 21 | jca 306 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℂ ∧ 𝑥 # 0) → ((1 / 𝑥) ∈ ℂ ∧ (1 / 𝑥) # 0)) |
| 23 | breq1 4128 | . . . . . . . . 9 ⊢ (𝑧 = (1 / 𝑥) → (𝑧 # 0 ↔ (1 / 𝑥) # 0)) | |
| 24 | 23 | elrab 2982 | . . . . . . . 8 ⊢ ((1 / 𝑥) ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0} ↔ ((1 / 𝑥) ∈ ℂ ∧ (1 / 𝑥) # 0)) |
| 25 | 22, 5, 24 | 3imtr4i 201 | . . . . . . 7 ⊢ (𝑥 ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0} → (1 / 𝑥) ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0}) |
| 26 | 25 | adantr 276 | . . . . . 6 ⊢ ((𝑥 ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0} ∧ 𝑥 # 0) → (1 / 𝑥) ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0}) |
| 27 | 3, 14, 19, 26 | expcl2lemap 10966 | . . . . 5 ⊢ ((𝐴 ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0} ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0}) |
| 28 | 27 | 3expia 1236 | . . . 4 ⊢ ((𝐴 ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0} ∧ 𝐴 # 0) → (𝑁 ∈ ℤ → (𝐴↑𝑁) ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0})) |
| 29 | 2, 28 | sylanbr 285 | . . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 # 0) ∧ 𝐴 # 0) → (𝑁 ∈ ℤ → (𝐴↑𝑁) ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0})) |
| 30 | 29 | anabss3 591 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0) → (𝑁 ∈ ℤ → (𝐴↑𝑁) ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0})) |
| 31 | 30 | 3impia 1231 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0}) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1009 ∈ wcel 2209 {crab 2532 class class class wbr 4125 (class class class)co 6075 ℂcc 8167 0cc0 8169 1c1 8170 · cmul 8174 # cap 8899 / cdiv 8992 ℤcz 9623 ↑cexp 10953 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4241 ax-sep 4244 ax-nul 4254 ax-pow 4306 ax-pr 4341 ax-un 4573 ax-setind 4679 ax-iinf 4730 ax-cnex 8260 ax-resscn 8261 ax-1cn 8262 ax-1re 8263 ax-icn 8264 ax-addcl 8265 ax-addrcl 8266 ax-mulcl 8267 ax-mulrcl 8268 ax-addcom 8269 ax-mulcom 8270 ax-addass 8271 ax-mulass 8272 ax-distr 8273 ax-i2m1 8274 ax-0lt1 8275 ax-1rid 8276 ax-0id 8277 ax-rnegex 8278 ax-precex 8279 ax-cnre 8280 ax-pre-ltirr 8281 ax-pre-ltwlin 8282 ax-pre-lttrn 8283 ax-pre-apti 8284 ax-pre-ltadd 8285 ax-pre-mulgt0 8286 ax-pre-mulext 8287 |
| This theorem depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3636 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-int 3966 df-iun 4009 df-br 4126 df-opab 4188 df-mpt 4189 df-tr 4225 df-id 4433 df-po 4436 df-iso 4437 df-iord 4506 df-on 4508 df-ilim 4509 df-suc 4511 df-iom 4733 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-rn 4780 df-res 4781 df-ima 4782 df-iota 5332 df-fun 5374 df-fn 5375 df-f 5376 df-f1 5377 df-fo 5378 df-f1o 5379 df-fv 5380 df-riota 6028 df-ov 6078 df-oprab 6079 df-mpo 6080 df-1st 6364 df-2nd 6365 df-recs 6566 df-frec 6652 df-pnf 8352 df-mnf 8353 df-xr 8354 df-ltxr 8355 df-le 8356 df-sub 8489 df-neg 8490 df-reap 8893 df-ap 8900 df-div 8993 df-inn 9284 df-n0 9543 df-z 9624 df-uz 9901 df-seqfrec 10863 df-exp 10954 |
| This theorem is referenced by: expclzap 10979 expap0i 10986 expghmap 14914 lgsne0 16071 |
| Copyright terms: Public domain | W3C validator |