![]() |
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 15176. (Contributed by NM, 9-May-2004.) |
Ref | Expression |
---|---|
nthruz | ⊢ (ℕ ⊊ ℕ0 ∧ ℕ0 ⊊ ℤ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nnssnn0 11483 | . . 3 ⊢ ℕ ⊆ ℕ0 | |
2 | 0nn0 11495 | . . . 4 ⊢ 0 ∈ ℕ0 | |
3 | 0nnn 11240 | . . . 4 ⊢ ¬ 0 ∈ ℕ | |
4 | 2, 3 | pm3.2i 470 | . . 3 ⊢ (0 ∈ ℕ0 ∧ ¬ 0 ∈ ℕ) |
5 | ssnelpss 3856 | . . 3 ⊢ (ℕ ⊆ ℕ0 → ((0 ∈ ℕ0 ∧ ¬ 0 ∈ ℕ) → ℕ ⊊ ℕ0)) | |
6 | 1, 4, 5 | mp2 9 | . 2 ⊢ ℕ ⊊ ℕ0 |
7 | nn0ssz 11586 | . . 3 ⊢ ℕ0 ⊆ ℤ | |
8 | neg1z 11601 | . . . 4 ⊢ -1 ∈ ℤ | |
9 | neg1lt0 11315 | . . . . 5 ⊢ -1 < 0 | |
10 | nn0nlt0 11507 | . . . . 5 ⊢ (-1 ∈ ℕ0 → ¬ -1 < 0) | |
11 | 9, 10 | mt2 191 | . . . 4 ⊢ ¬ -1 ∈ ℕ0 |
12 | 8, 11 | pm3.2i 470 | . . 3 ⊢ (-1 ∈ ℤ ∧ ¬ -1 ∈ ℕ0) |
13 | ssnelpss 3856 | . . 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 383 ∈ wcel 2135 ⊆ wss 3711 ⊊ wpss 3712 class class class wbr 4800 0cc0 10124 1c1 10125 < clt 10262 -cneg 10455 ℕcn 11208 ℕ0cn0 11480 ℤcz 11565 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1867 ax-4 1882 ax-5 1984 ax-6 2050 ax-7 2086 ax-8 2137 ax-9 2144 ax-10 2164 ax-11 2179 ax-12 2192 ax-13 2387 ax-ext 2736 ax-sep 4929 ax-nul 4937 ax-pow 4988 ax-pr 5051 ax-un 7110 ax-resscn 10181 ax-1cn 10182 ax-icn 10183 ax-addcl 10184 ax-addrcl 10185 ax-mulcl 10186 ax-mulrcl 10187 ax-mulcom 10188 ax-addass 10189 ax-mulass 10190 ax-distr 10191 ax-i2m1 10192 ax-1ne0 10193 ax-1rid 10194 ax-rnegex 10195 ax-rrecex 10196 ax-cnre 10197 ax-pre-lttri 10198 ax-pre-lttrn 10199 ax-pre-ltadd 10200 ax-pre-mulgt0 10201 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1073 df-3an 1074 df-tru 1631 df-ex 1850 df-nf 1855 df-sb 2043 df-eu 2607 df-mo 2608 df-clab 2743 df-cleq 2749 df-clel 2752 df-nfc 2887 df-ne 2929 df-nel 3032 df-ral 3051 df-rex 3052 df-reu 3053 df-rab 3055 df-v 3338 df-sbc 3573 df-csb 3671 df-dif 3714 df-un 3716 df-in 3718 df-ss 3725 df-pss 3727 df-nul 4055 df-if 4227 df-pw 4300 df-sn 4318 df-pr 4320 df-tp 4322 df-op 4324 df-uni 4585 df-iun 4670 df-br 4801 df-opab 4861 df-mpt 4878 df-tr 4901 df-id 5170 df-eprel 5175 df-po 5183 df-so 5184 df-fr 5221 df-we 5223 df-xp 5268 df-rel 5269 df-cnv 5270 df-co 5271 df-dm 5272 df-rn 5273 df-res 5274 df-ima 5275 df-pred 5837 df-ord 5883 df-on 5884 df-lim 5885 df-suc 5886 df-iota 6008 df-fun 6047 df-fn 6048 df-f 6049 df-f1 6050 df-fo 6051 df-f1o 6052 df-fv 6053 df-riota 6770 df-ov 6812 df-oprab 6813 df-mpt2 6814 df-om 7227 df-wrecs 7572 df-recs 7633 df-rdg 7671 df-er 7907 df-en 8118 df-dom 8119 df-sdom 8120 df-pnf 10264 df-mnf 10265 df-xr 10266 df-ltxr 10267 df-le 10268 df-sub 10456 df-neg 10457 df-nn 11209 df-n0 11481 df-z 11566 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |