| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elz | Structured version Visualization version GIF version | ||
| Description: Membership in the set of integers. (Contributed by NM, 8-Jan-2002.) |
| Ref | Expression |
|---|---|
| elz | ⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqeq1 2741 | . . 3 ⊢ (𝑥 = 𝑁 → (𝑥 = 0 ↔ 𝑁 = 0)) | |
| 2 | eleq1 2825 | . . 3 ⊢ (𝑥 = 𝑁 → (𝑥 ∈ ℕ ↔ 𝑁 ∈ ℕ)) | |
| 3 | negeq 11376 | . . . 4 ⊢ (𝑥 = 𝑁 → -𝑥 = -𝑁) | |
| 4 | 3 | eleq1d 2822 | . . 3 ⊢ (𝑥 = 𝑁 → (-𝑥 ∈ ℕ ↔ -𝑁 ∈ ℕ)) |
| 5 | 1, 2, 4 | 3orbi123d 1438 | . 2 ⊢ (𝑥 = 𝑁 → ((𝑥 = 0 ∨ 𝑥 ∈ ℕ ∨ -𝑥 ∈ ℕ) ↔ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ))) |
| 6 | df-z 12516 | . 2 ⊢ ℤ = {𝑥 ∈ ℝ ∣ (𝑥 = 0 ∨ 𝑥 ∈ ℕ ∨ -𝑥 ∈ ℕ)} | |
| 7 | 5, 6 | elrab2 3638 | 1 ⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ))) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 ∨ w3o 1086 = wceq 1542 ∈ wcel 2114 ℝ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 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-iota 6448 df-fv 6500 df-ov 7363 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 27273 ostthlem1 27604 ostth3 27615 elzdif0 34140 qqhval2lem 34141 exp11d 42772 |
| Copyright terms: Public domain | W3C validator |