| Metamath Proof Explorer |
< Previous
Next >
Related theorems GIF version |
| Description: Membership in the set of integers. |
| Ref | Expression |
|---|---|
| elz | ⊢ (A ∈ ℤ ↔ (A ∈ ℝ ∧ (A = 0 ∨ A ∈ ℕ ∨ -A ∈ ℕ))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-z 4564 | . . 3 ⊢ ℤ = {x ∈ ℝ∣(x = 0 ∨ x ∈ ℕ ∨ -x ∈ ℕ)} | |
| 2 | 1 | eleq2i 1153 | . 2 ⊢ (A ∈ ℤ ↔ A ∈ {x ∈ ℝ∣(x = 0 ∨ x ∈ ℕ ∨ -x ∈ ℕ)}) |
| 3 | cleq1 1107 | . . . 4 ⊢ (x = A → (x = 0 ↔ A = 0)) | |
| 4 | eleq1 1149 | . . . 4 ⊢ (x = A → (x ∈ ℕ ↔ A ∈ ℕ)) | |
| 5 | negeq 4136 | . . . . 5 ⊢ (x = A → -x = -A) | |
| 6 | 5 | eleq1d 1155 | . . . 4 ⊢ (x = A → (-x ∈ ℕ ↔ -A ∈ ℕ)) |
| 7 | 3, 4, 6 | bi3ord 635 | . . 3 ⊢ (x = A → ((x = 0 ∨ x ∈ ℕ ∨ -x ∈ ℕ) ↔ (A = 0 ∨ A ∈ ℕ ∨ -A ∈ ℕ))) |
| 8 | 7 | elrab 1422 | . 2 ⊢ (A ∈ {x ∈ ℝ∣(x = 0 ∨ x ∈ ℕ ∨ -x ∈ ℕ)} ↔ (A ∈ ℝ ∧ (A = 0 ∨ A ∈ ℕ ∨ -A ∈ ℕ))) |
| 9 | 2, 8 | bitr 151 | 1 ⊢ (A ∈ ℤ ↔ (A ∈ ℝ ∧ (A = 0 ∨ A ∈ ℕ ∨ -A ∈ ℕ))) |
| Colors of variables: wff set class |
| Syntax hints: ↔ wb 127 ∧ wa 196 ∨ w3o 580 = wceq 1091 ∈ wcel 1092 {crab 1204 ℝcr 4027 0cc0 4028 -cneg 4090 ℕcn 4093 ℤcz 4095 |
| This theorem is referenced by: nnnegz 4566 zret 4567 elnnz 4572 0z 4573 elznn0nn 4575 elznn0 4576 elnnz1 4581 halfnz 4586 znegclt 4588 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 ax-4 673 ax-5 674 ax-6 675 ax-7 676 ax-gen 677 ax-8 798 ax-9 799 ax-10 800 ax-11 801 ax-12 802 ax-13 804 ax-14 805 ax-16 922 ax-17 925 ax-ext 1074 ax-rep 1075 ax-pow 1077 |
| This theorem depends on definitions: df-bi 128 df-or 197 df-an 198 df-3or 582 df-ex 679 df-sb 853 df-clab 1093 df-cleq 1097 df-clel 1099 df-rab 1208 df-v 1349 df-dif 1489 df-un 1490 df-in 1491 df-ss 1492 df-nul 1708 df-pw 1799 df-sn 1811 df-pr 1812 df-op 1815 df-uni 1920 df-br 2063 df-opab 2098 df-xp 2424 df-cnv 2426 df-dm 2428 df-rn 2429 df-res 2430 df-ima 2431 df-fv 2438 df-opr 3003 df-neg 4135 df-z 4564 |