Theorem dedekindeulemuub 15291

Description: Lemma for dedekindeu 15297. Any element of the upper cut is an upper bound for the lower cut. (Contributed by Jim Kingdon, 2-Feb-2024.)

Hypotheses

Ref	Expression
dedekindeu.lss	|- ( ph -> L C_ RR )
dedekindeu.uss	|- ( ph -> U C_ RR )
dedekindeu.lm	|- ( ph -> E. q e. RR q e. L )
dedekindeu.um	|- ( ph -> E. r e. RR r e. U )
dedekindeu.lr	|- ( ph -> A. q e. RR ( q e. L <-> E. r e. L q < r ) )
dedekindeu.ur	|- ( ph -> A. r e. RR ( r e. U <-> E. q e. U q < r ) )
dedekindeu.disj	|- ( ph -> ( L i^i U ) = (/) )
dedekindeu.loc	|- ( ph -> A. q e. RR A. r e. RR ( q < r -> ( q e. L \/ r e. U ) ) )
dedekindeulemuub.u	|- ( ph -> A e. U )

Assertion

Ref	Expression
dedekindeulemuub	|- ( ph -> A. z e. L z < A )

Distinct variable groups:   A, q, r, z   L, q, z   U, q, z, r   ph, q, z

Allowed substitution hints:   ph( r)   L( r)

Proof of Theorem dedekindeulemuub

Dummy variable a is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dedekindeulemuub.u	. . 3 |- ( ph -> A e. U )
2		eleq1 2292	. . . . 5 |- ( r = A -> ( r e. U <-> A e. U ) )
3		breq2 4087	. . . . . 6 |- ( r = A -> ( q < r <-> q < A ) )
4	3	rexbidv 2531	. . . . 5 |- ( r = A -> ( E. q e. U q < r <-> E. q e. U q < A ) )
5	2, 4	bibi12d 235	. . . 4 |- ( r = A -> ( ( r e. U <-> E. q e. U q < r ) <-> ( A e. U <-> E. q e. U q < A ) ) )
6		dedekindeu.ur	. . . 4 |- ( ph -> A. r e. RR ( r e. U <-> E. q e. U q < r ) )
7		dedekindeu.uss	. . . . 5 |- ( ph -> U C_ RR )
8	7, 1	sseldd 3225	. . . 4 |- ( ph -> A e. RR )
9	5, 6, 8	rspcdva 2912	. . 3 |- ( ph -> ( A e. U <-> E. q e. U q < A ) )
10	1, 9	mpbid 147	. 2 |- ( ph -> E. q e. U q < A )
11		dedekindeu.lss	. . . . . 6 |- ( ph -> L C_ RR )
12	11	ad2antrr 488	. . . . 5 |- ( ( ( ph /\ ( q e. U /\ q < A ) ) /\ z e. L ) -> L C_ RR )
13		simpr 110	. . . . 5 |- ( ( ( ph /\ ( q e. U /\ q < A ) ) /\ z e. L ) -> z e. L )
14	12, 13	sseldd 3225	. . . 4 |- ( ( ( ph /\ ( q e. U /\ q < A ) ) /\ z e. L ) -> z e. RR )
15	7	ad2antrr 488	. . . . 5 |- ( ( ( ph /\ ( q e. U /\ q < A ) ) /\ z e. L ) -> U C_ RR )
16		simplrl 535	. . . . 5 |- ( ( ( ph /\ ( q e. U /\ q < A ) ) /\ z e. L ) -> q e. U )
17	15, 16	sseldd 3225	. . . 4 |- ( ( ( ph /\ ( q e. U /\ q < A ) ) /\ z e. L ) -> q e. RR )
18	8	ad2antrr 488	. . . 4 |- ( ( ( ph /\ ( q e. U /\ q < A ) ) /\ z e. L ) -> A e. RR )
19		breq1 4086	. . . . . . . . . 10 |- ( a = q -> ( a < z <-> q < z ) )
20	19	rspcev 2907	. . . . . . . . 9 |- ( ( q e. U /\ q < z ) -> E. a e. U a < z )
21	16, 20	sylan 283	. . . . . . . 8 |- ( ( ( ( ph /\ ( q e. U /\ q < A ) ) /\ z e. L ) /\ q < z ) -> E. a e. U a < z )
22	19	cbvrexv 2766	. . . . . . . 8 |- ( E. a e. U a < z <-> E. q e. U q < z )
23	21, 22	sylib 122	. . . . . . 7 |- ( ( ( ( ph /\ ( q e. U /\ q < A ) ) /\ z e. L ) /\ q < z ) -> E. q e. U q < z )
24		eleq1 2292	. . . . . . . . 9 |- ( r = z -> ( r e. U <-> z e. U ) )
25		breq2 4087	. . . . . . . . . 10 |- ( r = z -> ( q < r <-> q < z ) )
26	25	rexbidv 2531	. . . . . . . . 9 |- ( r = z -> ( E. q e. U q < r <-> E. q e. U q < z ) )
27	24, 26	bibi12d 235	. . . . . . . 8 |- ( r = z -> ( ( r e. U <-> E. q e. U q < r ) <-> ( z e. U <-> E. q e. U q < z ) ) )
28	6	ad3antrrr 492	. . . . . . . 8 |- ( ( ( ( ph /\ ( q e. U /\ q < A ) ) /\ z e. L ) /\ q < z ) -> A. r e. RR ( r e. U <-> E. q e. U q < r ) )
29	14	adantr 276	. . . . . . . 8 |- ( ( ( ( ph /\ ( q e. U /\ q < A ) ) /\ z e. L ) /\ q < z ) -> z e. RR )
30	27, 28, 29	rspcdva 2912	. . . . . . 7 |- ( ( ( ( ph /\ ( q e. U /\ q < A ) ) /\ z e. L ) /\ q < z ) -> ( z e. U <-> E. q e. U q < z ) )
31	23, 30	mpbird 167	. . . . . 6 |- ( ( ( ( ph /\ ( q e. U /\ q < A ) ) /\ z e. L ) /\ q < z ) -> z e. U )
32		simplll 533	. . . . . . 7 |- ( ( ( ( ph /\ ( q e. U /\ q < A ) ) /\ z e. L ) /\ q < z ) -> ph )
33	13	adantr 276	. . . . . . 7 |- ( ( ( ( ph /\ ( q e. U /\ q < A ) ) /\ z e. L ) /\ q < z ) -> z e. L )
34		dedekindeu.disj	. . . . . . . . 9 |- ( ph -> ( L i^i U ) = (/) )
35		disj 3540	. . . . . . . . 9 |- ( ( L i^i U ) = (/) <-> A. z e. L -. z e. U )
36	34, 35	sylib 122	. . . . . . . 8 |- ( ph -> A. z e. L -. z e. U )
37	36	r19.21bi 2618	. . . . . . 7 |- ( ( ph /\ z e. L ) -> -. z e. U )
38	32, 33, 37	syl2anc 411	. . . . . 6 |- ( ( ( ( ph /\ ( q e. U /\ q < A ) ) /\ z e. L ) /\ q < z ) -> -. z e. U )
39	31, 38	pm2.65da 665	. . . . 5 |- ( ( ( ph /\ ( q e. U /\ q < A ) ) /\ z e. L ) -> -. q < z )
40	14, 17, 39	nltled 8267	. . . 4 |- ( ( ( ph /\ ( q e. U /\ q < A ) ) /\ z e. L ) -> z <_ q )
41		simplrr 536	. . . 4 |- ( ( ( ph /\ ( q e. U /\ q < A ) ) /\ z e. L ) -> q < A )
42	14, 17, 18, 40, 41	lelttrd 8271	. . 3 |- ( ( ( ph /\ ( q e. U /\ q < A ) ) /\ z e. L ) -> z < A )
43	42	ralrimiva 2603	. 2 |- ( ( ph /\ ( q e. U /\ q < A ) ) -> A. z e. L z < A )
44	10, 43	rexlimddv 2653	1 |- ( ph -> A. z e. L z < A )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 713   = wceq 1395   e. wcel 2200   A.wral 2508   E.wrex 2509   i^i cin 3196   C_ wss 3197   (/)c0 3491   class class class wbr 4083   RRcr 7998   < clt 8181

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8090  ax-resscn 8091  ax-pre-ltwlin 8112

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2801  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-opab 4146  df-xp 4725  df-cnv 4727  df-pnf 8183  df-mnf 8184  df-xr 8185  df-ltxr 8186  df-le 8187

This theorem is referenced by:  dedekindeulemub  15292  dedekindeulemloc  15293