| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > elznn | GIF version | ||
| Description: Integer property expressed in terms of positive integers and nonnegative integers. (Contributed by NM, 12-Jul-2005.) |
| Ref | Expression |
|---|---|
| elznn | ⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℝ ∧ (𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ0))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elz 9657 | . 2 ⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ))) | |
| 2 | 3orrot 1015 | . . . . 5 ⊢ ((𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ) ↔ (𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ ∨ 𝑁 = 0)) | |
| 3 | 3orass 1012 | . . . . 5 ⊢ ((𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ ∨ 𝑁 = 0) ↔ (𝑁 ∈ ℕ ∨ ( -𝑁 ∈ ℕ ∨ 𝑁 = 0))) | |
| 4 | 2, 3 | bitri 184 | . . . 4 ⊢ ((𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ) ↔ (𝑁 ∈ ℕ ∨ ( -𝑁 ∈ ℕ ∨ 𝑁 = 0))) |
| 5 | elnn0 9576 | . . . . . 6 ⊢ ( -𝑁 ∈ ℕ0 ↔ ( -𝑁 ∈ ℕ ∨ -𝑁 = 0)) | |
| 6 | recn 8318 | . . . . . . . 8 ⊢ (𝑁 ∈ ℝ → 𝑁 ∈ ℂ) | |
| 7 | 6 | negeq0d 8636 | . . . . . . 7 ⊢ (𝑁 ∈ ℝ → (𝑁 = 0 ↔ -𝑁 = 0)) |
| 8 | 7 | orbi2d 802 | . . . . . 6 ⊢ (𝑁 ∈ ℝ → (( -𝑁 ∈ ℕ ∨ 𝑁 = 0) ↔ ( -𝑁 ∈ ℕ ∨ -𝑁 = 0))) |
| 9 | 5, 8 | bitr4id 199 | . . . . 5 ⊢ (𝑁 ∈ ℝ → ( -𝑁 ∈ ℕ0 ↔ ( -𝑁 ∈ ℕ ∨ 𝑁 = 0))) |
| 10 | 9 | orbi2d 802 | . . . 4 ⊢ (𝑁 ∈ ℝ → ((𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ0) ↔ (𝑁 ∈ ℕ ∨ ( -𝑁 ∈ ℕ ∨ 𝑁 = 0)))) |
| 11 | 4, 10 | bitr4id 199 | . . 3 ⊢ (𝑁 ∈ ℝ → ((𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ) ↔ (𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ0))) |
| 12 | 11 | pm5.32i 458 | . 2 ⊢ ((𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ)) ↔ (𝑁 ∈ ℝ ∧ (𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ0))) |
| 13 | 1, 12 | bitri 184 | 1 ⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℝ ∧ (𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ0))) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: ∧ wa 104 ↔ wb 105 ∨ wo 720 ∨ w3o 1008 = wceq 1402 ∈ wcel 2209 ℝcr 8184 0cc0 8185 -cneg 8505 ℕcn 9313 ℕ0cn0 9574 ℤcz 9655 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4251 ax-pow 4313 ax-pr 4348 ax-setind 4686 ax-resscn 8277 ax-1cn 8278 ax-icn 8280 ax-addcl 8281 ax-addrcl 8282 ax-mulcl 8283 ax-addcom 8285 ax-addass 8287 ax-distr 8289 ax-i2m1 8290 ax-0id 8293 ax-rnegex 8294 ax-cnre 8296 |
| This proof depends on definitions: df-bi 117 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-br 4132 df-opab 4194 df-id 4440 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-iota 5340 df-fun 5382 df-fv 5388 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-sub 8506 df-neg 8507 df-n0 9575 df-z 9656 |
| This theorem is used by: zzlesq 11167 znnen 13347 logbgcd1irraplemexp 16204 |
| Copyright terms: Public domain | W3C validator |