| 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 12925 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ≤ 𝑁) | |
| 2 | 1 | adantr 486 | . . . . 5 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝑘 ∈ ℤ) → 𝑀 ≤ 𝑁) |
| 3 | eluzel2 12917 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ) | |
| 4 | eluzelz 12922 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ ℤ) | |
| 5 | 3, 4 | jca 521 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) |
| 6 | zletr 12687 | . . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑘 ∈ ℤ) → ((𝑀 ≤ 𝑁 ∧ 𝑁 ≤ 𝑘) → 𝑀 ≤ 𝑘)) | |
| 7 | 6 | 3expa 1136 | . . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑘 ∈ ℤ) → ((𝑀 ≤ 𝑁 ∧ 𝑁 ≤ 𝑘) → 𝑀 ≤ 𝑘)) |
| 8 | 5, 7 | sylan 592 | . . . . 5 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝑘 ∈ ℤ) → ((𝑀 ≤ 𝑁 ∧ 𝑁 ≤ 𝑘) → 𝑀 ≤ 𝑘)) |
| 9 | 2, 8 | mpand 708 | . . . 4 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝑘 ∈ ℤ) → (𝑁 ≤ 𝑘 → 𝑀 ≤ 𝑘)) |
| 10 | 9 | imdistanda 582 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → ((𝑘 ∈ ℤ ∧ 𝑁 ≤ 𝑘) → (𝑘 ∈ ℤ ∧ 𝑀 ≤ 𝑘))) |
| 11 | eluz1 12916 | . . . 4 ⊢ (𝑁 ∈ ℤ → (𝑘 ∈ (ℤ≥‘𝑁) ↔ (𝑘 ∈ ℤ ∧ 𝑁 ≤ 𝑘))) | |
| 12 | 4, 11 | syl 18 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑘 ∈ (ℤ≥‘𝑁) ↔ (𝑘 ∈ ℤ ∧ 𝑁 ≤ 𝑘))) |
| 13 | eluz1 12916 | . . . 4 ⊢ (𝑀 ∈ ℤ → (𝑘 ∈ (ℤ≥‘𝑀) ↔ (𝑘 ∈ ℤ ∧ 𝑀 ≤ 𝑘))) | |
| 14 | 3, 13 | syl 18 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑘 ∈ (ℤ≥‘𝑀) ↔ (𝑘 ∈ ℤ ∧ 𝑀 ≤ 𝑘))) |
| 15 | 10, 12, 14 | 3imtr4d 297 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑘 ∈ (ℤ≥‘𝑁) → 𝑘 ∈ (ℤ≥‘𝑀))) |
| 16 | 15 | ssrdv 3937 | 1 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (ℤ≥‘𝑁) ⊆ (ℤ≥‘𝑀)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∈ wcel 2145 ⊆ wss 3899 class class class wbr 5103 ‘cfv 6535 ≤ cle 11293 ℤcz 12640 ℤ≥cuz 12912 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7742 ax-cnex 11205 ax-resscn 11206 ax-pre-lttri 11223 ax-pre-lttrn 11224 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6491 df-fun 6537 df-fn 6538 df-f 6539 df-f1 6540 df-fo 6541 df-f1o 6542 df-fv 6543 df-ov 7419 df-er 8703 df-en 8960 df-dom 8961 df-sdom 8962 df-pnf 11294 df-mnf 11295 df-xr 11296 df-ltxr 11297 df-le 11298 df-neg 11493 df-z 12641 df-uz 12913 |
| This theorem is used by: uzin 12948 uzuzle35 12961 uznnssnn 12969 fzopth 13641 4fvwrd4 13728 fzouzsplit 13775 fzoopth 13843 seqfeq2 14114 rexuzre 15465 cau3lem 15467 climsup 15782 isumsplit 15954 isumrpcl 15957 cvgrat 15997 clim2prod 16002 fprodntriv 16054 isprm3 16798 pcfac 17016 lmflf 24263 caucfil 25543 uniioombllem4 25846 mbflimsup 25926 ulmres 26656 ulmcaulem 26662 logfaclbnd 27490 axlowdimlem17 29447 clwwlkinwwlk 30542 fz2ssnn0 33288 evl1deg1 34019 evl1deg2 34020 evl1deg3 34021 poimirlem1 38435 poimirlem2 38436 poimirlem6 38440 poimirlem7 38441 poimirlem20 38454 uzssd 46301 climinf 46501 climsuse 46503 climresmpt 46552 climleltrp 46569 limsupequzlem 46615 supcnvlimsup 46633 ioodvbdlimc1lem1 46824 ioodvbdlimc1lem2 46825 ioodvbdlimc2lem 46827 meaiininclem 47379 smflimlem2 47665 smflimsuplem2 47714 smflimsuplem3 47715 smflimsuplem4 47716 smflimsuplem5 47717 smflimsuplem6 47718 smflimsuplem7 47719 nprmdvdsfacm1lem4 48591 nprmdvdsfacm1 48592 ppivalnnnprmge6 48594 |
| Copyright terms: Public domain | W3C validator |