![]() |
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 482 | . . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ ℝ) → 𝑀 ∈ ℤ) | |
2 | flcl 13761 | . . . . . . . 8 ⊢ (𝑥 ∈ ℝ → (⌊‘𝑥) ∈ ℤ) | |
3 | 2 | peano2zd 12668 | . . . . . . 7 ⊢ (𝑥 ∈ ℝ → ((⌊‘𝑥) + 1) ∈ ℤ) |
4 | id 22 | . . . . . . 7 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℤ) | |
5 | ifcl 4566 | . . . . . . 7 ⊢ ((((⌊‘𝑥) + 1) ∈ ℤ ∧ 𝑀 ∈ ℤ) → if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀) ∈ ℤ) | |
6 | 3, 4, 5 | syl2anr 596 | . . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ ℝ) → if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀) ∈ ℤ) |
7 | zre 12561 | . . . . . . 7 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℝ) | |
8 | reflcl 13762 | . . . . . . . 8 ⊢ (𝑥 ∈ ℝ → (⌊‘𝑥) ∈ ℝ) | |
9 | peano2re 11386 | . . . . . . . 8 ⊢ ((⌊‘𝑥) ∈ ℝ → ((⌊‘𝑥) + 1) ∈ ℝ) | |
10 | 8, 9 | syl 17 | . . . . . . 7 ⊢ (𝑥 ∈ ℝ → ((⌊‘𝑥) + 1) ∈ ℝ) |
11 | max1 13165 | . . . . . . 7 ⊢ ((𝑀 ∈ ℝ ∧ ((⌊‘𝑥) + 1) ∈ ℝ) → 𝑀 ≤ if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀)) | |
12 | 7, 10, 11 | syl2an 595 | . . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ ℝ) → 𝑀 ≤ if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀)) |
13 | eluz2 12827 | . . . . . 6 ⊢ (if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀) ∈ (ℤ≥‘𝑀) ↔ (𝑀 ∈ ℤ ∧ if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀) ∈ ℤ ∧ 𝑀 ≤ if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀))) | |
14 | 1, 6, 12, 13 | syl3anbrc 1340 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ ℝ) → if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀) ∈ (ℤ≥‘𝑀)) |
15 | uzsup.1 | . . . . 5 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
16 | 14, 15 | eleqtrrdi 2836 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ ℝ) → if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀) ∈ 𝑍) |
17 | simpr 484 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ ℝ) → 𝑥 ∈ ℝ) | |
18 | 10 | adantl 481 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ ℝ) → ((⌊‘𝑥) + 1) ∈ ℝ) |
19 | 6 | zred 12665 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ ℝ) → if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀) ∈ ℝ) |
20 | fllep1 13767 | . . . . . 6 ⊢ (𝑥 ∈ ℝ → 𝑥 ≤ ((⌊‘𝑥) + 1)) | |
21 | 20 | adantl 481 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ ℝ) → 𝑥 ≤ ((⌊‘𝑥) + 1)) |
22 | max2 13167 | . . . . . 6 ⊢ ((𝑀 ∈ ℝ ∧ ((⌊‘𝑥) + 1) ∈ ℝ) → ((⌊‘𝑥) + 1) ≤ if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀)) | |
23 | 7, 10, 22 | syl2an 595 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ ℝ) → ((⌊‘𝑥) + 1) ≤ if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀)) |
24 | 17, 18, 19, 21, 23 | letrd 11370 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ ℝ) → 𝑥 ≤ if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀)) |
25 | breq2 5143 | . . . . 5 ⊢ (𝑛 = if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀) → (𝑥 ≤ 𝑛 ↔ 𝑥 ≤ if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀))) | |
26 | 25 | rspcev 3604 | . . . 4 ⊢ ((if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀) ∈ 𝑍 ∧ 𝑥 ≤ if(𝑀 ≤ ((⌊‘𝑥) + 1), ((⌊‘𝑥) + 1), 𝑀)) → ∃𝑛 ∈ 𝑍 𝑥 ≤ 𝑛) |
27 | 16, 24, 26 | syl2anc 583 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ ℝ) → ∃𝑛 ∈ 𝑍 𝑥 ≤ 𝑛) |
28 | 27 | ralrimiva 3138 | . 2 ⊢ (𝑀 ∈ ℤ → ∀𝑥 ∈ ℝ ∃𝑛 ∈ 𝑍 𝑥 ≤ 𝑛) |
29 | uzssz 12842 | . . . . . 6 ⊢ (ℤ≥‘𝑀) ⊆ ℤ | |
30 | 15, 29 | eqsstri 4009 | . . . . 5 ⊢ 𝑍 ⊆ ℤ |
31 | zssre 12564 | . . . . 5 ⊢ ℤ ⊆ ℝ | |
32 | 30, 31 | sstri 3984 | . . . 4 ⊢ 𝑍 ⊆ ℝ |
33 | ressxr 11257 | . . . 4 ⊢ ℝ ⊆ ℝ* | |
34 | 32, 33 | sstri 3984 | . . 3 ⊢ 𝑍 ⊆ ℝ* |
35 | supxrunb1 13299 | . . 3 ⊢ (𝑍 ⊆ ℝ* → (∀𝑥 ∈ ℝ ∃𝑛 ∈ 𝑍 𝑥 ≤ 𝑛 ↔ sup(𝑍, ℝ*, < ) = +∞)) | |
36 | 34, 35 | ax-mp 5 | . 2 ⊢ (∀𝑥 ∈ ℝ ∃𝑛 ∈ 𝑍 𝑥 ≤ 𝑛 ↔ sup(𝑍, ℝ*, < ) = +∞) |
37 | 28, 36 | sylib 217 | 1 ⊢ (𝑀 ∈ ℤ → sup(𝑍, ℝ*, < ) = +∞) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1533 ∈ wcel 2098 ∀wral 3053 ∃wrex 3062 ⊆ wss 3941 ifcif 4521 class class class wbr 5139 ‘cfv 6534 (class class class)co 7402 supcsup 9432 ℝcr 11106 1c1 11108 + caddc 11110 +∞cpnf 11244 ℝ*cxr 11246 < clt 11247 ≤ cle 11248 ℤcz 12557 ℤ≥cuz 12821 ⌊cfl 13756 |
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-1cn 11165 ax-icn 11166 ax-addcl 11167 ax-addrcl 11168 ax-mulcl 11169 ax-mulrcl 11170 ax-mulcom 11171 ax-addass 11172 ax-mulass 11173 ax-distr 11174 ax-i2m1 11175 ax-1ne0 11176 ax-1rid 11177 ax-rnegex 11178 ax-rrecex 11179 ax-cnre 11180 ax-pre-lttri 11181 ax-pre-lttrn 11182 ax-pre-ltadd 11183 ax-pre-mulgt0 11184 ax-pre-sup 11185 |
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-rmo 3368 df-reu 3369 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-pss 3960 df-nul 4316 df-if 4522 df-pw 4597 df-sn 4622 df-pr 4624 df-op 4628 df-uni 4901 df-iun 4990 df-br 5140 df-opab 5202 df-mpt 5223 df-tr 5257 df-id 5565 df-eprel 5571 df-po 5579 df-so 5580 df-fr 5622 df-we 5624 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-pred 6291 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 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-riota 7358 df-ov 7405 df-oprab 7406 df-mpo 7407 df-om 7850 df-2nd 7970 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-er 8700 df-en 8937 df-dom 8938 df-sdom 8939 df-sup 9434 df-inf 9435 df-pnf 11249 df-mnf 11250 df-xr 11251 df-ltxr 11252 df-le 11253 df-sub 11445 df-neg 11446 df-nn 12212 df-n0 12472 df-z 12558 df-uz 12822 df-fl 13758 |
This theorem is referenced by: climrecl 15529 climge0 15530 caurcvg 15625 caucvg 15627 mbflimsup 25539 limsupvaluz 44970 ioodvbdlimc1lem2 45194 ioodvbdlimc2lem 45196 |
Copyright terms: Public domain | W3C validator |