Theorem apbtwnz 10417

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 736	. . . 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 9495	. . . . . . 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 8191	. . . . 5 |- ( ( ( ( A e. RR /\ A. n e. ZZ A # n ) /\ m e. ZZ ) /\ m < A ) -> m <_ A )
11	10	orcd 735	. . . 4 |- ( ( ( ( A e. RR /\ A. n e. ZZ A # n ) /\ m e. ZZ ) /\ m < A ) -> ( m <_ A \/ A < m ) )
12		breq2 4048	. . . . . 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 2882	. . . . 5 |- ( ( ( A e. RR /\ A. n e. ZZ A # n ) /\ m e. ZZ ) -> A # m )
15		reaplt 8661	. . . . . 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 800	. . 3 |- ( ( ( A e. RR /\ A. n e. ZZ A # n ) /\ m e. ZZ ) -> ( m <_ A \/ A < m ) )
19	1, 18	exbtwnzlemex 10392	. 2 |- ( ( A e. RR /\ A. n e. ZZ A # n ) -> E. x e. ZZ ( x <_ A /\ A < ( x + 1 ) ) )
20	19, 1	exbtwnz 10393	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 710   e. wcel 2176   A.wral 2484   E!wreu 2486   class class class wbr 4044  (class class class)co 5944   RRcr 7924   1c1 7926   + caddc 7928   < clt 8107   <_ cle 8108   # cap 8654   ZZcz 9372

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 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-sep 4162  ax-pow 4218  ax-pr 4253  ax-un 4480  ax-setind 4585  ax-cnex 8016  ax-resscn 8017  ax-1cn 8018  ax-1re 8019  ax-icn 8020  ax-addcl 8021  ax-addrcl 8022  ax-mulcl 8023  ax-mulrcl 8024  ax-addcom 8025  ax-mulcom 8026  ax-addass 8027  ax-mulass 8028  ax-distr 8029  ax-i2m1 8030  ax-0lt1 8031  ax-1rid 8032  ax-0id 8033  ax-rnegex 8034  ax-precex 8035  ax-cnre 8036  ax-pre-ltirr 8037  ax-pre-ltwlin 8038  ax-pre-lttrn 8039  ax-pre-apti 8040  ax-pre-ltadd 8041  ax-pre-mulgt0 8042  ax-arch 8044

This theorem depends on definitions:  df-bi 117  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ne 2377  df-nel 2472  df-ral 2489  df-rex 2490  df-reu 2491  df-rmo 2492  df-rab 2493  df-v 2774  df-sbc 2999  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-int 3886  df-br 4045  df-opab 4106  df-id 4340  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-iota 5232  df-fun 5273  df-fv 5279  df-riota 5899  df-ov 5947  df-oprab 5948  df-mpo 5949  df-pnf 8109  df-mnf 8110  df-xr 8111  df-ltxr 8112  df-le 8113  df-sub 8245  df-neg 8246  df-reap 8648  df-ap 8655  df-inn 9037  df-n0 9296  df-z 9373

This theorem is referenced by:  flapcl  10418