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

Theorem elgz 16902
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 6858 . . . . 5 (𝑥 = 𝐴 → (ℜ‘𝑥) = (ℜ‘𝐴))
21eleq1d 2813 . . . 4 (𝑥 = 𝐴 → ((ℜ‘𝑥) ∈ ℤ ↔ (ℜ‘𝐴) ∈ ℤ))
3 fveq2 6858 . . . . 5 (𝑥 = 𝐴 → (ℑ‘𝑥) = (ℑ‘𝐴))
43eleq1d 2813 . . . 4 (𝑥 = 𝐴 → ((ℑ‘𝑥) ∈ ℤ ↔ (ℑ‘𝐴) ∈ ℤ))
52, 4anbi12d 632 . . 3 (𝑥 = 𝐴 → (((ℜ‘𝑥) ∈ ℤ ∧ (ℑ‘𝑥) ∈ ℤ) ↔ ((ℜ‘𝐴) ∈ ℤ ∧ (ℑ‘𝐴) ∈ ℤ)))
6 df-gz 16901 . . 3 ℤ[i] = {𝑥 ∈ ℂ ∣ ((ℜ‘𝑥) ∈ ℤ ∧ (ℑ‘𝑥) ∈ ℤ)}
75, 6elrab2 3662 . 2 (𝐴 ∈ ℤ[i] ↔ (𝐴 ∈ ℂ ∧ ((ℜ‘𝐴) ∈ ℤ ∧ (ℑ‘𝐴) ∈ ℤ)))
8 3anass 1094 . 2 ((𝐴 ∈ ℂ ∧ (ℜ‘𝐴) ∈ ℤ ∧ (ℑ‘𝐴) ∈ ℤ) ↔ (𝐴 ∈ ℂ ∧ ((ℜ‘𝐴) ∈ ℤ ∧ (ℑ‘𝐴) ∈ ℤ)))
97, 8bitr4i 278 1 (𝐴 ∈ ℤ[i] ↔ (𝐴 ∈ ℂ ∧ (ℜ‘𝐴) ∈ ℤ ∧ (ℑ‘𝐴) ∈ ℤ))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395  w3a 1086   = wceq 1540  wcel 2109  cfv 6511  cc 11066  cz 12529  cre 15063  cim 15064  ℤ[i]cgz 16900
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 2008  ax-8 2111  ax-9 2119  ax-ext 2701
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-iota 6464  df-fv 6519  df-gz 16901
This theorem is referenced by:  gzcn  16903  zgz  16904  igz  16905  gznegcl  16906  gzcjcl  16907  gzaddcl  16908  gzmulcl  16909  gzabssqcl  16912  4sqlem4a  16922  2sqlem2  27329  2sqlem3  27331  cntotbnd  37790
  Copyright terms: Public domain W3C validator