| 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 12901 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ≤ 𝑁) | |
| 2 | 1 | adantr 486 | . . . . 5 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝑘 ∈ ℤ) → 𝑀 ≤ 𝑁) |
| 3 | eluzel2 12893 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ) | |
| 4 | eluzelz 12898 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ ℤ) | |
| 5 | 3, 4 | jca 521 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) |
| 6 | zletr 12663 | . . . . . . 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 12892 | . . . 4 ⊢ (𝑁 ∈ ℤ → (𝑘 ∈ (ℤ≥‘𝑁) ↔ (𝑘 ∈ ℤ ∧ 𝑁 ≤ 𝑘))) | |
| 12 | 4, 11 | syl 18 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑘 ∈ (ℤ≥‘𝑁) ↔ (𝑘 ∈ ℤ ∧ 𝑁 ≤ 𝑘))) |
| 13 | eluz1 12892 | . . . 4 ⊢ (𝑀 ∈ ℤ → (𝑘 ∈ (ℤ≥‘𝑀) ↔ (𝑘 ∈ ℤ ∧ 𝑀 ≤ 𝑘))) | |
| 14 | 3, 13 | syl 18 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑘 ∈ (ℤ≥‘𝑀) ↔ (𝑘 ∈ ℤ ∧ 𝑀 ≤ 𝑘))) |
| 15 | 10, 12, 14 | 3imtr4d 297 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑘 ∈ (ℤ≥‘𝑁) → 𝑘 ∈ (ℤ≥‘𝑀))) |
| 16 | 15 | ssrdv 3940 | 1 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (ℤ≥‘𝑁) ⊆ (ℤ≥‘𝑀)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∈ wcel 2145 ⊆ wss 3902 class class class wbr 5107 ‘cfv 6537 ≤ cle 11269 ℤcz 12616 ℤ≥cuz 12888 |
| 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 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-cnex 11181 ax-resscn 11182 ax-pre-lttri 11199 ax-pre-lttrn 11200 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7419 df-er 8699 df-en 8956 df-dom 8957 df-sdom 8958 df-pnf 11270 df-mnf 11271 df-xr 11272 df-ltxr 11273 df-le 11274 df-neg 11469 df-z 12617 df-uz 12889 |
| This theorem is used by: uzin 12924 uzuzle35 12937 uznnssnn 12945 fzopth 13616 4fvwrd4 13703 fzouzsplit 13750 fzoopth 13818 seqfeq2 14089 rexuzre 15440 cau3lem 15442 climsup 15757 isumsplit 15929 isumrpcl 15932 cvgrat 15972 clim2prod 15977 fprodntriv 16031 isprm3 16775 pcfac 16993 lmflf 24230 caucfil 25510 uniioombllem4 25813 mbflimsup 25893 ulmres 26619 ulmcaulem 26625 logfaclbnd 27454 axlowdimlem17 29399 clwwlkinwwlk 30494 fz2ssnn0 33241 evl1deg1 33971 evl1deg2 33972 evl1deg3 33973 poimirlem1 38355 poimirlem2 38356 poimirlem6 38360 poimirlem7 38361 poimirlem20 38374 uzssd 46221 climinf 46421 climsuse 46423 climresmpt 46472 climleltrp 46489 limsupequzlem 46535 supcnvlimsup 46553 ioodvbdlimc1lem1 46744 ioodvbdlimc1lem2 46745 ioodvbdlimc2lem 46747 meaiininclem 47299 smflimlem2 47585 smflimsuplem2 47634 smflimsuplem3 47635 smflimsuplem4 47636 smflimsuplem5 47637 smflimsuplem6 47638 smflimsuplem7 47639 nprmdvdsfacm1lem4 48511 nprmdvdsfacm1 48512 ppivalnnnprmge6 48514 |
| Copyright terms: Public domain | W3C validator |