| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > uzss | Structured version Visualization version GIF version | ||
| Description: Subset relationship for two sets of upper integers. (Contributed by NM, 5-Sep-2005.) |
| Ref | Expression |
|---|---|
| uzss | ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (ℤ≥‘𝑁) ⊆ (ℤ≥‘𝑀)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eluzle 12768 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ≤ 𝑁) | |
| 2 | 1 | adantr 480 | . . . . 5 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝑘 ∈ ℤ) → 𝑀 ≤ 𝑁) |
| 3 | eluzel2 12760 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ) | |
| 4 | eluzelz 12765 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ ℤ) | |
| 5 | 3, 4 | jca 511 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) |
| 6 | zletr 12539 | . . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑘 ∈ ℤ) → ((𝑀 ≤ 𝑁 ∧ 𝑁 ≤ 𝑘) → 𝑀 ≤ 𝑘)) | |
| 7 | 6 | 3expa 1119 | . . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑘 ∈ ℤ) → ((𝑀 ≤ 𝑁 ∧ 𝑁 ≤ 𝑘) → 𝑀 ≤ 𝑘)) |
| 8 | 5, 7 | sylan 581 | . . . . 5 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝑘 ∈ ℤ) → ((𝑀 ≤ 𝑁 ∧ 𝑁 ≤ 𝑘) → 𝑀 ≤ 𝑘)) |
| 9 | 2, 8 | mpand 696 | . . . 4 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝑘 ∈ ℤ) → (𝑁 ≤ 𝑘 → 𝑀 ≤ 𝑘)) |
| 10 | 9 | imdistanda 571 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → ((𝑘 ∈ ℤ ∧ 𝑁 ≤ 𝑘) → (𝑘 ∈ ℤ ∧ 𝑀 ≤ 𝑘))) |
| 11 | eluz1 12759 | . . . 4 ⊢ (𝑁 ∈ ℤ → (𝑘 ∈ (ℤ≥‘𝑁) ↔ (𝑘 ∈ ℤ ∧ 𝑁 ≤ 𝑘))) | |
| 12 | 4, 11 | syl 17 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑘 ∈ (ℤ≥‘𝑁) ↔ (𝑘 ∈ ℤ ∧ 𝑁 ≤ 𝑘))) |
| 13 | eluz1 12759 | . . . 4 ⊢ (𝑀 ∈ ℤ → (𝑘 ∈ (ℤ≥‘𝑀) ↔ (𝑘 ∈ ℤ ∧ 𝑀 ≤ 𝑘))) | |
| 14 | 3, 13 | syl 17 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑘 ∈ (ℤ≥‘𝑀) ↔ (𝑘 ∈ ℤ ∧ 𝑀 ≤ 𝑘))) |
| 15 | 10, 12, 14 | 3imtr4d 294 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑘 ∈ (ℤ≥‘𝑁) → 𝑘 ∈ (ℤ≥‘𝑀))) |
| 16 | 15 | ssrdv 3940 | 1 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (ℤ≥‘𝑁) ⊆ (ℤ≥‘𝑀)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2114 ⊆ wss 3902 class class class wbr 5099 ‘cfv 6493 ≤ cle 11171 ℤcz 12492 ℤ≥cuz 12755 |
| 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 2185 ax-ext 2709 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 ax-cnex 11086 ax-resscn 11087 ax-pre-lttri 11104 ax-pre-lttrn 11105 |
| 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 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-br 5100 df-opab 5162 df-mpt 5181 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-ov 7363 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-neg 11371 df-z 12493 df-uz 12756 |
| This theorem is referenced by: uzin 12791 uzuzle35 12804 uznnssnn 12812 fzopth 13481 4fvwrd4 13568 fzouzsplit 13614 fzoopth 13682 seqfeq2 13952 rexuzre 15280 cau3lem 15282 climsup 15597 isumsplit 15767 isumrpcl 15770 cvgrat 15810 clim2prod 15815 fprodntriv 15869 isprm3 16614 pcfac 16831 lmflf 23953 caucfil 25243 uniioombllem4 25547 mbflimsup 25627 ulmres 26357 ulmcaulem 26363 logfaclbnd 27193 axlowdimlem17 29035 clwwlkinwwlk 30119 fz2ssnn0 32867 evl1deg1 33659 evl1deg2 33660 evl1deg3 33661 poimirlem1 37824 poimirlem2 37825 poimirlem6 37829 poimirlem7 37830 poimirlem20 37843 uzssd 45719 climinf 45919 climsuse 45921 climresmpt 45970 climleltrp 45987 limsupequzlem 46033 supcnvlimsup 46051 ioodvbdlimc1lem1 46242 ioodvbdlimc1lem2 46243 ioodvbdlimc2lem 46245 meaiininclem 46797 smflimlem2 47083 smflimsuplem2 47132 smflimsuplem3 47133 smflimsuplem4 47134 smflimsuplem5 47135 smflimsuplem6 47136 smflimsuplem7 47137 |
| Copyright terms: Public domain | W3C validator |