| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > gzcn | Structured version Visualization version GIF version | ||
| Description: A gaussian integer is a complex number. (Contributed by Mario Carneiro, 14-Jul-2014.) |
| Ref | Expression |
|---|---|
| gzcn | ⊢ (𝐴 ∈ ℤ[i] → 𝐴 ∈ ℂ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elgz 17155 | . 2 ⊢ (𝐴 ∈ ℤ[i] ↔ (𝐴 ∈ ℂ ∧ (ℜ‘𝐴) ∈ ℤ ∧ (ℑ‘𝐴) ∈ ℤ)) | |
| 2 | 1 | simp1bi 1164 | 1 ⊢ (𝐴 ∈ ℤ[i] → 𝐴 ∈ ℂ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∈ wcel 2150 ‘cfv 6565 ℂcc 11236 ℤcz 12732 ℜcre 15306 ℑcim 15307 ℤ[i]cgz 17153 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-ext 2738 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-sb 2104 df-clab 2745 df-cleq 2758 df-clel 2842 df-rab 3416 df-v 3455 df-ss 3900 df-dif 4049 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-br 5108 df-iota 6519 df-fv 6573 df-gz 17154 |
| This theorem is used by: gznegcl 17159 gzcjcl 17160 gzaddcl 17161 gzmulcl 17162 gzsubcl 17164 gzabssqcl 17165 4sqlem4a 17175 4sqlem4 17176 mul4sqlem 17177 mul4sq 17178 4sqlem12 17180 4sqlem17 17185 gzsubrg 21783 gzrngunitlem 21794 gzrngunit 21795 2sqlem2 27804 mul2sq 27805 2sqlem3 27806 cntotbnd 38998 |
| Copyright terms: Public domain | W3C validator |