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 10691 | . . 3 ⊢ (𝜑 → 𝑋 ∈ ℝ*) |
3 | pnfxr 10695 | . . . 4 ⊢ +∞ ∈ ℝ* | |
4 | 3 | a1i 11 | . . 3 ⊢ (𝜑 → +∞ ∈ ℝ*) |
5 | 1 | ceilcld 41746 | . . . . . 6 ⊢ (𝜑 → (⌈‘𝑋) ∈ ℤ) |
6 | 1zzd 12014 | . . . . . 6 ⊢ (𝜑 → 1 ∈ ℤ) | |
7 | 5, 6 | zaddcld 12092 | . . . . 5 ⊢ (𝜑 → ((⌈‘𝑋) + 1) ∈ ℤ) |
8 | 7 | zred 12088 | . . . 4 ⊢ (𝜑 → ((⌈‘𝑋) + 1) ∈ ℝ) |
9 | uzubioo.1 | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
10 | 9 | zred 12088 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℝ) |
11 | 8, 10 | ifcld 4512 | . . 3 ⊢ (𝜑 → if(𝑀 ≤ ((⌈‘𝑋) + 1), ((⌈‘𝑋) + 1), 𝑀) ∈ ℝ) |
12 | 5 | zred 12088 | . . . . 5 ⊢ (𝜑 → (⌈‘𝑋) ∈ ℝ) |
13 | 1 | ceilged 41740 | . . . . 5 ⊢ (𝜑 → 𝑋 ≤ (⌈‘𝑋)) |
14 | 12 | ltp1d 11570 | . . . . 5 ⊢ (𝜑 → (⌈‘𝑋) < ((⌈‘𝑋) + 1)) |
15 | 1, 12, 8, 13, 14 | lelttrd 10798 | . . . 4 ⊢ (𝜑 → 𝑋 < ((⌈‘𝑋) + 1)) |
16 | 10, 8 | max2d 41754 | . . . 4 ⊢ (𝜑 → ((⌈‘𝑋) + 1) ≤ if(𝑀 ≤ ((⌈‘𝑋) + 1), ((⌈‘𝑋) + 1), 𝑀)) |
17 | 1, 8, 11, 15, 16 | ltletrd 10800 | . . 3 ⊢ (𝜑 → 𝑋 < if(𝑀 ≤ ((⌈‘𝑋) + 1), ((⌈‘𝑋) + 1), 𝑀)) |
18 | 11 | ltpnfd 12517 | . . 3 ⊢ (𝜑 → if(𝑀 ≤ ((⌈‘𝑋) + 1), ((⌈‘𝑋) + 1), 𝑀) < +∞) |
19 | 2, 4, 11, 17, 18 | eliood 41793 | . 2 ⊢ (𝜑 → if(𝑀 ≤ ((⌈‘𝑋) + 1), ((⌈‘𝑋) + 1), 𝑀) ∈ (𝑋(,)+∞)) |
20 | uzubioo.2 | . . 3 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
21 | 7, 9 | ifcld 4512 | . . 3 ⊢ (𝜑 → if(𝑀 ≤ ((⌈‘𝑋) + 1), ((⌈‘𝑋) + 1), 𝑀) ∈ ℤ) |
22 | max1 12579 | . . . 4 ⊢ ((𝑀 ∈ ℝ ∧ ((⌈‘𝑋) + 1) ∈ ℝ) → 𝑀 ≤ if(𝑀 ≤ ((⌈‘𝑋) + 1), ((⌈‘𝑋) + 1), 𝑀)) | |
23 | 10, 8, 22 | syl2anc 586 | . . 3 ⊢ (𝜑 → 𝑀 ≤ if(𝑀 ≤ ((⌈‘𝑋) + 1), ((⌈‘𝑋) + 1), 𝑀)) |
24 | 20, 9, 21, 23 | eluzd 41702 | . 2 ⊢ (𝜑 → if(𝑀 ≤ ((⌈‘𝑋) + 1), ((⌈‘𝑋) + 1), 𝑀) ∈ 𝑍) |
25 | eleq1 2900 | . . 3 ⊢ (𝑘 = if(𝑀 ≤ ((⌈‘𝑋) + 1), ((⌈‘𝑋) + 1), 𝑀) → (𝑘 ∈ 𝑍 ↔ if(𝑀 ≤ ((⌈‘𝑋) + 1), ((⌈‘𝑋) + 1), 𝑀) ∈ 𝑍)) | |
26 | 25 | rspcev 3623 | . 2 ⊢ ((if(𝑀 ≤ ((⌈‘𝑋) + 1), ((⌈‘𝑋) + 1), 𝑀) ∈ (𝑋(,)+∞) ∧ if(𝑀 ≤ ((⌈‘𝑋) + 1), ((⌈‘𝑋) + 1), 𝑀) ∈ 𝑍) → ∃𝑘 ∈ (𝑋(,)+∞)𝑘 ∈ 𝑍) |
27 | 19, 24, 26 | syl2anc 586 | 1 ⊢ (𝜑 → ∃𝑘 ∈ (𝑋(,)+∞)𝑘 ∈ 𝑍) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2114 ∃wrex 3139 ifcif 4467 class class class wbr 5066 ‘cfv 6355 (class class class)co 7156 ℝcr 10536 1c1 10538 + caddc 10540 +∞cpnf 10672 ℝ*cxr 10674 ≤ cle 10676 ℤcz 11982 ℤ≥cuz 12244 (,)cioo 12739 ⌈cceil 13162 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614 ax-pre-sup 10615 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-1st 7689 df-2nd 7690 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-er 8289 df-en 8510 df-dom 8511 df-sdom 8512 df-sup 8906 df-inf 8907 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-nn 11639 df-n0 11899 df-z 11983 df-uz 12245 df-ioo 12743 df-fl 13163 df-ceil 13164 |
This theorem is referenced by: uzubico 41864 uzubioo2 41865 |
Copyright terms: Public domain | W3C validator |