| 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 16153. (Contributed by NM, 9-May-2004.) |
| Ref | Expression |
|---|---|
| nthruz | ⊢ (ℕ ⊊ ℕ0 ∧ ℕ0 ⊊ ℤ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nnssnn0 12376 | . . 3 ⊢ ℕ ⊆ ℕ0 | |
| 2 | 0nn0 12388 | . . . 4 ⊢ 0 ∈ ℕ0 | |
| 3 | 0nnn 12153 | . . . 4 ⊢ ¬ 0 ∈ ℕ | |
| 4 | 2, 3 | pm3.2i 470 | . . 3 ⊢ (0 ∈ ℕ0 ∧ ¬ 0 ∈ ℕ) |
| 5 | ssnelpss 4062 | . . 3 ⊢ (ℕ ⊆ ℕ0 → ((0 ∈ ℕ0 ∧ ¬ 0 ∈ ℕ) → ℕ ⊊ ℕ0)) | |
| 6 | 1, 4, 5 | mp2 9 | . 2 ⊢ ℕ ⊊ ℕ0 |
| 7 | nn0ssz 12483 | . . 3 ⊢ ℕ0 ⊆ ℤ | |
| 8 | neg1z 12500 | . . . 4 ⊢ -1 ∈ ℤ | |
| 9 | neg1lt0 12105 | . . . . 5 ⊢ -1 < 0 | |
| 10 | nn0nlt0 12399 | . . . . 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 4062 | . . 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 2110 ⊆ wss 3900 ⊊ wpss 3901 class class class wbr 5089 0cc0 10998 1c1 10999 < clt 11138 -cneg 11337 ℕcn 12117 ℕ0cn0 12373 ℤcz 12460 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2112 ax-9 2120 ax-10 2143 ax-11 2159 ax-12 2179 ax-ext 2702 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7663 ax-resscn 11055 ax-1cn 11056 ax-icn 11057 ax-addcl 11058 ax-addrcl 11059 ax-mulcl 11060 ax-mulrcl 11061 ax-mulcom 11062 ax-addass 11063 ax-mulass 11064 ax-distr 11065 ax-i2m1 11066 ax-1ne0 11067 ax-1rid 11068 ax-rnegex 11069 ax-rrecex 11070 ax-cnre 11071 ax-pre-lttri 11072 ax-pre-lttrn 11073 ax-pre-ltadd 11074 ax-pre-mulgt0 11075 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-reu 3345 df-rab 3394 df-v 3436 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-pss 3920 df-nul 4282 df-if 4474 df-pw 4550 df-sn 4575 df-pr 4577 df-op 4581 df-uni 4858 df-iun 4941 df-br 5090 df-opab 5152 df-mpt 5171 df-tr 5197 df-id 5509 df-eprel 5514 df-po 5522 df-so 5523 df-fr 5567 df-we 5569 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-pred 6244 df-ord 6305 df-on 6306 df-lim 6307 df-suc 6308 df-iota 6433 df-fun 6479 df-fn 6480 df-f 6481 df-f1 6482 df-fo 6483 df-f1o 6484 df-fv 6485 df-riota 7298 df-ov 7344 df-oprab 7345 df-mpo 7346 df-om 7792 df-2nd 7917 df-frecs 8206 df-wrecs 8237 df-recs 8286 df-rdg 8324 df-er 8617 df-en 8865 df-dom 8866 df-sdom 8867 df-pnf 11140 df-mnf 11141 df-xr 11142 df-ltxr 11143 df-le 11144 df-sub 11338 df-neg 11339 df-nn 12118 df-n0 12374 df-z 12461 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |