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

Theorem elz 12517
Description: Membership in the set of integers. (Contributed by NM, 8-Jan-2002.)
Assertion
Ref Expression
elz (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ)))

Proof of Theorem elz
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 eqeq1 2743 . . 3 (𝑥 = 𝑁 → (𝑥 = 0 ↔ 𝑁 = 0))
2 eleq1 2827 . . 3 (𝑥 = 𝑁 → (𝑥 ∈ ℕ ↔ 𝑁 ∈ ℕ))
3 negeq 11376 . . . 4 (𝑥 = 𝑁 → -𝑥 = -𝑁)
43eleq1d 2824 . . 3 (𝑥 = 𝑁 → (-𝑥 ∈ ℕ ↔ -𝑁 ∈ ℕ))
51, 2, 43orbi123d 1443 . 2 (𝑥 = 𝑁 → ((𝑥 = 0 ∨ 𝑥 ∈ ℕ ∨ -𝑥 ∈ ℕ) ↔ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ)))
6 df-z 12516 . 2 ℤ = {𝑥 ∈ ℝ ∣ (𝑥 = 0 ∨ 𝑥 ∈ ℕ ∨ -𝑥 ∈ ℕ)}
75, 6elrab2 3632 1 (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ)))
Colors of variables: wff setvar class
Syntax hints:  wb 207  wa 396  w3o 1091   = wceq 1547  wcel 2119  cr 11028  0cc0 11029  -cneg 11369  cn 12165  cz 12515
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2711
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-clab 2718  df-cleq 2731  df-clel 2814  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-ss 3900  df-nul 4262  df-if 4455  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-br 5073  df-iota 6441  df-fv 6493  df-ov 7359  df-neg 11371  df-z 12516
This theorem is referenced by:  nnnegz  12518  zre  12519  elnnz  12525  0z  12526  elznn0nn  12529  elznn0  12530  elznn  12531  nnz  12536  znegcl  12553  zeo  12606  addmodlteq  13899  zabsle1  27277  ostthlem1  27608  ostth3  27619  elzdif0  34164  qqhval2lem  34165  exp11d  42803
  Copyright terms: Public domain W3C validator