| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > uztrn | Structured version Visualization version GIF version | ||
| Description: Transitive law for sets of upper integers. (Contributed by NM, 20-Sep-2005.) |
| Ref | Expression |
|---|---|
| uztrn | ⊢ ((𝑀 ∈ (ℤ≥‘𝐾) ∧ 𝐾 ∈ (ℤ≥‘𝑁)) → 𝑀 ∈ (ℤ≥‘𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eluzel2 12793 | . . 3 ⊢ (𝐾 ∈ (ℤ≥‘𝑁) → 𝑁 ∈ ℤ) | |
| 2 | 1 | adantl 481 | . 2 ⊢ ((𝑀 ∈ (ℤ≥‘𝐾) ∧ 𝐾 ∈ (ℤ≥‘𝑁)) → 𝑁 ∈ ℤ) |
| 3 | eluzelz 12798 | . . 3 ⊢ (𝑀 ∈ (ℤ≥‘𝐾) → 𝑀 ∈ ℤ) | |
| 4 | 3 | adantr 480 | . 2 ⊢ ((𝑀 ∈ (ℤ≥‘𝐾) ∧ 𝐾 ∈ (ℤ≥‘𝑁)) → 𝑀 ∈ ℤ) |
| 5 | eluzle 12801 | . . . 4 ⊢ (𝐾 ∈ (ℤ≥‘𝑁) → 𝑁 ≤ 𝐾) | |
| 6 | 5 | adantl 481 | . . 3 ⊢ ((𝑀 ∈ (ℤ≥‘𝐾) ∧ 𝐾 ∈ (ℤ≥‘𝑁)) → 𝑁 ≤ 𝐾) |
| 7 | eluzle 12801 | . . . 4 ⊢ (𝑀 ∈ (ℤ≥‘𝐾) → 𝐾 ≤ 𝑀) | |
| 8 | 7 | adantr 480 | . . 3 ⊢ ((𝑀 ∈ (ℤ≥‘𝐾) ∧ 𝐾 ∈ (ℤ≥‘𝑁)) → 𝐾 ≤ 𝑀) |
| 9 | eluzelz 12798 | . . . 4 ⊢ (𝐾 ∈ (ℤ≥‘𝑁) → 𝐾 ∈ ℤ) | |
| 10 | zletr 12571 | . . . 4 ⊢ ((𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ) → ((𝑁 ≤ 𝐾 ∧ 𝐾 ≤ 𝑀) → 𝑁 ≤ 𝑀)) | |
| 11 | 1, 9, 4, 10 | syl2an23an 1426 | . . 3 ⊢ ((𝑀 ∈ (ℤ≥‘𝐾) ∧ 𝐾 ∈ (ℤ≥‘𝑁)) → ((𝑁 ≤ 𝐾 ∧ 𝐾 ≤ 𝑀) → 𝑁 ≤ 𝑀)) |
| 12 | 6, 8, 11 | mp2and 700 | . 2 ⊢ ((𝑀 ∈ (ℤ≥‘𝐾) ∧ 𝐾 ∈ (ℤ≥‘𝑁)) → 𝑁 ≤ 𝑀) |
| 13 | eluz2 12794 | . 2 ⊢ (𝑀 ∈ (ℤ≥‘𝑁) ↔ (𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ≤ 𝑀)) | |
| 14 | 2, 4, 12, 13 | syl3anbrc 1345 | 1 ⊢ ((𝑀 ∈ (ℤ≥‘𝐾) ∧ 𝐾 ∈ (ℤ≥‘𝑁)) → 𝑀 ∈ (ℤ≥‘𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∈ wcel 2114 class class class wbr 5085 ‘cfv 6498 ≤ cle 11180 ℤcz 12524 ℤ≥cuz 12788 |
| 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 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-pre-lttri 11112 ax-pre-lttrn 11113 |
| 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-br 5086 df-opab 5148 df-mpt 5167 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-ov 7370 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-neg 11380 df-z 12525 df-uz 12789 |
| This theorem is referenced by: uztrn2 12807 fzsplit2 13503 fzass4 13516 fzss1 13517 fzss2 13518 uzsplit 13550 seqfveq2 13986 sermono 13996 seqsplit 13997 seqid2 14010 fzsdom2 14390 seqcoll 14426 spllen 14716 splfv2a 14718 splval2 14719 climcndslem1 15814 mertenslem1 15849 ntrivcvgfvn0 15864 zprod 15902 dvdsfac 16295 smupvallem 16452 vdwlem2 16953 vdwlem6 16957 efgredleme 19718 bposlem6 27252 dchrisumlem2 27453 axlowdimlem16 29026 fzsplit3 32866 sseqf 34536 ballotlemsima 34660 ballotlemfrc 34671 climuzcnv 35853 seqpo 38068 incsequz2 38070 mettrifi 38078 monotuz 43369 |
| Copyright terms: Public domain | W3C validator |