![]() |
Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > uzubioo | Structured version Visualization version GIF version |
Description: The upper integers are unbounded above. (Contributed by Glauco Siliprandi, 2-Jan-2022.) |
Ref | Expression |
---|---|
uzubioo.1 | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
uzubioo.2 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
uzubioo.3 | ⊢ (𝜑 → 𝑋 ∈ ℝ) |
Ref | Expression |
---|---|
uzubioo | ⊢ (𝜑 → ∃𝑘 ∈ (𝑋(,)+∞)𝑘 ∈ 𝑍) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | uzubioo.3 | . . . 4 ⊢ (𝜑 → 𝑋 ∈ ℝ) | |
2 | 1 | rexrd 11340 | . . 3 ⊢ (𝜑 → 𝑋 ∈ ℝ*) |
3 | pnfxr 11344 | . . . 4 ⊢ +∞ ∈ ℝ* | |
4 | 3 | a1i 11 | . . 3 ⊢ (𝜑 → +∞ ∈ ℝ*) |
5 | 1 | ceilcld 13894 | . . . . . 6 ⊢ (𝜑 → (⌈‘𝑋) ∈ ℤ) |
6 | 1zzd 12674 | . . . . . 6 ⊢ (𝜑 → 1 ∈ ℤ) | |
7 | 5, 6 | zaddcld 12751 | . . . . 5 ⊢ (𝜑 → ((⌈‘𝑋) + 1) ∈ ℤ) |
8 | 7 | zred 12747 | . . . 4 ⊢ (𝜑 → ((⌈‘𝑋) + 1) ∈ ℝ) |
9 | uzubioo.1 | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
10 | 9 | zred 12747 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℝ) |
11 | 8, 10 | ifcld 4594 | . . 3 ⊢ (𝜑 → if(𝑀 ≤ ((⌈‘𝑋) + 1), ((⌈‘𝑋) + 1), 𝑀) ∈ ℝ) |
12 | 5 | zred 12747 | . . . . 5 ⊢ (𝜑 → (⌈‘𝑋) ∈ ℝ) |
13 | 1 | ceilged 13897 | . . . . 5 ⊢ (𝜑 → 𝑋 ≤ (⌈‘𝑋)) |
14 | 12 | ltp1d 12225 | . . . . 5 ⊢ (𝜑 → (⌈‘𝑋) < ((⌈‘𝑋) + 1)) |
15 | 1, 12, 8, 13, 14 | lelttrd 11448 | . . . 4 ⊢ (𝜑 → 𝑋 < ((⌈‘𝑋) + 1)) |
16 | 10, 8 | max2d 45373 | . . . 4 ⊢ (𝜑 → ((⌈‘𝑋) + 1) ≤ if(𝑀 ≤ ((⌈‘𝑋) + 1), ((⌈‘𝑋) + 1), 𝑀)) |
17 | 1, 8, 11, 15, 16 | ltletrd 11450 | . . 3 ⊢ (𝜑 → 𝑋 < if(𝑀 ≤ ((⌈‘𝑋) + 1), ((⌈‘𝑋) + 1), 𝑀)) |
18 | 11 | ltpnfd 13184 | . . 3 ⊢ (𝜑 → if(𝑀 ≤ ((⌈‘𝑋) + 1), ((⌈‘𝑋) + 1), 𝑀) < +∞) |
19 | 2, 4, 11, 17, 18 | eliood 45416 | . 2 ⊢ (𝜑 → if(𝑀 ≤ ((⌈‘𝑋) + 1), ((⌈‘𝑋) + 1), 𝑀) ∈ (𝑋(,)+∞)) |
20 | uzubioo.2 | . . 3 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
21 | 7, 9 | ifcld 4594 | . . 3 ⊢ (𝜑 → if(𝑀 ≤ ((⌈‘𝑋) + 1), ((⌈‘𝑋) + 1), 𝑀) ∈ ℤ) |
22 | max1 13247 | . . . 4 ⊢ ((𝑀 ∈ ℝ ∧ ((⌈‘𝑋) + 1) ∈ ℝ) → 𝑀 ≤ if(𝑀 ≤ ((⌈‘𝑋) + 1), ((⌈‘𝑋) + 1), 𝑀)) | |
23 | 10, 8, 22 | syl2anc 583 | . . 3 ⊢ (𝜑 → 𝑀 ≤ if(𝑀 ≤ ((⌈‘𝑋) + 1), ((⌈‘𝑋) + 1), 𝑀)) |
24 | 20, 9, 21, 23 | eluzd 45324 | . 2 ⊢ (𝜑 → if(𝑀 ≤ ((⌈‘𝑋) + 1), ((⌈‘𝑋) + 1), 𝑀) ∈ 𝑍) |
25 | eleq1 2832 | . . 3 ⊢ (𝑘 = if(𝑀 ≤ ((⌈‘𝑋) + 1), ((⌈‘𝑋) + 1), 𝑀) → (𝑘 ∈ 𝑍 ↔ if(𝑀 ≤ ((⌈‘𝑋) + 1), ((⌈‘𝑋) + 1), 𝑀) ∈ 𝑍)) | |
26 | 25 | rspcev 3635 | . 2 ⊢ ((if(𝑀 ≤ ((⌈‘𝑋) + 1), ((⌈‘𝑋) + 1), 𝑀) ∈ (𝑋(,)+∞) ∧ if(𝑀 ≤ ((⌈‘𝑋) + 1), ((⌈‘𝑋) + 1), 𝑀) ∈ 𝑍) → ∃𝑘 ∈ (𝑋(,)+∞)𝑘 ∈ 𝑍) |
27 | 19, 24, 26 | syl2anc 583 | 1 ⊢ (𝜑 → ∃𝑘 ∈ (𝑋(,)+∞)𝑘 ∈ 𝑍) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2108 ∃wrex 3076 ifcif 4548 class class class wbr 5166 ‘cfv 6573 (class class class)co 7448 ℝcr 11183 1c1 11185 + caddc 11187 +∞cpnf 11321 ℝ*cxr 11323 ≤ cle 11325 ℤcz 12639 ℤ≥cuz 12903 (,)cioo 13407 ⌈cceil 13842 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261 ax-pre-sup 11262 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-om 7904 df-1st 8030 df-2nd 8031 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-er 8763 df-en 9004 df-dom 9005 df-sdom 9006 df-sup 9511 df-inf 9512 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-nn 12294 df-n0 12554 df-z 12640 df-uz 12904 df-ioo 13411 df-fl 13843 df-ceil 13844 |
This theorem is referenced by: uzubico 45486 uzubioo2 45487 |
Copyright terms: Public domain | W3C validator |