Theorem exbtwnzlemex 10058

Description: Existence of an integer so that a given real number is between the integer and its successor. The real number must satisfy the n <_ A \/ A < n hypothesis. For example either a rational number or a number which is irrational (in the sense of being apart from any rational number) will meet this condition.

The proof starts by finding two integers which are less than and greater than A. 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 the n <_ A \/ A < n hypothesis, and iterating until the range consists of two consecutive integers. (Contributed by Jim Kingdon, 8-Oct-2021.)

Hypotheses

Ref	Expression
exbtwnzlemex.a	|- ( ph -> A e. RR )
exbtwnzlemex.tri	|- ( ( ph /\ n e. ZZ ) -> ( n <_ A \/ A < n ) )

Assertion

Ref	Expression
exbtwnzlemex	|- ( ph -> E. x e. ZZ ( x <_ A /\ A < ( x + 1 ) ) )

Distinct variable groups:   A, n   x, A   ph, n

Allowed substitution hint:   ph( x)

Proof of Theorem exbtwnzlemex

Dummy variables a j m y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		exbtwnzlemex.a	. . . 4 |- ( ph -> A e. RR )
2		btwnz 9194	. . . 4 |- ( A e. RR -> ( E. m e. ZZ m < A /\ E. j e. ZZ A < j ) )
3	1, 2	syl 14	. . 3 |- ( ph -> ( E. m e. ZZ m < A /\ E. j e. ZZ A < j ) )
4		reeanv 2603	. . 3 |- ( E. m e. ZZ E. j e. ZZ ( m < A /\ A < j ) <-> ( E. m e. ZZ m < A /\ E. j e. ZZ A < j ) )
5	3, 4	sylibr 133	. 2 |- ( ph -> E. m e. ZZ E. j e. ZZ ( m < A /\ A < j ) )
6		simplrl 525	. . . . . 6 |- ( ( ( ph /\ ( m e. ZZ /\ j e. ZZ ) ) /\ ( m < A /\ A < j ) ) -> m e. ZZ )
7	6	zred 9197	. . . . . . 7 |- ( ( ( ph /\ ( m e. ZZ /\ j e. ZZ ) ) /\ ( m < A /\ A < j ) ) -> m e. RR )
8	1	ad2antrr 480	. . . . . . 7 |- ( ( ( ph /\ ( m e. ZZ /\ j e. ZZ ) ) /\ ( m < A /\ A < j ) ) -> A e. RR )
9		simprl 521	. . . . . . 7 |- ( ( ( ph /\ ( m e. ZZ /\ j e. ZZ ) ) /\ ( m < A /\ A < j ) ) -> m < A )
10	7, 8, 9	ltled 7905	. . . . . 6 |- ( ( ( ph /\ ( m e. ZZ /\ j e. ZZ ) ) /\ ( m < A /\ A < j ) ) -> m <_ A )
11		simprr 522	. . . . . . 7 |- ( ( ( ph /\ ( m e. ZZ /\ j e. ZZ ) ) /\ ( m < A /\ A < j ) ) -> A < j )
12	6	zcnd 9198	. . . . . . . 8 |- ( ( ( ph /\ ( m e. ZZ /\ j e. ZZ ) ) /\ ( m < A /\ A < j ) ) -> m e. CC )
13		simplrr 526	. . . . . . . . 9 |- ( ( ( ph /\ ( m e. ZZ /\ j e. ZZ ) ) /\ ( m < A /\ A < j ) ) -> j e. ZZ )
14	13	zcnd 9198	. . . . . . . 8 |- ( ( ( ph /\ ( m e. ZZ /\ j e. ZZ ) ) /\ ( m < A /\ A < j ) ) -> j e. CC )
15	12, 14	pncan3d 8100	. . . . . . 7 |- ( ( ( ph /\ ( m e. ZZ /\ j e. ZZ ) ) /\ ( m < A /\ A < j ) ) -> ( m + ( j - m ) ) = j )
16	11, 15	breqtrrd 3964	. . . . . 6 |- ( ( ( ph /\ ( m e. ZZ /\ j e. ZZ ) ) /\ ( m < A /\ A < j ) ) -> A < ( m + ( j - m ) ) )
17		breq1 3940	. . . . . . . 8 |- ( y = m -> ( y <_ A <-> m <_ A ) )
18		oveq1 5789	. . . . . . . . 9 |- ( y = m -> ( y + ( j - m ) ) = ( m + ( j - m ) ) )
19	18	breq2d 3949	. . . . . . . 8 |- ( y = m -> ( A < ( y + ( j - m ) ) <-> A < ( m + ( j - m ) ) ) )
20	17, 19	anbi12d 465	. . . . . . 7 |- ( y = m -> ( ( y <_ A /\ A < ( y + ( j - m ) ) ) <-> ( m <_ A /\ A < ( m + ( j - m ) ) ) ) )
21	20	rspcev 2793	. . . . . 6 |- ( ( m e. ZZ /\ ( m <_ A /\ A < ( m + ( j - m ) ) ) ) -> E. y e. ZZ ( y <_ A /\ A < ( y + ( j - m ) ) ) )
22	6, 10, 16, 21	syl12anc 1215	. . . . 5 |- ( ( ( ph /\ ( m e. ZZ /\ j e. ZZ ) ) /\ ( m < A /\ A < j ) ) -> E. y e. ZZ ( y <_ A /\ A < ( y + ( j - m ) ) ) )
23	13	zred 9197	. . . . . . . 8 |- ( ( ( ph /\ ( m e. ZZ /\ j e. ZZ ) ) /\ ( m < A /\ A < j ) ) -> j e. RR )
24	7, 8, 23, 9, 11	lttrd 7912	. . . . . . 7 |- ( ( ( ph /\ ( m e. ZZ /\ j e. ZZ ) ) /\ ( m < A /\ A < j ) ) -> m < j )
25		znnsub 9129	. . . . . . . 8 |- ( ( m e. ZZ /\ j e. ZZ ) -> ( m < j <-> ( j - m ) e. NN ) )
26	25	ad2antlr 481	. . . . . . 7 |- ( ( ( ph /\ ( m e. ZZ /\ j e. ZZ ) ) /\ ( m < A /\ A < j ) ) -> ( m < j <-> ( j - m ) e. NN ) )
27	24, 26	mpbid 146	. . . . . 6 |- ( ( ( ph /\ ( m e. ZZ /\ j e. ZZ ) ) /\ ( m < A /\ A < j ) ) -> ( j - m ) e. NN )
28		exbtwnzlemex.tri	. . . . . . . . . 10 |- ( ( ph /\ n e. ZZ ) -> ( n <_ A \/ A < n ) )
29	28	ralrimiva 2508	. . . . . . . . 9 |- ( ph -> A. n e. ZZ ( n <_ A \/ A < n ) )
30		breq1 3940	. . . . . . . . . . 11 |- ( n = a -> ( n <_ A <-> a <_ A ) )
31		breq2 3941	. . . . . . . . . . 11 |- ( n = a -> ( A < n <-> A < a ) )
32	30, 31	orbi12d 783	. . . . . . . . . 10 |- ( n = a -> ( ( n <_ A \/ A < n ) <-> ( a <_ A \/ A < a ) ) )
33	32	cbvralv 2657	. . . . . . . . 9 |- ( A. n e. ZZ ( n <_ A \/ A < n ) <-> A. a e. ZZ ( a <_ A \/ A < a ) )
34	29, 33	sylib 121	. . . . . . . 8 |- ( ph -> A. a e. ZZ ( a <_ A \/ A < a ) )
35	34	ad2antrr 480	. . . . . . 7 |- ( ( ( ph /\ ( m e. ZZ /\ j e. ZZ ) ) /\ ( m < A /\ A < j ) ) -> A. a e. ZZ ( a <_ A \/ A < a ) )
36	35	r19.21bi 2523	. . . . . 6 |- ( ( ( ( ph /\ ( m e. ZZ /\ j e. ZZ ) ) /\ ( m < A /\ A < j ) ) /\ a e. ZZ ) -> ( a <_ A \/ A < a ) )
37	27, 8, 36	exbtwnzlemshrink 10057	. . . . 5 |- ( ( ( ( ph /\ ( m e. ZZ /\ j e. ZZ ) ) /\ ( m < A /\ A < j ) ) /\ E. y e. ZZ ( y <_ A /\ A < ( y + ( j - m ) ) ) ) -> E. x e. ZZ ( x <_ A /\ A < ( x + 1 ) ) )
38	22, 37	mpdan 418	. . . 4 |- ( ( ( ph /\ ( m e. ZZ /\ j e. ZZ ) ) /\ ( m < A /\ A < j ) ) -> E. x e. ZZ ( x <_ A /\ A < ( x + 1 ) ) )
39	38	ex 114	. . 3 |- ( ( ph /\ ( m e. ZZ /\ j e. ZZ ) ) -> ( ( m < A /\ A < j ) -> E. x e. ZZ ( x <_ A /\ A < ( x + 1 ) ) ) )
40	39	rexlimdvva 2560	. 2 |- ( ph -> ( E. m e. ZZ E. j e. ZZ ( m < A /\ A < j ) -> E. x e. ZZ ( x <_ A /\ A < ( x + 1 ) ) ) )
41	5, 40	mpd 13	1 |- ( ph -> E. x e. ZZ ( x <_ A /\ A < ( x + 1 ) ) )

Syntax hints:   -> wi 4   /\ wa 103   <-> wb 104   \/ wo 698   e. wcel 1481   A.wral 2417   E.wrex 2418   class class class wbr 3937  (class class class)co 5782   RRcr 7643   1c1 7645   + caddc 7647   < clt 7824   <_ cle 7825   - cmin 7957   NNcn 8744   ZZcz 9078

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-pow 4106  ax-pr 4139  ax-un 4363  ax-setind 4460  ax-cnex 7735  ax-resscn 7736  ax-1cn 7737  ax-1re 7738  ax-icn 7739  ax-addcl 7740  ax-addrcl 7741  ax-mulcl 7742  ax-addcom 7744  ax-addass 7746  ax-distr 7748  ax-i2m1 7749  ax-0lt1 7750  ax-0id 7752  ax-rnegex 7753  ax-cnre 7755  ax-pre-ltirr 7756  ax-pre-ltwlin 7757  ax-pre-lttrn 7758  ax-pre-ltadd 7760  ax-arch 7763

This theorem depends on definitions:  df-bi 116  df-3or 964  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ne 2310  df-nel 2405  df-ral 2422  df-rex 2423  df-reu 2424  df-rab 2426  df-v 2691  df-sbc 2914  df-dif 3078  df-un 3080  df-in 3082  df-ss 3089  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-int 3780  df-br 3938  df-opab 3998  df-id 4223  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-iota 5096  df-fun 5133  df-fv 5139  df-riota 5738  df-ov 5785  df-oprab 5786  df-mpo 5787  df-pnf 7826  df-mnf 7827  df-xr 7828  df-ltxr 7829  df-le 7830  df-sub 7959  df-neg 7960  df-inn 8745  df-n0 9002  df-z 9079

This theorem is referenced by:  qbtwnz  10060  apbtwnz  10078