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 2818 | . . 3 ⊢ (𝑥 = 𝑁 → (𝑥 ∈ ℕ ↔ 𝑁 ∈ ℕ)) | |
3 | negeq 11035 | . . . 4 ⊢ (𝑥 = 𝑁 → -𝑥 = -𝑁) | |
4 | 3 | eleq1d 2815 | . . 3 ⊢ (𝑥 = 𝑁 → (-𝑥 ∈ ℕ ↔ -𝑁 ∈ ℕ)) |
5 | 1, 2, 4 | 3orbi123d 1437 | . 2 ⊢ (𝑥 = 𝑁 → ((𝑥 = 0 ∨ 𝑥 ∈ ℕ ∨ -𝑥 ∈ ℕ) ↔ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ))) |
6 | df-z 12142 | . 2 ⊢ ℤ = {𝑥 ∈ ℝ ∣ (𝑥 = 0 ∨ 𝑥 ∈ ℕ ∨ -𝑥 ∈ ℕ)} | |
7 | 5, 6 | elrab2 3594 | 1 ⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ))) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 209 ∧ wa 399 ∨ w3o 1088 = wceq 1543 ∈ wcel 2112 ℝcr 10693 0cc0 10694 -cneg 11028 ℕcn 11795 ℤcz 12141 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2018 ax-8 2114 ax-9 2122 ax-ext 2708 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-sb 2073 df-clab 2715 df-cleq 2728 df-clel 2809 df-rab 3060 df-v 3400 df-dif 3856 df-un 3858 df-in 3860 df-ss 3870 df-nul 4224 df-if 4426 df-sn 4528 df-pr 4530 df-op 4534 df-uni 4806 df-br 5040 df-iota 6316 df-fv 6366 df-ov 7194 df-neg 11030 df-z 12142 |
This theorem is referenced by: nnnegz 12144 zre 12145 elnnz 12151 0z 12152 elznn0nn 12155 elznn0 12156 elznn 12157 nnssz 12162 znegcl 12177 zeo 12228 addmodlteq 13484 zabsle1 26131 ostthlem1 26462 ostth3 26473 elzdif0 31596 qqhval2lem 31597 exp11d 39974 |
Copyright terms: Public domain | W3C validator |