| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > elznn0 | GIF version | ||
| Description: Integer property expressed in terms of nonnegative integers. (Contributed by NM, 9-May-2004.) |
| Ref | Expression |
|---|---|
| elznn0 | ⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℝ ∧ (𝑁 ∈ ℕ0 ∨ -𝑁 ∈ ℕ0))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elz 9444 | . 2 ⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ))) | |
| 2 | elnn0 9367 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0)) | |
| 3 | 2 | a1i 9 | . . . . 5 ⊢ (𝑁 ∈ ℝ → (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0))) |
| 4 | elnn0 9367 | . . . . . 6 ⊢ (-𝑁 ∈ ℕ0 ↔ (-𝑁 ∈ ℕ ∨ -𝑁 = 0)) | |
| 5 | recn 8128 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℝ → 𝑁 ∈ ℂ) | |
| 6 | 0cn 8134 | . . . . . . . . 9 ⊢ 0 ∈ ℂ | |
| 7 | negcon1 8394 | . . . . . . . . 9 ⊢ ((𝑁 ∈ ℂ ∧ 0 ∈ ℂ) → (-𝑁 = 0 ↔ -0 = 𝑁)) | |
| 8 | 5, 6, 7 | sylancl 413 | . . . . . . . 8 ⊢ (𝑁 ∈ ℝ → (-𝑁 = 0 ↔ -0 = 𝑁)) |
| 9 | neg0 8388 | . . . . . . . . . 10 ⊢ -0 = 0 | |
| 10 | 9 | eqeq1i 2237 | . . . . . . . . 9 ⊢ (-0 = 𝑁 ↔ 0 = 𝑁) |
| 11 | eqcom 2231 | . . . . . . . . 9 ⊢ (0 = 𝑁 ↔ 𝑁 = 0) | |
| 12 | 10, 11 | bitri 184 | . . . . . . . 8 ⊢ (-0 = 𝑁 ↔ 𝑁 = 0) |
| 13 | 8, 12 | bitrdi 196 | . . . . . . 7 ⊢ (𝑁 ∈ ℝ → (-𝑁 = 0 ↔ 𝑁 = 0)) |
| 14 | 13 | orbi2d 795 | . . . . . 6 ⊢ (𝑁 ∈ ℝ → ((-𝑁 ∈ ℕ ∨ -𝑁 = 0) ↔ (-𝑁 ∈ ℕ ∨ 𝑁 = 0))) |
| 15 | 4, 14 | bitrid 192 | . . . . 5 ⊢ (𝑁 ∈ ℝ → (-𝑁 ∈ ℕ0 ↔ (-𝑁 ∈ ℕ ∨ 𝑁 = 0))) |
| 16 | 3, 15 | orbi12d 798 | . . . 4 ⊢ (𝑁 ∈ ℝ → ((𝑁 ∈ ℕ0 ∨ -𝑁 ∈ ℕ0) ↔ ((𝑁 ∈ ℕ ∨ 𝑁 = 0) ∨ (-𝑁 ∈ ℕ ∨ 𝑁 = 0)))) |
| 17 | 3orass 1005 | . . . . 5 ⊢ ((𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ) ↔ (𝑁 = 0 ∨ (𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ))) | |
| 18 | orcom 733 | . . . . 5 ⊢ ((𝑁 = 0 ∨ (𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ)) ↔ ((𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ) ∨ 𝑁 = 0)) | |
| 19 | orordir 779 | . . . . 5 ⊢ (((𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ) ∨ 𝑁 = 0) ↔ ((𝑁 ∈ ℕ ∨ 𝑁 = 0) ∨ (-𝑁 ∈ ℕ ∨ 𝑁 = 0))) | |
| 20 | 17, 18, 19 | 3bitrri 207 | . . . 4 ⊢ (((𝑁 ∈ ℕ ∨ 𝑁 = 0) ∨ (-𝑁 ∈ ℕ ∨ 𝑁 = 0)) ↔ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ)) |
| 21 | 16, 20 | bitr2di 197 | . . 3 ⊢ (𝑁 ∈ ℝ → ((𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ) ↔ (𝑁 ∈ ℕ0 ∨ -𝑁 ∈ ℕ0))) |
| 22 | 21 | pm5.32i 454 | . 2 ⊢ ((𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ)) ↔ (𝑁 ∈ ℝ ∧ (𝑁 ∈ ℕ0 ∨ -𝑁 ∈ ℕ0))) |
| 23 | 1, 22 | bitri 184 | 1 ⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℝ ∧ (𝑁 ∈ ℕ0 ∨ -𝑁 ∈ ℕ0))) |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 ↔ wb 105 ∨ wo 713 ∨ w3o 1001 = wceq 1395 ∈ wcel 2200 ℂcc 7993 ℝcr 7994 0cc0 7995 -cneg 8314 ℕcn 9106 ℕ0cn0 9365 ℤcz 9442 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-14 2203 ax-ext 2211 ax-sep 4201 ax-pow 4257 ax-pr 4292 ax-setind 4628 ax-resscn 8087 ax-1cn 8088 ax-icn 8090 ax-addcl 8091 ax-addrcl 8092 ax-mulcl 8093 ax-addcom 8095 ax-addass 8097 ax-distr 8099 ax-i2m1 8100 ax-0id 8103 ax-rnegex 8104 ax-cnre 8106 |
| This theorem depends on definitions: df-bi 117 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2801 df-sbc 3029 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3888 df-br 4083 df-opab 4145 df-id 4383 df-xp 4724 df-rel 4725 df-cnv 4726 df-co 4727 df-dm 4728 df-iota 5277 df-fun 5319 df-fv 5325 df-riota 5953 df-ov 6003 df-oprab 6004 df-mpo 6005 df-sub 8315 df-neg 8316 df-n0 9366 df-z 9443 |
| This theorem is referenced by: peano2z 9478 zmulcl 9496 elz2 9514 expnegzap 10790 expaddzaplem 10799 odd2np1 12379 bezoutlemzz 12518 bezoutlemaz 12519 bezoutlembz 12520 mulgz 13682 mulgdirlem 13685 mulgdir 13686 mulgass 13691 |
| Copyright terms: Public domain | W3C validator |