| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elgz | Structured version Visualization version GIF version | ||
| Description: Elementhood in the gaussian integers. (Contributed by Mario Carneiro, 14-Jul-2014.) |
| Ref | Expression |
|---|---|
| elgz | ⊢ (𝐴 ∈ ℤ[i] ↔ (𝐴 ∈ ℂ ∧ (ℜ‘𝐴) ∈ ℤ ∧ (ℑ‘𝐴) ∈ ℤ)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fveq2 6831 | . . . . 5 ⊢ (𝑥 = 𝐴 → (ℜ‘𝑥) = (ℜ‘𝐴)) | |
| 2 | 1 | eleq1d 2826 | . . . 4 ⊢ (𝑥 = 𝐴 → ((ℜ‘𝑥) ∈ ℤ ↔ (ℜ‘𝐴) ∈ ℤ)) |
| 3 | fveq2 6831 | . . . . 5 ⊢ (𝑥 = 𝐴 → (ℑ‘𝑥) = (ℑ‘𝐴)) | |
| 4 | 3 | eleq1d 2826 | . . . 4 ⊢ (𝑥 = 𝐴 → ((ℑ‘𝑥) ∈ ℤ ↔ (ℑ‘𝐴) ∈ ℤ)) |
| 5 | 2, 4 | anbi12d 639 | . . 3 ⊢ (𝑥 = 𝐴 → (((ℜ‘𝑥) ∈ ℤ ∧ (ℑ‘𝑥) ∈ ℤ) ↔ ((ℜ‘𝐴) ∈ ℤ ∧ (ℑ‘𝐴) ∈ ℤ))) |
| 6 | df-gz 16896 | . . 3 ⊢ ℤ[i] = {𝑥 ∈ ℂ ∣ ((ℜ‘𝑥) ∈ ℤ ∧ (ℑ‘𝑥) ∈ ℤ)} | |
| 7 | 5, 6 | elrab2 3634 | . 2 ⊢ (𝐴 ∈ ℤ[i] ↔ (𝐴 ∈ ℂ ∧ ((ℜ‘𝐴) ∈ ℤ ∧ (ℑ‘𝐴) ∈ ℤ))) |
| 8 | 3anass 1101 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ (ℜ‘𝐴) ∈ ℤ ∧ (ℑ‘𝐴) ∈ ℤ) ↔ (𝐴 ∈ ℂ ∧ ((ℜ‘𝐴) ∈ ℤ ∧ (ℑ‘𝐴) ∈ ℤ))) | |
| 9 | 7, 8 | bitr4i 280 | 1 ⊢ (𝐴 ∈ ℤ[i] ↔ (𝐴 ∈ ℂ ∧ (ℜ‘𝐴) ∈ ℤ ∧ (ℑ‘𝐴) ∈ ℤ)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 208 ∧ wa 397 ∧ w3a 1093 = wceq 1548 ∈ wcel 2121 ‘cfv 6489 ℂcc 11031 ℤcz 12519 ℜcre 15054 ℑcim 15055 ℤ[i]cgz 16895 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-ext 2713 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-sb 2075 df-clab 2720 df-cleq 2733 df-clel 2816 df-rab 3394 df-v 3435 df-dif 3888 df-un 3890 df-ss 3902 df-nul 4265 df-if 4458 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4842 df-br 5076 df-iota 6445 df-fv 6497 df-gz 16896 |
| This theorem is referenced by: gzcn 16898 zgz 16899 igz 16900 gznegcl 16901 gzcjcl 16902 gzaddcl 16903 gzmulcl 16904 gzabssqcl 16907 4sqlem4a 16917 2sqlem2 27403 2sqlem3 27405 cntotbnd 38178 |
| Copyright terms: Public domain | W3C validator |