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

Theorem elz 12564
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 2765 . . 3 (𝑥 = 𝑁 → (𝑥 = 0 ↔ 𝑁 = 0))
2 eleq1 2849 . . 3 (𝑥 = 𝑁 → (𝑥 ∈ ℕ ↔ 𝑁 ∈ ℕ))
3 negeq 11416 . . . 4 (𝑥 = 𝑁 → -𝑥 = -𝑁)
43eleq1d 2846 . . 3 (𝑥 = 𝑁 → (-𝑥 ∈ ℕ ↔ -𝑁 ∈ ℕ))
51, 2, 43orbi123d 1455 . 2 (𝑥 = 𝑁 → ((𝑥 = 0 ∨ 𝑥 ∈ ℕ ∨ -𝑥 ∈ ℕ) ↔ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ)))
6 df-z 12563 . 2 ℤ = {𝑥 ∈ ℝ ∣ (𝑥 = 0 ∨ 𝑥 ∈ ℕ ∨ -𝑥 ∈ ℕ)}
75, 6elrab2 3652 1 (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ)))
Colors of variables: wff setvar class
Syntax hints:  wb 208  wa 399  w3o 1096   = wceq 1559  wcel 2141  cr 11066  0cc0 11067  -cneg 11409  cn 12204  cz 12562
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-ext 2733
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-sb 2090  df-clab 2740  df-cleq 2753  df-clel 2836  df-rab 3414  df-v 3455  df-dif 3905  df-un 3907  df-ss 3919  df-nul 4284  df-if 4478  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-br 5098  df-iota 6472  df-fv 6524  df-ov 7394  df-neg 11411  df-z 12563
This theorem is referenced by:  nnnegz  12565  zre  12566  elnnz  12572  0z  12573  elznn0nn  12576  elznn0  12577  elznn  12578  nnz  12583  znegcl  12600  zeo  12653  addmodlteq  13953  zabsle1  27348  ostthlem1  27679  ostth3  27690  elzdif0  34238  qqhval2lem  34239  exp11d  42896
  Copyright terms: Public domain W3C validator