![]() |
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 12826 | . . 3 ⊢ (𝐾 ∈ (ℤ≥‘𝑁) → 𝑁 ∈ ℤ) | |
2 | 1 | adantl 481 | . 2 ⊢ ((𝑀 ∈ (ℤ≥‘𝐾) ∧ 𝐾 ∈ (ℤ≥‘𝑁)) → 𝑁 ∈ ℤ) |
3 | eluzelz 12831 | . . 3 ⊢ (𝑀 ∈ (ℤ≥‘𝐾) → 𝑀 ∈ ℤ) | |
4 | 3 | adantr 480 | . 2 ⊢ ((𝑀 ∈ (ℤ≥‘𝐾) ∧ 𝐾 ∈ (ℤ≥‘𝑁)) → 𝑀 ∈ ℤ) |
5 | eluzle 12834 | . . . 4 ⊢ (𝐾 ∈ (ℤ≥‘𝑁) → 𝑁 ≤ 𝐾) | |
6 | 5 | adantl 481 | . . 3 ⊢ ((𝑀 ∈ (ℤ≥‘𝐾) ∧ 𝐾 ∈ (ℤ≥‘𝑁)) → 𝑁 ≤ 𝐾) |
7 | eluzle 12834 | . . . 4 ⊢ (𝑀 ∈ (ℤ≥‘𝐾) → 𝐾 ≤ 𝑀) | |
8 | 7 | adantr 480 | . . 3 ⊢ ((𝑀 ∈ (ℤ≥‘𝐾) ∧ 𝐾 ∈ (ℤ≥‘𝑁)) → 𝐾 ≤ 𝑀) |
9 | eluzelz 12831 | . . . 4 ⊢ (𝐾 ∈ (ℤ≥‘𝑁) → 𝐾 ∈ ℤ) | |
10 | zletr 12605 | . . . 4 ⊢ ((𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ) → ((𝑁 ≤ 𝐾 ∧ 𝐾 ≤ 𝑀) → 𝑁 ≤ 𝑀)) | |
11 | 1, 9, 4, 10 | syl2an23an 1420 | . . 3 ⊢ ((𝑀 ∈ (ℤ≥‘𝐾) ∧ 𝐾 ∈ (ℤ≥‘𝑁)) → ((𝑁 ≤ 𝐾 ∧ 𝐾 ≤ 𝑀) → 𝑁 ≤ 𝑀)) |
12 | 6, 8, 11 | mp2and 696 | . 2 ⊢ ((𝑀 ∈ (ℤ≥‘𝐾) ∧ 𝐾 ∈ (ℤ≥‘𝑁)) → 𝑁 ≤ 𝑀) |
13 | eluz2 12827 | . 2 ⊢ (𝑀 ∈ (ℤ≥‘𝑁) ↔ (𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ≤ 𝑀)) | |
14 | 2, 4, 12, 13 | syl3anbrc 1340 | 1 ⊢ ((𝑀 ∈ (ℤ≥‘𝐾) ∧ 𝐾 ∈ (ℤ≥‘𝑁)) → 𝑀 ∈ (ℤ≥‘𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∈ wcel 2098 class class class wbr 5139 ‘cfv 6534 ≤ cle 11248 ℤcz 12557 ℤ≥cuz 12821 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2695 ax-sep 5290 ax-nul 5297 ax-pow 5354 ax-pr 5418 ax-un 7719 ax-cnex 11163 ax-resscn 11164 ax-pre-lttri 11181 ax-pre-lttrn 11182 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2526 df-eu 2555 df-clab 2702 df-cleq 2716 df-clel 2802 df-nfc 2877 df-ne 2933 df-nel 3039 df-ral 3054 df-rex 3063 df-rab 3425 df-v 3468 df-sbc 3771 df-csb 3887 df-dif 3944 df-un 3946 df-in 3948 df-ss 3958 df-nul 4316 df-if 4522 df-pw 4597 df-sn 4622 df-pr 4624 df-op 4628 df-uni 4901 df-br 5140 df-opab 5202 df-mpt 5223 df-id 5565 df-xp 5673 df-rel 5674 df-cnv 5675 df-co 5676 df-dm 5677 df-rn 5678 df-res 5679 df-ima 5680 df-iota 6486 df-fun 6536 df-fn 6537 df-f 6538 df-f1 6539 df-fo 6540 df-f1o 6541 df-fv 6542 df-ov 7405 df-er 8700 df-en 8937 df-dom 8938 df-sdom 8939 df-pnf 11249 df-mnf 11250 df-xr 11251 df-ltxr 11252 df-le 11253 df-neg 11446 df-z 12558 df-uz 12822 |
This theorem is referenced by: uztrn2 12840 fzsplit2 13527 fzass4 13540 fzss1 13541 fzss2 13542 uzsplit 13574 seqfveq2 13991 sermono 14001 seqsplit 14002 seqid2 14015 fzsdom2 14389 seqcoll 14427 spllen 14706 splfv2a 14708 splval2 14709 climcndslem1 15797 mertenslem1 15832 ntrivcvgfvn0 15847 zprod 15883 dvdsfac 16272 smupvallem 16427 vdwlem2 16920 vdwlem6 16924 efgredleme 19659 bposlem6 27162 dchrisumlem2 27363 axlowdimlem16 28708 fzsplit3 32499 sseqf 33910 ballotlemsima 34033 ballotlemfrc 34044 climuzcnv 35173 seqpo 37118 incsequz2 37120 mettrifi 37128 monotuz 42230 |
Copyright terms: Public domain | W3C validator |