| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > uzsup | Structured version Visualization version GIF version | ||
| Description: An upper set of integers is unbounded above. (Contributed by Mario Carneiro, 7-May-2016.) |
| Ref | Expression |
|---|---|
| uzsup.1 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
| Ref | Expression |
|---|---|
| uzsup | ⊢ (𝑀 ∈ ℤ → sup(𝑍, ℝ*, < ) = +∞) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 488 | . . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ ℝ) → 𝑀 ∈ ℤ) | |
| 2 | flcl 13975 | . . . . . . . 8 ⊢ (𝑥 ∈ ℝ → (⌊‘𝑥) ∈ ℤ) | |
| 3 | 2 | peano2zd 12846 | . . . . . . 7 ⊢ (𝑥 ∈ ℝ → ((⌊‘𝑥) + 1) ∈ ℤ) |
| 4 | id 23 | . . . . . . 7 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℤ) | |
| 5 | ifcl 4531 | . . . . . . 7 ⊢ ((((⌊‘𝑥) + 1) ∈ ℤ ∧ 𝑀 ∈ ℤ) → if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀) ∈ ℤ) | |
| 6 | 3, 4, 5 | syl2anr 609 | . . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ ℝ) → if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀) ∈ ℤ) |
| 7 | zre 12737 | . . . . . . 7 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℝ) | |
| 8 | reflcl 13976 | . . . . . . . 8 ⊢ (𝑥 ∈ ℝ → (⌊‘𝑥) ∈ ℝ) | |
| 9 | peano2re 11522 | . . . . . . . 8 ⊢ ((⌊‘𝑥) ∈ ℝ → ((⌊‘𝑥) + 1) ∈ ℝ) | |
| 10 | 8, 9 | syl 18 | . . . . . . 7 ⊢ (𝑥 ∈ ℝ → ((⌊‘𝑥) + 1) ∈ ℝ) |
| 11 | max1 13355 | . . . . . . 7 ⊢ ((𝑀 ∈ ℝ ∧ ((⌊‘𝑥) + 1) ∈ ℝ) → 𝑀 ≤ if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀)) | |
| 12 | 7, 10, 11 | syl2an 608 | . . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ ℝ) → 𝑀 ≤ if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀)) |
| 13 | eluz2 13011 | . . . . . 6 ⊢ (if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀) ∈ (ℤ≥‘𝑀) ↔ (𝑀 ∈ ℤ ∧ if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀) ∈ ℤ ∧ 𝑀 ≤ if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀))) | |
| 14 | 1, 6, 12, 13 | syl3anbrc 1362 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ ℝ) → if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀) ∈ (ℤ≥‘𝑀)) |
| 15 | uzsup.1 | . . . . 5 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
| 16 | 14, 15 | eleqtrrdi 2875 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ ℝ) → if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀) ∈ 𝑍) |
| 17 | simpr 490 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ ℝ) → 𝑥 ∈ ℝ) | |
| 18 | 10 | adantl 487 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ ℝ) → ((⌊‘𝑥) + 1) ∈ ℝ) |
| 19 | 6 | zred 12843 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ ℝ) → if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀) ∈ ℝ) |
| 20 | fllep1 13981 | . . . . . 6 ⊢ (𝑥 ∈ ℝ → 𝑥 ≤ ((⌊‘𝑥) + 1)) | |
| 21 | 20 | adantl 487 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ ℝ) → 𝑥 ≤ ((⌊‘𝑥) + 1)) |
| 22 | max2 13357 | . . . . . 6 ⊢ ((𝑀 ∈ ℝ ∧ ((⌊‘𝑥) + 1) ∈ ℝ) → ((⌊‘𝑥) + 1) ≤ if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀)) | |
| 23 | 7, 10, 22 | syl2an 608 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ ℝ) → ((⌊‘𝑥) + 1) ≤ if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀)) |
| 24 | 17, 18, 19, 21, 23 | letrd 11506 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ ℝ) → 𝑥 ≤ if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀)) |
| 25 | breq2 5112 | . . . . 5 ⊢ (𝑛 = if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀) → (𝑥 ≤ 𝑛 ↔ 𝑥 ≤ if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀))) | |
| 26 | 25 | rspcev 3580 | . . . 4 ⊢ ((if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀) ∈ 𝑍 ∧ 𝑥 ≤ if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀)) → ∃𝑛 ∈ 𝑍 𝑥 ≤ 𝑛) |
| 27 | 16, 24, 26 | syl2anc 596 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ ℝ) → ∃𝑛 ∈ 𝑍 𝑥 ≤ 𝑛) |
| 28 | 27 | ralrimiva 3158 | . 2 ⊢ (𝑀 ∈ ℤ → ∀𝑥 ∈ ℝ ∃𝑛 ∈ 𝑍 𝑥 ≤ 𝑛) |
| 29 | uzssz 13026 | . . . . . 6 ⊢ (ℤ≥‘𝑀) ⊆ ℤ | |
| 30 | 15, 29 | eqsstri 3959 | . . . . 5 ⊢ 𝑍 ⊆ ℤ |
| 31 | zssre 12740 | . . . . 5 ⊢ ℤ ⊆ ℝ | |
| 32 | 30, 31 | sstri 3922 | . . . 4 ⊢ 𝑍 ⊆ ℝ |
| 33 | ressxr 11392 | . . . 4 ⊢ ℝ ⊆ ℝ* | |
| 34 | 32, 33 | sstri 3922 | . . 3 ⊢ 𝑍 ⊆ ℝ* |
| 35 | supxrunb1 13489 | . . 3 ⊢ (𝑍 ⊆ ℝ* → (∀𝑥 ∈ ℝ ∃𝑛 ∈ 𝑍 𝑥 ≤ 𝑛 ↔ sup(𝑍, ℝ*, < ) = +∞)) | |
| 36 | 34, 35 | ax-mp 5 | . 2 ⊢ (∀𝑥 ∈ ℝ ∃𝑛 ∈ 𝑍 𝑥 ≤ 𝑛 ↔ sup(𝑍, ℝ*, < ) = +∞) |
| 37 | 28, 36 | sylib 221 | 1 ⊢ (𝑀 ∈ ℤ → sup(𝑍, ℝ*, < ) = +∞) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∀wral 3080 ∃wrex 3090 ⊆ wss 3900 ifcif 4485 class class class wbr 5108 ‘cfv 6566 (class class class)co 7451 supcsup 9469 ℝcr 11238 1c1 11240 + caddc 11242 +∞cpnf 11379 ℝ*cxr 11381 < clt 11382 ≤ cle 11383 ℤcz 12733 ℤ≥cuz 13005 ⌊cfl 13970 |
| 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 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 ax-pre-sup 11317 |
| 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-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 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 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-sup 9471 df-inf 9472 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-n0 12647 df-z 12734 df-uz 13006 df-fl 13972 |
| This theorem is used by: climrecl 15794 climge0 15795 caurcvg 15888 caucvg 15890 mbflimsup 26042 limsupvaluz 47052 ioodvbdlimc1lem2 47276 ioodvbdlimc2lem 47278 |
| Copyright terms: Public domain | W3C validator |