| 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 11384 | . . . 4 ⊢ (𝑥 = 𝑁 → -𝑥 = -𝑁) | |
| 4 | 3 | eleq1d 2822 | . . 3 ⊢ (𝑥 = 𝑁 → (-𝑥 ∈ ℕ ↔ -𝑁 ∈ ℕ)) |
| 5 | 1, 2, 4 | 3orbi123d 1438 | . 2 ⊢ (𝑥 = 𝑁 → ((𝑥 = 0 ∨ 𝑥 ∈ ℕ ∨ -𝑥 ∈ ℕ) ↔ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ))) |
| 6 | df-z 12501 | . 2 ⊢ ℤ = {𝑥 ∈ ℝ ∣ (𝑥 = 0 ∨ 𝑥 ∈ ℕ ∨ -𝑥 ∈ ℕ)} | |
| 7 | 5, 6 | elrab2 3651 | 1 ⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ))) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 ∨ w3o 1086 = wceq 1542 ∈ wcel 2114 ℝcr 11037 0cc0 11038 -cneg 11377 ℕcn 12157 ℤcz 12500 |
| 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 3402 df-v 3444 df-dif 3906 df-un 3908 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-iota 6456 df-fv 6508 df-ov 7371 df-neg 11379 df-z 12501 |
| This theorem is referenced by: nnnegz 12503 zre 12504 elnnz 12510 0z 12511 elznn0nn 12514 elznn0 12515 elznn 12516 nnz 12521 znegcl 12538 zeo 12590 addmodlteq 13881 zabsle1 27275 ostthlem1 27606 ostth3 27617 elzdif0 34158 qqhval2lem 34159 exp11d 42696 |
| Copyright terms: Public domain | W3C validator |