| 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 6906 | . . . . 5 ⊢ (𝑥 = 𝐴 → (ℜ‘𝑥) = (ℜ‘𝐴)) | |
| 2 | 1 | eleq1d 2826 | . . . 4 ⊢ (𝑥 = 𝐴 → ((ℜ‘𝑥) ∈ ℤ ↔ (ℜ‘𝐴) ∈ ℤ)) |
| 3 | fveq2 6906 | . . . . 5 ⊢ (𝑥 = 𝐴 → (ℑ‘𝑥) = (ℑ‘𝐴)) | |
| 4 | 3 | eleq1d 2826 | . . . 4 ⊢ (𝑥 = 𝐴 → ((ℑ‘𝑥) ∈ ℤ ↔ (ℑ‘𝐴) ∈ ℤ)) |
| 5 | 2, 4 | anbi12d 632 | . . 3 ⊢ (𝑥 = 𝐴 → (((ℜ‘𝑥) ∈ ℤ ∧ (ℑ‘𝑥) ∈ ℤ) ↔ ((ℜ‘𝐴) ∈ ℤ ∧ (ℑ‘𝐴) ∈ ℤ))) |
| 6 | df-gz 16968 | . . 3 ⊢ ℤ[i] = {𝑥 ∈ ℂ ∣ ((ℜ‘𝑥) ∈ ℤ ∧ (ℑ‘𝑥) ∈ ℤ)} | |
| 7 | 5, 6 | elrab2 3695 | . 2 ⊢ (𝐴 ∈ ℤ[i] ↔ (𝐴 ∈ ℂ ∧ ((ℜ‘𝐴) ∈ ℤ ∧ (ℑ‘𝐴) ∈ ℤ))) |
| 8 | 3anass 1095 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ (ℜ‘𝐴) ∈ ℤ ∧ (ℑ‘𝐴) ∈ ℤ) ↔ (𝐴 ∈ ℂ ∧ ((ℜ‘𝐴) ∈ ℤ ∧ (ℑ‘𝐴) ∈ ℤ))) | |
| 9 | 7, 8 | bitr4i 278 | 1 ⊢ (𝐴 ∈ ℤ[i] ↔ (𝐴 ∈ ℂ ∧ (ℜ‘𝐴) ∈ ℤ ∧ (ℑ‘𝐴) ∈ ℤ)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1540 ∈ wcel 2108 ‘cfv 6561 ℂcc 11153 ℤcz 12613 ℜcre 15136 ℑcim 15137 ℤ[i]cgz 16967 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2065 df-clab 2715 df-cleq 2729 df-clel 2816 df-rab 3437 df-v 3482 df-dif 3954 df-un 3956 df-ss 3968 df-nul 4334 df-if 4526 df-sn 4627 df-pr 4629 df-op 4633 df-uni 4908 df-br 5144 df-iota 6514 df-fv 6569 df-gz 16968 |
| This theorem is referenced by: gzcn 16970 zgz 16971 igz 16972 gznegcl 16973 gzcjcl 16974 gzaddcl 16975 gzmulcl 16976 gzabssqcl 16979 4sqlem4a 16989 2sqlem2 27462 2sqlem3 27464 cntotbnd 37803 |
| Copyright terms: Public domain | W3C validator |