| 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 10798 and expap0i 10805. (Contributed by Jim Kingdon, 9-Jun-2020.) |
| Ref | Expression |
|---|---|
| expclzaplem | ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | breq1 4086 | . . . . 5 ⊢ (𝑧 = 𝐴 → (𝑧 # 0 ↔ 𝐴 # 0)) | |
| 2 | 1 | elrab 2959 | . . . 4 ⊢ (𝐴 ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0} ↔ (𝐴 ∈ ℂ ∧ 𝐴 # 0)) |
| 3 | ssrab2 3309 | . . . . . 6 ⊢ {𝑧 ∈ ℂ ∣ 𝑧 # 0} ⊆ ℂ | |
| 4 | breq1 4086 | . . . . . . . 8 ⊢ (𝑧 = 𝑥 → (𝑧 # 0 ↔ 𝑥 # 0)) | |
| 5 | 4 | elrab 2959 | . . . . . . 7 ⊢ (𝑥 ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0} ↔ (𝑥 ∈ ℂ ∧ 𝑥 # 0)) |
| 6 | breq1 4086 | . . . . . . . 8 ⊢ (𝑧 = 𝑦 → (𝑧 # 0 ↔ 𝑦 # 0)) | |
| 7 | 6 | elrab 2959 | . . . . . . 7 ⊢ (𝑦 ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0} ↔ (𝑦 ∈ ℂ ∧ 𝑦 # 0)) |
| 8 | mulcl 8137 | . . . . . . . . 9 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 · 𝑦) ∈ ℂ) | |
| 9 | 8 | ad2ant2r 509 | . . . . . . . 8 ⊢ (((𝑥 ∈ ℂ ∧ 𝑥 # 0) ∧ (𝑦 ∈ ℂ ∧ 𝑦 # 0)) → (𝑥 · 𝑦) ∈ ℂ) |
| 10 | mulap0 8812 | . . . . . . . 8 ⊢ (((𝑥 ∈ ℂ ∧ 𝑥 # 0) ∧ (𝑦 ∈ ℂ ∧ 𝑦 # 0)) → (𝑥 · 𝑦) # 0) | |
| 11 | breq1 4086 | . . . . . . . . 9 ⊢ (𝑧 = (𝑥 · 𝑦) → (𝑧 # 0 ↔ (𝑥 · 𝑦) # 0)) | |
| 12 | 11 | elrab 2959 | . . . . . . . 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 8103 | . . . . . . 7 ⊢ 1 ∈ ℂ | |
| 16 | 1ap0 8748 | . . . . . . 7 ⊢ 1 # 0 | |
| 17 | breq1 4086 | . . . . . . . 8 ⊢ (𝑧 = 1 → (𝑧 # 0 ↔ 1 # 0)) | |
| 18 | 17 | elrab 2959 | . . . . . . 7 ⊢ (1 ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0} ↔ (1 ∈ ℂ ∧ 1 # 0)) |
| 19 | 15, 16, 18 | mpbir2an 948 | . . . . . 6 ⊢ 1 ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0} |
| 20 | recclap 8837 | . . . . . . . . 9 ⊢ ((𝑥 ∈ ℂ ∧ 𝑥 # 0) → (1 / 𝑥) ∈ ℂ) | |
| 21 | recap0 8843 | . . . . . . . . 9 ⊢ ((𝑥 ∈ ℂ ∧ 𝑥 # 0) → (1 / 𝑥) # 0) | |
| 22 | 20, 21 | jca 306 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℂ ∧ 𝑥 # 0) → ((1 / 𝑥) ∈ ℂ ∧ (1 / 𝑥) # 0)) |
| 23 | breq1 4086 | . . . . . . . . 9 ⊢ (𝑧 = (1 / 𝑥) → (𝑧 # 0 ↔ (1 / 𝑥) # 0)) | |
| 24 | 23 | elrab 2959 | . . . . . . . 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 10785 | . . . . 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 4083 (class class class)co 6007 ℂcc 8008 0cc0 8010 1c1 8011 · cmul 8015 # cap 8739 / cdiv 8830 ℤcz 9457 ↑cexp 10772 |
| 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 4199 ax-sep 4202 ax-nul 4210 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-iinf 4680 ax-cnex 8101 ax-resscn 8102 ax-1cn 8103 ax-1re 8104 ax-icn 8105 ax-addcl 8106 ax-addrcl 8107 ax-mulcl 8108 ax-mulrcl 8109 ax-addcom 8110 ax-mulcom 8111 ax-addass 8112 ax-mulass 8113 ax-distr 8114 ax-i2m1 8115 ax-0lt1 8116 ax-1rid 8117 ax-0id 8118 ax-rnegex 8119 ax-precex 8120 ax-cnre 8121 ax-pre-ltirr 8122 ax-pre-ltwlin 8123 ax-pre-lttrn 8124 ax-pre-apti 8125 ax-pre-ltadd 8126 ax-pre-mulgt0 8127 ax-pre-mulext 8128 |
| 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 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-if 3603 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-tr 4183 df-id 4384 df-po 4387 df-iso 4388 df-iord 4457 df-on 4459 df-ilim 4460 df-suc 4462 df-iom 4683 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-f1 5323 df-fo 5324 df-f1o 5325 df-fv 5326 df-riota 5960 df-ov 6010 df-oprab 6011 df-mpo 6012 df-1st 6292 df-2nd 6293 df-recs 6457 df-frec 6543 df-pnf 8194 df-mnf 8195 df-xr 8196 df-ltxr 8197 df-le 8198 df-sub 8330 df-neg 8331 df-reap 8733 df-ap 8740 df-div 8831 df-inn 9122 df-n0 9381 df-z 9458 df-uz 9734 df-seqfrec 10682 df-exp 10773 |
| This theorem is referenced by: expclzap 10798 expap0i 10805 expghmap 14586 lgsne0 15732 |
| Copyright terms: Public domain | W3C validator |