| 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 13002 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ≤ 𝑁) | |
| 2 | 1 | adantr 486 | . . . . 5 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝑘 ∈ ℤ) → 𝑀 ≤ 𝑁) |
| 3 | eluzel2 12994 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ) | |
| 4 | eluzelz 12999 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ ℤ) | |
| 5 | 3, 4 | jca 521 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) |
| 6 | zletr 12764 | . . . . . . 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 12993 | . . . 4 ⊢ (𝑁 ∈ ℤ → (𝑘 ∈ (ℤ≥‘𝑁) ↔ (𝑘 ∈ ℤ ∧ 𝑁 ≤ 𝑘))) | |
| 12 | 4, 11 | syl 18 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑘 ∈ (ℤ≥‘𝑁) ↔ (𝑘 ∈ ℤ ∧ 𝑁 ≤ 𝑘))) |
| 13 | eluz1 12993 | . . . 4 ⊢ (𝑀 ∈ ℤ → (𝑘 ∈ (ℤ≥‘𝑀) ↔ (𝑘 ∈ ℤ ∧ 𝑀 ≤ 𝑘))) | |
| 14 | 3, 13 | syl 18 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑘 ∈ (ℤ≥‘𝑀) ↔ (𝑘 ∈ ℤ ∧ 𝑀 ≤ 𝑘))) |
| 15 | 10, 12, 14 | 3imtr4d 297 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑘 ∈ (ℤ≥‘𝑁) → 𝑘 ∈ (ℤ≥‘𝑀))) |
| 16 | 15 | ssrdv 3919 | 1 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (ℤ≥‘𝑁) ⊆ (ℤ≥‘𝑀)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∈ wcel 2147 ⊆ wss 3900 class class class wbr 5106 ‘cfv 6555 ≤ cle 11368 ℤcz 12717 ℤ≥cuz 12989 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7772 ax-cnex 11280 ax-resscn 11281 ax-pre-lttri 11298 ax-pre-lttrn 11299 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5171 df-mpt 5190 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 6509 df-fun 6557 df-fn 6558 df-f 6559 df-f1 6560 df-fo 6561 df-f1o 6562 df-fv 6563 df-ov 7443 df-er 8742 df-en 8999 df-dom 9000 df-sdom 9001 df-pnf 11369 df-mnf 11370 df-xr 11371 df-ltxr 11372 df-le 11373 df-neg 11568 df-z 12718 df-uz 12990 |
| This theorem is used by: uzin 13025 uzuzle35 13038 uznnssnn 13046 fzopth 13719 4fvwrd4 13806 fzouzsplit 13853 fzoopth 13921 seqfeq2 14192 rexuzre 15546 cau3lem 15548 climsup 15863 isumsplit 16035 isumrpcl 16038 cvgrat 16078 clim2prod 16083 fprodntriv 16135 isprm3 16884 pcfac 17103 lmflf 24351 caucfil 25631 uniioombllem4 25934 mbflimsup 26014 ulmres 26742 ulmcaulem 26748 logfaclbnd 27576 axlowdimlem17 29563 clwwlkinwwlk 30658 fz2ssnn0 33444 evl1deg1 34175 evl1deg2 34176 evl1deg3 34177 poimirlem1 38730 poimirlem2 38731 poimirlem6 38735 poimirlem7 38736 poimirlem20 38749 uzssd 46621 climinf 46821 climsuse 46823 climresmpt 46872 climleltrp 46889 limsupequzlem 46935 supcnvlimsup 46953 ioodvbdlimc1lem1 47144 ioodvbdlimc1lem2 47145 ioodvbdlimc2lem 47147 meaiininclem 47699 smflimlem2 47985 smflimsuplem2 48034 smflimsuplem3 48035 smflimsuplem4 48036 smflimsuplem5 48037 smflimsuplem6 48038 smflimsuplem7 48039 nprmdvdsfacm1lem4 48911 nprmdvdsfacm1 48912 ppivalnnnprmge6 48914 |
| Copyright terms: Public domain | W3C validator |