| 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 2735 | . . 3 ⊢ (𝑥 = 𝑁 → (𝑥 = 0 ↔ 𝑁 = 0)) | |
| 2 | eleq1 2819 | . . 3 ⊢ (𝑥 = 𝑁 → (𝑥 ∈ ℕ ↔ 𝑁 ∈ ℕ)) | |
| 3 | negeq 11347 | . . . 4 ⊢ (𝑥 = 𝑁 → -𝑥 = -𝑁) | |
| 4 | 3 | eleq1d 2816 | . . 3 ⊢ (𝑥 = 𝑁 → (-𝑥 ∈ ℕ ↔ -𝑁 ∈ ℕ)) |
| 5 | 1, 2, 4 | 3orbi123d 1437 | . 2 ⊢ (𝑥 = 𝑁 → ((𝑥 = 0 ∨ 𝑥 ∈ ℕ ∨ -𝑥 ∈ ℕ) ↔ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ))) |
| 6 | df-z 12464 | . 2 ⊢ ℤ = {𝑥 ∈ ℝ ∣ (𝑥 = 0 ∨ 𝑥 ∈ ℕ ∨ -𝑥 ∈ ℕ)} | |
| 7 | 5, 6 | elrab2 3645 | 1 ⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ))) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 ∨ w3o 1085 = wceq 1541 ∈ wcel 2111 ℝcr 11000 0cc0 11001 -cneg 11340 ℕcn 12120 ℤcz 12463 |
| 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 2113 ax-9 2121 ax-ext 2703 |
| 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 2710 df-cleq 2723 df-clel 2806 df-rab 3396 df-v 3438 df-dif 3900 df-un 3902 df-ss 3914 df-nul 4279 df-if 4471 df-sn 4572 df-pr 4574 df-op 4578 df-uni 4855 df-br 5087 df-iota 6432 df-fv 6484 df-ov 7344 df-neg 11342 df-z 12464 |
| This theorem is referenced by: nnnegz 12466 zre 12467 elnnz 12473 0z 12474 elznn0nn 12477 elznn0 12478 elznn 12479 nnz 12484 znegcl 12502 zeo 12554 addmodlteq 13848 zabsle1 27229 ostthlem1 27560 ostth3 27571 elzdif0 33985 qqhval2lem 33986 exp11d 42359 |
| Copyright terms: Public domain | W3C validator |