| 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 12695 | . 2 ⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ))) | |
| 2 | andi 1025 | . . 3 ⊢ ((𝑁 ∈ ℝ ∧ ((𝑁 = 0 ∨ 𝑁 ∈ ℕ) ∨ -𝑁 ∈ ℕ)) ↔ ((𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ)) ∨ (𝑁 ∈ ℝ ∧ -𝑁 ∈ ℕ))) | |
| 3 | df-3or 1104 | . . . 4 ⊢ ((𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ) ↔ ((𝑁 = 0 ∨ 𝑁 ∈ ℕ) ∨ -𝑁 ∈ ℕ)) | |
| 4 | 3 | anbi2i 635 | . . 3 ⊢ ((𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ)) ↔ (𝑁 ∈ ℝ ∧ ((𝑁 = 0 ∨ 𝑁 ∈ ℕ) ∨ -𝑁 ∈ ℕ))) |
| 5 | nn0re 12615 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℝ) | |
| 6 | 5 | pm4.71ri 570 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℝ ∧ 𝑁 ∈ ℕ0)) |
| 7 | elnn0 12608 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0)) | |
| 8 | orcom 884 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∨ 𝑁 = 0) ↔ (𝑁 = 0 ∨ 𝑁 ∈ ℕ)) | |
| 9 | 7, 8 | bitri 278 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 = 0 ∨ 𝑁 ∈ ℕ)) |
| 10 | 9 | anbi2i 635 | . . . . 5 ⊢ ((𝑁 ∈ ℝ ∧ 𝑁 ∈ ℕ0) ↔ (𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ))) |
| 11 | 6, 10 | bitri 278 | . . . 4 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ))) |
| 12 | 11 | orbi1i 927 | . . 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 401 ∨ wo 861 ∨ w3o 1102 = wceq 1569 ∈ wcel 2144 ℝcr 11199 0cc0 11200 -cneg 11542 ℕcn 12335 ℕ0cn0 12606 ℤcz 12693 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5390 ax-un 7751 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-i2m1 11268 ax-1ne0 11269 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-ov 7423 df-om 7878 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-neg 11544 df-nn 12336 df-n0 12607 df-z 12694 |
| This theorem is used by: zindd 12800 expcl2lem 14216 mulexpz 14245 expaddz 14249 expmulz 14251 absexpz 15472 bitsfzo 16605 pcid 17051 mulgsubcl 19298 mulgneg 19302 ghmmulg 19442 prmirred 21780 tgpmulg 24412 dvexp3 26298 2sqnn0 27765 ipasslem3 31435 reelznn0nn 43526 ztprmneprm 49459 |
| Copyright terms: Public domain | W3C validator |