| 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 12879 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ≤ 𝑁) | |
| 2 | 1 | adantr 485 | . . . . 5 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝑘 ∈ ℤ) → 𝑀 ≤ 𝑁) |
| 3 | eluzel2 12871 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ) | |
| 4 | eluzelz 12876 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ ℤ) | |
| 5 | 3, 4 | jca 520 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) |
| 6 | zletr 12642 | . . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑘 ∈ ℤ) → ((𝑀 ≤ 𝑁 ∧ 𝑁 ≤ 𝑘) → 𝑀 ≤ 𝑘)) | |
| 7 | 6 | 3expa 1136 | . . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑘 ∈ ℤ) → ((𝑀 ≤ 𝑁 ∧ 𝑁 ≤ 𝑘) → 𝑀 ≤ 𝑘)) |
| 8 | 5, 7 | sylan 591 | . . . . 5 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝑘 ∈ ℤ) → ((𝑀 ≤ 𝑁 ∧ 𝑁 ≤ 𝑘) → 𝑀 ≤ 𝑘)) |
| 9 | 2, 8 | mpand 707 | . . . 4 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝑘 ∈ ℤ) → (𝑁 ≤ 𝑘 → 𝑀 ≤ 𝑘)) |
| 10 | 9 | imdistanda 581 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → ((𝑘 ∈ ℤ ∧ 𝑁 ≤ 𝑘) → (𝑘 ∈ ℤ ∧ 𝑀 ≤ 𝑘))) |
| 11 | eluz1 12870 | . . . 4 ⊢ (𝑁 ∈ ℤ → (𝑘 ∈ (ℤ≥‘𝑁) ↔ (𝑘 ∈ ℤ ∧ 𝑁 ≤ 𝑘))) | |
| 12 | 4, 11 | syl 18 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑘 ∈ (ℤ≥‘𝑁) ↔ (𝑘 ∈ ℤ ∧ 𝑁 ≤ 𝑘))) |
| 13 | eluz1 12870 | . . . 4 ⊢ (𝑀 ∈ ℤ → (𝑘 ∈ (ℤ≥‘𝑀) ↔ (𝑘 ∈ ℤ ∧ 𝑀 ≤ 𝑘))) | |
| 14 | 3, 13 | syl 18 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑘 ∈ (ℤ≥‘𝑀) ↔ (𝑘 ∈ ℤ ∧ 𝑀 ≤ 𝑘))) |
| 15 | 10, 12, 14 | 3imtr4d 297 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑘 ∈ (ℤ≥‘𝑁) → 𝑘 ∈ (ℤ≥‘𝑀))) |
| 16 | 15 | ssrdv 3943 | 1 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (ℤ≥‘𝑁) ⊆ (ℤ≥‘𝑀)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 400 ∈ wcel 2143 ⊆ wss 3905 class class class wbr 5109 ‘cfv 6536 ≤ cle 11248 ℤcz 12595 ℤ≥cuz 12866 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11160 ax-resscn 11161 ax-pre-lttri 11178 ax-pre-lttrn 11179 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-opab 5174 df-mpt 5193 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-ov 7413 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11249 df-mnf 11250 df-xr 11251 df-ltxr 11252 df-le 11253 df-neg 11448 df-z 12596 df-uz 12867 |
| This theorem is used by: uzin 12902 uzuzle35 12915 uznnssnn 12923 fzopth 13594 4fvwrd4 13681 fzouzsplit 13728 fzoopth 13796 seqfeq2 14066 rexuzre 15409 cau3lem 15411 climsup 15726 isumsplit 15899 isumrpcl 15902 cvgrat 15942 clim2prod 15947 fprodntriv 16001 isprm3 16745 pcfac 16963 lmflf 24171 caucfil 25451 uniioombllem4 25754 mbflimsup 25834 ulmres 26560 ulmcaulem 26566 logfaclbnd 27395 axlowdimlem17 29317 clwwlkinwwlk 30400 fz2ssnn0 33139 evl1deg1 33875 evl1deg2 33876 evl1deg3 33877 poimirlem1 38300 poimirlem2 38301 poimirlem6 38305 poimirlem7 38306 poimirlem20 38319 uzssd 46150 climinf 46350 climsuse 46352 climresmpt 46401 climleltrp 46418 limsupequzlem 46464 supcnvlimsup 46482 ioodvbdlimc1lem1 46673 ioodvbdlimc1lem2 46674 ioodvbdlimc2lem 46676 meaiininclem 47228 smflimlem2 47514 smflimsuplem2 47563 smflimsuplem3 47564 smflimsuplem4 47565 smflimsuplem5 47566 smflimsuplem6 47567 smflimsuplem7 47568 nprmdvdsfacm1lem4 48403 nprmdvdsfacm1 48404 ppivalnnnprmge6 48406 |
| Copyright terms: Public domain | W3C validator |