| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elznn0nn | Structured version Visualization version GIF version | ||
| Description: Integer property expressed in terms nonnegative integers and positive integers. (Contributed by NM, 10-May-2004.) |
| Ref | Expression |
|---|---|
| elznn0nn | ⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℕ0 ∨ (𝑁 ∈ ℝ ∧ -𝑁 ∈ ℕ))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elz 12599 | . 2 ⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ))) | |
| 2 | andi 1024 | . . 3 ⊢ ((𝑁 ∈ ℝ ∧ ((𝑁 = 0 ∨ 𝑁 ∈ ℕ) ∨ -𝑁 ∈ ℕ)) ↔ ((𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ)) ∨ (𝑁 ∈ ℝ ∧ -𝑁 ∈ ℕ))) | |
| 3 | df-3or 1103 | . . . 4 ⊢ ((𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ) ↔ ((𝑁 = 0 ∨ 𝑁 ∈ ℕ) ∨ -𝑁 ∈ ℕ)) | |
| 4 | 3 | anbi2i 634 | . . 3 ⊢ ((𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ)) ↔ (𝑁 ∈ ℝ ∧ ((𝑁 = 0 ∨ 𝑁 ∈ ℕ) ∨ -𝑁 ∈ ℕ))) |
| 5 | nn0re 12519 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℝ) | |
| 6 | 5 | pm4.71ri 569 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℝ ∧ 𝑁 ∈ ℕ0)) |
| 7 | elnn0 12512 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0)) | |
| 8 | orcom 883 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∨ 𝑁 = 0) ↔ (𝑁 = 0 ∨ 𝑁 ∈ ℕ)) | |
| 9 | 7, 8 | bitri 278 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 = 0 ∨ 𝑁 ∈ ℕ)) |
| 10 | 9 | anbi2i 634 | . . . . 5 ⊢ ((𝑁 ∈ ℝ ∧ 𝑁 ∈ ℕ0) ↔ (𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ))) |
| 11 | 6, 10 | bitri 278 | . . . 4 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ))) |
| 12 | 11 | orbi1i 926 | . . 3 ⊢ ((𝑁 ∈ ℕ0 ∨ (𝑁 ∈ ℝ ∧ -𝑁 ∈ ℕ)) ↔ ((𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ)) ∨ (𝑁 ∈ ℝ ∧ -𝑁 ∈ ℕ))) |
| 13 | 2, 4, 12 | 3bitr4i 306 | . 2 ⊢ ((𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ)) ↔ (𝑁 ∈ ℕ0 ∨ (𝑁 ∈ ℝ ∧ -𝑁 ∈ ℕ))) |
| 14 | 1, 13 | bitri 278 | 1 ⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℕ0 ∨ (𝑁 ∈ ℝ ∧ -𝑁 ∈ ℕ))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 400 ∨ wo 860 ∨ w3o 1101 = wceq 1569 ∈ wcel 2142 ℝcr 11105 0cc0 11106 -cneg 11448 ℕcn 12239 ℕ0cn0 12510 ℤcz 12597 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pr 5403 ax-un 7734 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-i2m1 11174 ax-1ne0 11175 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-ov 7415 df-om 7861 df-2nd 7985 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-neg 11450 df-nn 12240 df-n0 12511 df-z 12598 |
| This theorem is used by: zindd 12703 expcl2lem 14116 mulexpz 14145 expaddz 14149 expmulz 14151 absexpz 15363 bitsfzo 16499 pcid 16939 mulgsubcl 19160 mulgneg 19164 ghmmulg 19304 prmirred 21635 tgpmulg 24261 dvexp3 26148 2sqnn0 27613 ipasslem3 31196 reelznn0nn 43263 ztprmneprm 49155 |
| Copyright terms: Public domain | W3C validator |