| 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 10816 and expap0i 10823. (Contributed by Jim Kingdon, 9-Jun-2020.) |
| Ref | Expression |
|---|---|
| expclzaplem | ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | breq1 4089 | . . . . 5 ⊢ (𝑧 = 𝐴 → (𝑧 # 0 ↔ 𝐴 # 0)) | |
| 2 | 1 | elrab 2960 | . . . 4 ⊢ (𝐴 ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0} ↔ (𝐴 ∈ ℂ ∧ 𝐴 # 0)) |
| 3 | ssrab2 3310 | . . . . . 6 ⊢ {𝑧 ∈ ℂ ∣ 𝑧 # 0} ⊆ ℂ | |
| 4 | breq1 4089 | . . . . . . . 8 ⊢ (𝑧 = 𝑥 → (𝑧 # 0 ↔ 𝑥 # 0)) | |
| 5 | 4 | elrab 2960 | . . . . . . 7 ⊢ (𝑥 ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0} ↔ (𝑥 ∈ ℂ ∧ 𝑥 # 0)) |
| 6 | breq1 4089 | . . . . . . . 8 ⊢ (𝑧 = 𝑦 → (𝑧 # 0 ↔ 𝑦 # 0)) | |
| 7 | 6 | elrab 2960 | . . . . . . 7 ⊢ (𝑦 ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0} ↔ (𝑦 ∈ ℂ ∧ 𝑦 # 0)) |
| 8 | mulcl 8149 | . . . . . . . . 9 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 · 𝑦) ∈ ℂ) | |
| 9 | 8 | ad2ant2r 509 | . . . . . . . 8 ⊢ (((𝑥 ∈ ℂ ∧ 𝑥 # 0) ∧ (𝑦 ∈ ℂ ∧ 𝑦 # 0)) → (𝑥 · 𝑦) ∈ ℂ) |
| 10 | mulap0 8824 | . . . . . . . 8 ⊢ (((𝑥 ∈ ℂ ∧ 𝑥 # 0) ∧ (𝑦 ∈ ℂ ∧ 𝑦 # 0)) → (𝑥 · 𝑦) # 0) | |
| 11 | breq1 4089 | . . . . . . . . 9 ⊢ (𝑧 = (𝑥 · 𝑦) → (𝑧 # 0 ↔ (𝑥 · 𝑦) # 0)) | |
| 12 | 11 | elrab 2960 | . . . . . . . 8 ⊢ ((𝑥 · 𝑦) ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0} ↔ ((𝑥 · 𝑦) ∈ ℂ ∧ (𝑥 · 𝑦) # 0)) |
| 13 | 9, 10, 12 | sylanbrc 417 | . . . . . . 7 ⊢ (((𝑥 ∈ ℂ ∧ 𝑥 # 0) ∧ (𝑦 ∈ ℂ ∧ 𝑦 # 0)) → (𝑥 · 𝑦) ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0}) |
| 14 | 5, 7, 13 | syl2anb 291 | . . . . . 6 ⊢ ((𝑥 ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0} ∧ 𝑦 ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0}) → (𝑥 · 𝑦) ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0}) |
| 15 | ax-1cn 8115 | . . . . . . 7 ⊢ 1 ∈ ℂ | |
| 16 | 1ap0 8760 | . . . . . . 7 ⊢ 1 # 0 | |
| 17 | breq1 4089 | . . . . . . . 8 ⊢ (𝑧 = 1 → (𝑧 # 0 ↔ 1 # 0)) | |
| 18 | 17 | elrab 2960 | . . . . . . 7 ⊢ (1 ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0} ↔ (1 ∈ ℂ ∧ 1 # 0)) |
| 19 | 15, 16, 18 | mpbir2an 948 | . . . . . 6 ⊢ 1 ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0} |
| 20 | recclap 8849 | . . . . . . . . 9 ⊢ ((𝑥 ∈ ℂ ∧ 𝑥 # 0) → (1 / 𝑥) ∈ ℂ) | |
| 21 | recap0 8855 | . . . . . . . . 9 ⊢ ((𝑥 ∈ ℂ ∧ 𝑥 # 0) → (1 / 𝑥) # 0) | |
| 22 | 20, 21 | jca 306 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℂ ∧ 𝑥 # 0) → ((1 / 𝑥) ∈ ℂ ∧ (1 / 𝑥) # 0)) |
| 23 | breq1 4089 | . . . . . . . . 9 ⊢ (𝑧 = (1 / 𝑥) → (𝑧 # 0 ↔ (1 / 𝑥) # 0)) | |
| 24 | 23 | elrab 2960 | . . . . . . . 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 10803 | . . . . 5 ⊢ ((𝐴 ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0} ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0}) |
| 28 | 27 | 3expia 1229 | . . . 4 ⊢ ((𝐴 ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0} ∧ 𝐴 # 0) → (𝑁 ∈ ℤ → (𝐴↑𝑁) ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0})) |
| 29 | 2, 28 | sylanbr 285 | . . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 # 0) ∧ 𝐴 # 0) → (𝑁 ∈ ℤ → (𝐴↑𝑁) ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0})) |
| 30 | 29 | anabss3 585 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0) → (𝑁 ∈ ℤ → (𝐴↑𝑁) ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0})) |
| 31 | 30 | 3impia 1224 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0}) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1002 ∈ wcel 2200 {crab 2512 class class class wbr 4086 (class class class)co 6013 ℂcc 8020 0cc0 8022 1c1 8023 · cmul 8027 # cap 8751 / cdiv 8842 ℤcz 9469 ↑cexp 10790 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4202 ax-sep 4205 ax-nul 4213 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-iinf 4684 ax-cnex 8113 ax-resscn 8114 ax-1cn 8115 ax-1re 8116 ax-icn 8117 ax-addcl 8118 ax-addrcl 8119 ax-mulcl 8120 ax-mulrcl 8121 ax-addcom 8122 ax-mulcom 8123 ax-addass 8124 ax-mulass 8125 ax-distr 8126 ax-i2m1 8127 ax-0lt1 8128 ax-1rid 8129 ax-0id 8130 ax-rnegex 8131 ax-precex 8132 ax-cnre 8133 ax-pre-ltirr 8134 ax-pre-ltwlin 8135 ax-pre-lttrn 8136 ax-pre-apti 8137 ax-pre-ltadd 8138 ax-pre-mulgt0 8139 ax-pre-mulext 8140 |
| This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2802 df-sbc 3030 df-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-nul 3493 df-if 3604 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 df-tr 4186 df-id 4388 df-po 4391 df-iso 4392 df-iord 4461 df-on 4463 df-ilim 4464 df-suc 4466 df-iom 4687 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-1st 6298 df-2nd 6299 df-recs 6466 df-frec 6552 df-pnf 8206 df-mnf 8207 df-xr 8208 df-ltxr 8209 df-le 8210 df-sub 8342 df-neg 8343 df-reap 8745 df-ap 8752 df-div 8843 df-inn 9134 df-n0 9393 df-z 9470 df-uz 9746 df-seqfrec 10700 df-exp 10791 |
| This theorem is referenced by: expclzap 10816 expap0i 10823 expghmap 14611 lgsne0 15757 |
| Copyright terms: Public domain | W3C validator |