| 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 2740 | . . 3 ⊢ (𝑥 = 𝑁 → (𝑥 = 0 ↔ 𝑁 = 0)) | |
| 2 | eleq1 2824 | . . 3 ⊢ (𝑥 = 𝑁 → (𝑥 ∈ ℕ ↔ 𝑁 ∈ ℕ)) | |
| 3 | negeq 11372 | . . . 4 ⊢ (𝑥 = 𝑁 → -𝑥 = -𝑁) | |
| 4 | 3 | eleq1d 2821 | . . 3 ⊢ (𝑥 = 𝑁 → (-𝑥 ∈ ℕ ↔ -𝑁 ∈ ℕ)) |
| 5 | 1, 2, 4 | 3orbi123d 1437 | . 2 ⊢ (𝑥 = 𝑁 → ((𝑥 = 0 ∨ 𝑥 ∈ ℕ ∨ -𝑥 ∈ ℕ) ↔ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ))) |
| 6 | df-z 12489 | . 2 ⊢ ℤ = {𝑥 ∈ ℝ ∣ (𝑥 = 0 ∨ 𝑥 ∈ ℕ ∨ -𝑥 ∈ ℕ)} | |
| 7 | 5, 6 | elrab2 3649 | 1 ⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ))) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 ∨ w3o 1085 = wceq 1541 ∈ wcel 2113 ℝcr 11025 0cc0 11026 -cneg 11365 ℕcn 12145 ℤcz 12488 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2715 df-cleq 2728 df-clel 2811 df-rab 3400 df-v 3442 df-dif 3904 df-un 3906 df-ss 3918 df-nul 4286 df-if 4480 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-iota 6448 df-fv 6500 df-ov 7361 df-neg 11367 df-z 12489 |
| This theorem is referenced by: nnnegz 12491 zre 12492 elnnz 12498 0z 12499 elznn0nn 12502 elznn0 12503 elznn 12504 nnz 12509 znegcl 12526 zeo 12578 addmodlteq 13869 zabsle1 27263 ostthlem1 27594 ostth3 27605 elzdif0 34137 qqhval2lem 34138 exp11d 42581 |
| Copyright terms: Public domain | W3C validator |