| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > rebtwn2z | Unicode version | ||
| Description: A real number can be
bounded by integers above and below which are two
apart.
The proof starts by finding two integers which are less than and greater than the given real number. Then this range can be shrunk by choosing an integer in between the endpoints of the range and then deciding which half of the range to keep based on weak linearity, and iterating until the range consists of integers which are two apart. (Contributed by Jim Kingdon, 13-Oct-2021.) |
| Ref | Expression |
|---|---|
| rebtwn2z |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | btwnz 9744 |
. . 3
| |
| 2 | reeanv 2721 |
. . 3
| |
| 3 | 1, 2 | sylibr 134 |
. 2
|
| 4 | simpll 531 |
. . . . 5
| |
| 5 | simplrl 541 |
. . . . . . . . 9
| |
| 6 | 5 | zred 9747 |
. . . . . . . 8
|
| 7 | simplrr 542 |
. . . . . . . . 9
| |
| 8 | 7 | zred 9747 |
. . . . . . . 8
|
| 9 | simprl 535 |
. . . . . . . 8
| |
| 10 | simprr 537 |
. . . . . . . 8
| |
| 11 | 6, 4, 8, 9, 10 | lttrd 8442 |
. . . . . . 7
|
| 12 | znnsub 9675 |
. . . . . . . 8
| |
| 13 | 12 | ad2antlr 493 |
. . . . . . 7
|
| 14 | 11, 13 | mpbid 147 |
. . . . . 6
|
| 15 | elnnuz 9938 |
. . . . . . . 8
| |
| 16 | eluzp1p1 9927 |
. . . . . . . 8
| |
| 17 | 15, 16 | sylbi 121 |
. . . . . . 7
|
| 18 | df-2 9342 |
. . . . . . . 8
| |
| 19 | 18 | fveq2i 5693 |
. . . . . . 7
|
| 20 | 17, 19 | eleqtrrdi 2332 |
. . . . . 6
|
| 21 | 14, 20 | syl 14 |
. . . . 5
|
| 22 | 5 | zcnd 9748 |
. . . . . . . . 9
|
| 23 | 7 | zcnd 9748 |
. . . . . . . . 9
|
| 24 | 22, 23 | pncan3d 8630 |
. . . . . . . 8
|
| 25 | 24, 8 | eqeltrd 2315 |
. . . . . . 7
|
| 26 | 8, 6 | resubcld 8698 |
. . . . . . . . 9
|
| 27 | 1red 8331 |
. . . . . . . . 9
| |
| 28 | 26, 27 | readdcld 8345 |
. . . . . . . 8
|
| 29 | 6, 28 | readdcld 8345 |
. . . . . . 7
|
| 30 | 10, 24 | breqtrrd 4153 |
. . . . . . 7
|
| 31 | 26 | ltp1d 9250 |
. . . . . . . 8
|
| 32 | 26, 28, 6, 31 | ltadd2dd 8740 |
. . . . . . 7
|
| 33 | 4, 25, 29, 30, 32 | lttrd 8442 |
. . . . . 6
|
| 34 | breq1 4128 |
. . . . . . . 8
| |
| 35 | oveq1 6082 |
. . . . . . . . 9
| |
| 36 | 35 | breq2d 4137 |
. . . . . . . 8
|
| 37 | 34, 36 | anbi12d 477 |
. . . . . . 7
|
| 38 | 37 | rspcev 2929 |
. . . . . 6
|
| 39 | 5, 9, 33, 38 | syl12anc 1276 |
. . . . 5
|
| 40 | rebtwn2zlemshrink 10666 |
. . . . 5
| |
| 41 | 4, 21, 39, 40 | syl3anc 1278 |
. . . 4
|
| 42 | 41 | ex 115 |
. . 3
|
| 43 | 42 | rexlimdvva 2676 |
. 2
|
| 44 | 3, 43 | mpd 13 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4244 ax-pow 4306 ax-pr 4341 ax-un 4573 ax-setind 4679 ax-cnex 8260 ax-resscn 8261 ax-1cn 8262 ax-1re 8263 ax-icn 8264 ax-addcl 8265 ax-addrcl 8266 ax-mulcl 8267 ax-addcom 8269 ax-addass 8271 ax-distr 8273 ax-i2m1 8274 ax-0lt1 8275 ax-0id 8277 ax-rnegex 8278 ax-cnre 8280 ax-pre-ltirr 8281 ax-pre-ltwlin 8282 ax-pre-lttrn 8283 ax-pre-ltadd 8285 ax-arch 8288 |
| This theorem depends on definitions: df-bi 117 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-int 3966 df-br 4126 df-opab 4188 df-mpt 4189 df-id 4433 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-rn 4780 df-res 4781 df-ima 4782 df-iota 5332 df-fun 5374 df-fn 5375 df-f 5376 df-fv 5380 df-riota 6028 df-ov 6078 df-oprab 6079 df-mpo 6080 df-pnf 8352 df-mnf 8353 df-xr 8354 df-ltxr 8355 df-le 8356 df-sub 8489 df-neg 8490 df-inn 9284 df-2 9342 df-n0 9543 df-z 9624 df-uz 9901 |
| This theorem is referenced by: qbtwnre 10669 |
| Copyright terms: Public domain | W3C validator |