MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  elgz Structured version   Visualization version   GIF version

Theorem elgz 16969
Description: Elementhood in the gaussian integers. (Contributed by Mario Carneiro, 14-Jul-2014.)
Assertion
Ref Expression
elgz (𝐴 ∈ ℤ[i] ↔ (𝐴 ∈ ℂ ∧ (ℜ‘𝐴) ∈ ℤ ∧ (ℑ‘𝐴) ∈ ℤ))

Proof of Theorem elgz
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 fveq2 6869 . . . . 5 (𝑥 = 𝐴 → (ℜ‘𝑥) = (ℜ‘𝐴))
21eleq1d 2849 . . . 4 (𝑥 = 𝐴 → ((ℜ‘𝑥) ∈ ℤ ↔ (ℜ‘𝐴) ∈ ℤ))
3 fveq2 6869 . . . . 5 (𝑥 = 𝐴 → (ℑ‘𝑥) = (ℑ‘𝐴))
43eleq1d 2849 . . . 4 (𝑥 = 𝐴 → ((ℑ‘𝑥) ∈ ℤ ↔ (ℑ‘𝐴) ∈ ℤ))
52, 4anbi12d 641 . . 3 (𝑥 = 𝐴 → (((ℜ‘𝑥) ∈ ℤ ∧ (ℑ‘𝑥) ∈ ℤ) ↔ ((ℜ‘𝐴) ∈ ℤ ∧ (ℑ‘𝐴) ∈ ℤ)))
6 df-gz 16968 . . 3 ℤ[i] = {𝑥 ∈ ℂ ∣ ((ℜ‘𝑥) ∈ ℤ ∧ (ℑ‘𝑥) ∈ ℤ)}
75, 6elrab2 3656 . 2 (𝐴 ∈ ℤ[i] ↔ (𝐴 ∈ ℂ ∧ ((ℜ‘𝐴) ∈ ℤ ∧ (ℑ‘𝐴) ∈ ℤ)))
8 3anass 1107 . 2 ((𝐴 ∈ ℂ ∧ (ℜ‘𝐴) ∈ ℤ ∧ (ℑ‘𝐴) ∈ ℤ) ↔ (𝐴 ∈ ℂ ∧ ((ℜ‘𝐴) ∈ ℤ ∧ (ℑ‘𝐴) ∈ ℤ)))
97, 8bitr4i 280 1 (𝐴 ∈ ℤ[i] ↔ (𝐴 ∈ ℂ ∧ (ℜ‘𝐴) ∈ ℤ ∧ (ℑ‘𝐴) ∈ ℤ))
Colors of variables: wff setvar class
Syntax hints:  wb 208  wa 399  w3a 1099   = wceq 1562  wcel 2144  cfv 6523  cc 11073  cz 12570  cre 15126  cim 15127  ℤ[i]cgz 16967
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-ext 2736
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-sb 2093  df-clab 2743  df-cleq 2756  df-clel 2839  df-rab 3417  df-v 3458  df-dif 3909  df-un 3911  df-ss 3923  df-nul 4288  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5103  df-iota 6479  df-fv 6531  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  27484  2sqlem3  27486  cntotbnd  38300
  Copyright terms: Public domain W3C validator