| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nthruz | Structured version Visualization version GIF version | ||
| Description: The sequence ℕ, ℕ0, and ℤ forms a chain of proper subsets. In each case the proper subset relationship is shown by demonstrating a number that belongs to one set but not the other. We show that zero belongs to ℕ0 but not ℕ and minus one belongs to ℤ but not ℕ0. This theorem refines the chain of proper subsets nthruc 16208. (Contributed by NM, 9-May-2004.) |
| Ref | Expression |
|---|---|
| nthruz | ⊢ (ℕ ⊊ ℕ0 ∧ ℕ0 ⊊ ℤ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nnssnn0 12429 | . . 3 ⊢ ℕ ⊆ ℕ0 | |
| 2 | 0nn0 12441 | . . . 4 ⊢ 0 ∈ ℕ0 | |
| 3 | 0nnn 12202 | . . . 4 ⊢ ¬ 0 ∈ ℕ | |
| 4 | 2, 3 | pm3.2i 470 | . . 3 ⊢ (0 ∈ ℕ0 ∧ ¬ 0 ∈ ℕ) |
| 5 | ssnelpss 4047 | . . 3 ⊢ (ℕ ⊆ ℕ0 → ((0 ∈ ℕ0 ∧ ¬ 0 ∈ ℕ) → ℕ ⊊ ℕ0)) | |
| 6 | 1, 4, 5 | mp2 9 | . 2 ⊢ ℕ ⊊ ℕ0 |
| 7 | nn0ssz 12536 | . . 3 ⊢ ℕ0 ⊆ ℤ | |
| 8 | neg1z 12552 | . . . 4 ⊢ -1 ∈ ℤ | |
| 9 | neg1lt0 12136 | . . . . 5 ⊢ -1 < 0 | |
| 10 | nn0nlt0 12452 | . . . . 5 ⊢ (-1 ∈ ℕ0 → ¬ -1 < 0) | |
| 11 | 9, 10 | mt2 200 | . . . 4 ⊢ ¬ -1 ∈ ℕ0 |
| 12 | 8, 11 | pm3.2i 470 | . . 3 ⊢ (-1 ∈ ℤ ∧ ¬ -1 ∈ ℕ0) |
| 13 | ssnelpss 4047 | . . 3 ⊢ (ℕ0 ⊆ ℤ → ((-1 ∈ ℤ ∧ ¬ -1 ∈ ℕ0) → ℕ0 ⊊ ℤ)) | |
| 14 | 7, 12, 13 | mp2 9 | . 2 ⊢ ℕ0 ⊊ ℤ |
| 15 | 6, 14 | pm3.2i 470 | 1 ⊢ (ℕ ⊊ ℕ0 ∧ ℕ0 ⊊ ℤ) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ∧ wa 395 ∈ wcel 2114 ⊆ wss 3885 ⊊ wpss 3886 class class class wbr 5074 0cc0 11027 1c1 11028 < clt 11168 -cneg 11367 ℕcn 12163 ℕ0cn0 12426 ℤcz 12513 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2184 ax-ext 2707 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 ax-un 7678 ax-resscn 11084 ax-1cn 11085 ax-icn 11086 ax-addcl 11087 ax-addrcl 11088 ax-mulcl 11089 ax-mulrcl 11090 ax-mulcom 11091 ax-addass 11092 ax-mulass 11093 ax-distr 11094 ax-i2m1 11095 ax-1ne0 11096 ax-1rid 11097 ax-rnegex 11098 ax-rrecex 11099 ax-cnre 11100 ax-pre-lttri 11101 ax-pre-lttrn 11102 ax-pre-ltadd 11103 ax-pre-mulgt0 11104 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3060 df-reu 3341 df-rab 3388 df-v 3429 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-pss 3905 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4841 df-iun 4925 df-br 5075 df-opab 5137 df-mpt 5156 df-tr 5182 df-id 5515 df-eprel 5520 df-po 5528 df-so 5529 df-fr 5573 df-we 5575 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-pred 6254 df-ord 6315 df-on 6316 df-lim 6317 df-suc 6318 df-iota 6443 df-fun 6489 df-fn 6490 df-f 6491 df-f1 6492 df-fo 6493 df-f1o 6494 df-fv 6495 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-2nd 7932 df-frecs 8220 df-wrecs 8251 df-recs 8300 df-rdg 8338 df-er 8632 df-en 8883 df-dom 8884 df-sdom 8885 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-nn 12164 df-n0 12427 df-z 12514 |
| This theorem is referenced by: nthrucw 47304 |
| Copyright terms: Public domain | W3C validator |