Theorem apbtwnz 10364

Description: There is a unique greatest integer less than or equal to a real number which is apart from all integers. (Contributed by Jim Kingdon, 11-May-2022.)

Assertion

Ref	Expression
apbtwnz	|- ( ( A e. RR /\ A. n e. ZZ A # n ) -> E! x e. ZZ ( x <_ A /\ A < ( x + 1 ) ) )

Distinct variable group:   A, n, x

Proof of Theorem apbtwnz

Dummy variable m is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl 109	. . 3 |- ( ( A e. RR /\ A. n e. ZZ A # n ) -> A e. RR )
2		simpr 110	. . . . 5 |- ( ( ( ( A e. RR /\ A. n e. ZZ A # n ) /\ m e. ZZ ) /\ A < m ) -> A < m )
3	2	olcd 735	. . . 4 |- ( ( ( ( A e. RR /\ A. n e. ZZ A # n ) /\ m e. ZZ ) /\ A < m ) -> ( m <_ A \/ A < m ) )
4		simpr 110	. . . . . . . 8 |- ( ( ( A e. RR /\ A. n e. ZZ A # n ) /\ m e. ZZ ) -> m e. ZZ )
5	4	zred 9448	. . . . . . 7 |- ( ( ( A e. RR /\ A. n e. ZZ A # n ) /\ m e. ZZ ) -> m e. RR )
6	5	adantr 276	. . . . . 6 |- ( ( ( ( A e. RR /\ A. n e. ZZ A # n ) /\ m e. ZZ ) /\ m < A ) -> m e. RR )
7	1	adantr 276	. . . . . . 7 |- ( ( ( A e. RR /\ A. n e. ZZ A # n ) /\ m e. ZZ ) -> A e. RR )
8	7	adantr 276	. . . . . 6 |- ( ( ( ( A e. RR /\ A. n e. ZZ A # n ) /\ m e. ZZ ) /\ m < A ) -> A e. RR )
9		simpr 110	. . . . . 6 |- ( ( ( ( A e. RR /\ A. n e. ZZ A # n ) /\ m e. ZZ ) /\ m < A ) -> m < A )
10	6, 8, 9	ltled 8145	. . . . 5 |- ( ( ( ( A e. RR /\ A. n e. ZZ A # n ) /\ m e. ZZ ) /\ m < A ) -> m <_ A )
11	10	orcd 734	. . . 4 |- ( ( ( ( A e. RR /\ A. n e. ZZ A # n ) /\ m e. ZZ ) /\ m < A ) -> ( m <_ A \/ A < m ) )
12		breq2 4037	. . . . . 6 |- ( n = m -> ( A # n <-> A # m ) )
13		simplr 528	. . . . . 6 |- ( ( ( A e. RR /\ A. n e. ZZ A # n ) /\ m e. ZZ ) -> A. n e. ZZ A # n )
14	12, 13, 4	rspcdva 2873	. . . . 5 |- ( ( ( A e. RR /\ A. n e. ZZ A # n ) /\ m e. ZZ ) -> A # m )
15		reaplt 8615	. . . . . 6 |- ( ( A e. RR /\ m e. RR ) -> ( A # m <-> ( A < m \/ m < A ) ) )
16	7, 5, 15	syl2anc 411	. . . . 5 |- ( ( ( A e. RR /\ A. n e. ZZ A # n ) /\ m e. ZZ ) -> ( A # m <-> ( A < m \/ m < A ) ) )
17	14, 16	mpbid 147	. . . 4 |- ( ( ( A e. RR /\ A. n e. ZZ A # n ) /\ m e. ZZ ) -> ( A < m \/ m < A ) )
18	3, 11, 17	mpjaodan 799	. . 3 |- ( ( ( A e. RR /\ A. n e. ZZ A # n ) /\ m e. ZZ ) -> ( m <_ A \/ A < m ) )
19	1, 18	exbtwnzlemex 10339	. 2 |- ( ( A e. RR /\ A. n e. ZZ A # n ) -> E. x e. ZZ ( x <_ A /\ A < ( x + 1 ) ) )
20	19, 1	exbtwnz 10340	1 |- ( ( A e. RR /\ A. n e. ZZ A # n ) -> E! x e. ZZ ( x <_ A /\ A < ( x + 1 ) ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 709   e. wcel 2167   A.wral 2475   E!wreu 2477   class class class wbr 4033  (class class class)co 5922   RRcr 7878   1c1 7880   + caddc 7882   < clt 8061   <_ cle 8062   # cap 8608   ZZcz 9326

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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573  ax-cnex 7970  ax-resscn 7971  ax-1cn 7972  ax-1re 7973  ax-icn 7974  ax-addcl 7975  ax-addrcl 7976  ax-mulcl 7977  ax-mulrcl 7978  ax-addcom 7979  ax-mulcom 7980  ax-addass 7981  ax-mulass 7982  ax-distr 7983  ax-i2m1 7984  ax-0lt1 7985  ax-1rid 7986  ax-0id 7987  ax-rnegex 7988  ax-precex 7989  ax-cnre 7990  ax-pre-ltirr 7991  ax-pre-ltwlin 7992  ax-pre-lttrn 7993  ax-pre-apti 7994  ax-pre-ltadd 7995  ax-pre-mulgt0 7996  ax-arch 7998

This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-int 3875  df-br 4034  df-opab 4095  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-iota 5219  df-fun 5260  df-fv 5266  df-riota 5877  df-ov 5925  df-oprab 5926  df-mpo 5927  df-pnf 8063  df-mnf 8064  df-xr 8065  df-ltxr 8066  df-le 8067  df-sub 8199  df-neg 8200  df-reap 8602  df-ap 8609  df-inn 8991  df-n0 9250  df-z 9327

This theorem is referenced by:  flapcl  10365