Theorem dedekindicclemuub 15340

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

Hypotheses

Ref	Expression
dedekindicc.a	|- ( ph -> A e. RR )
dedekindicc.b	|- ( ph -> B e. RR )
dedekindicc.lss	|- ( ph -> L C_ ( A [,] B ) )
dedekindicc.uss	|- ( ph -> U C_ ( A [,] B ) )
dedekindicc.lm	|- ( ph -> E. q e. ( A [,] B ) q e. L )
dedekindicc.um	|- ( ph -> E. r e. ( A [,] B ) r e. U )
dedekindicc.lr	|- ( ph -> A. q e. ( A [,] B ) ( q e. L <-> E. r e. L q < r ) )
dedekindicc.ur	|- ( ph -> A. r e. ( A [,] B ) ( r e. U <-> E. q e. U q < r ) )
dedekindicc.disj	|- ( ph -> ( L i^i U ) = (/) )
dedekindicc.loc	|- ( ph -> A. q e. ( A [,] B ) A. r e. ( A [,] B ) ( q < r -> ( q e. L \/ r e. U ) ) )
dedekindicclemuub.u	|- ( ph -> C e. U )

Assertion

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

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

Allowed substitution hints:   ph( r)   A( z, q)   B( z, q)   L( r)

Proof of Theorem dedekindicclemuub

Dummy variable a is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dedekindicclemuub.u	. . 3 |- ( ph -> C e. U )
2		eleq1 2292	. . . . 5 |- ( r = C -> ( r e. U <-> C e. U ) )
3		breq2 4090	. . . . . 6 |- ( r = C -> ( q < r <-> q < C ) )
4	3	rexbidv 2531	. . . . 5 |- ( r = C -> ( E. q e. U q < r <-> E. q e. U q < C ) )
5	2, 4	bibi12d 235	. . . 4 |- ( r = C -> ( ( r e. U <-> E. q e. U q < r ) <-> ( C e. U <-> E. q e. U q < C ) ) )
6		dedekindicc.ur	. . . 4 |- ( ph -> A. r e. ( A [,] B ) ( r e. U <-> E. q e. U q < r ) )
7		dedekindicc.uss	. . . . 5 |- ( ph -> U C_ ( A [,] B ) )
8	7, 1	sseldd 3226	. . . 4 |- ( ph -> C e. ( A [,] B ) )
9	5, 6, 8	rspcdva 2913	. . 3 |- ( ph -> ( C e. U <-> E. q e. U q < C ) )
10	1, 9	mpbid 147	. 2 |- ( ph -> E. q e. U q < C )
11		dedekindicc.a	. . . . . . 7 |- ( ph -> A e. RR )
12		dedekindicc.b	. . . . . . 7 |- ( ph -> B e. RR )
13		iccssre 10180	. . . . . . 7 |- ( ( A e. RR /\ B e. RR ) -> ( A [,] B ) C_ RR )
14	11, 12, 13	syl2anc 411	. . . . . 6 |- ( ph -> ( A [,] B ) C_ RR )
15	14	ad2antrr 488	. . . . 5 |- ( ( ( ph /\ ( q e. U /\ q < C ) ) /\ z e. L ) -> ( A [,] B ) C_ RR )
16		dedekindicc.lss	. . . . . . 7 |- ( ph -> L C_ ( A [,] B ) )
17	16	ad2antrr 488	. . . . . 6 |- ( ( ( ph /\ ( q e. U /\ q < C ) ) /\ z e. L ) -> L C_ ( A [,] B ) )
18		simpr 110	. . . . . 6 |- ( ( ( ph /\ ( q e. U /\ q < C ) ) /\ z e. L ) -> z e. L )
19	17, 18	sseldd 3226	. . . . 5 |- ( ( ( ph /\ ( q e. U /\ q < C ) ) /\ z e. L ) -> z e. ( A [,] B ) )
20	15, 19	sseldd 3226	. . . 4 |- ( ( ( ph /\ ( q e. U /\ q < C ) ) /\ z e. L ) -> z e. RR )
21	7	ad2antrr 488	. . . . . 6 |- ( ( ( ph /\ ( q e. U /\ q < C ) ) /\ z e. L ) -> U C_ ( A [,] B ) )
22		simplrl 535	. . . . . 6 |- ( ( ( ph /\ ( q e. U /\ q < C ) ) /\ z e. L ) -> q e. U )
23	21, 22	sseldd 3226	. . . . 5 |- ( ( ( ph /\ ( q e. U /\ q < C ) ) /\ z e. L ) -> q e. ( A [,] B ) )
24	15, 23	sseldd 3226	. . . 4 |- ( ( ( ph /\ ( q e. U /\ q < C ) ) /\ z e. L ) -> q e. RR )
25	14, 8	sseldd 3226	. . . . 5 |- ( ph -> C e. RR )
26	25	ad2antrr 488	. . . 4 |- ( ( ( ph /\ ( q e. U /\ q < C ) ) /\ z e. L ) -> C e. RR )
27		breq1 4089	. . . . . . . . . 10 |- ( a = q -> ( a < z <-> q < z ) )
28	27	rspcev 2908	. . . . . . . . 9 |- ( ( q e. U /\ q < z ) -> E. a e. U a < z )
29	22, 28	sylan 283	. . . . . . . 8 |- ( ( ( ( ph /\ ( q e. U /\ q < C ) ) /\ z e. L ) /\ q < z ) -> E. a e. U a < z )
30	27	cbvrexv 2766	. . . . . . . 8 |- ( E. a e. U a < z <-> E. q e. U q < z )
31	29, 30	sylib 122	. . . . . . 7 |- ( ( ( ( ph /\ ( q e. U /\ q < C ) ) /\ z e. L ) /\ q < z ) -> E. q e. U q < z )
32		eleq1 2292	. . . . . . . . 9 |- ( r = z -> ( r e. U <-> z e. U ) )
33		breq2 4090	. . . . . . . . . 10 |- ( r = z -> ( q < r <-> q < z ) )
34	33	rexbidv 2531	. . . . . . . . 9 |- ( r = z -> ( E. q e. U q < r <-> E. q e. U q < z ) )
35	32, 34	bibi12d 235	. . . . . . . 8 |- ( r = z -> ( ( r e. U <-> E. q e. U q < r ) <-> ( z e. U <-> E. q e. U q < z ) ) )
36	6	ad3antrrr 492	. . . . . . . 8 |- ( ( ( ( ph /\ ( q e. U /\ q < C ) ) /\ z e. L ) /\ q < z ) -> A. r e. ( A [,] B ) ( r e. U <-> E. q e. U q < r ) )
37	19	adantr 276	. . . . . . . 8 |- ( ( ( ( ph /\ ( q e. U /\ q < C ) ) /\ z e. L ) /\ q < z ) -> z e. ( A [,] B ) )
38	35, 36, 37	rspcdva 2913	. . . . . . 7 |- ( ( ( ( ph /\ ( q e. U /\ q < C ) ) /\ z e. L ) /\ q < z ) -> ( z e. U <-> E. q e. U q < z ) )
39	31, 38	mpbird 167	. . . . . 6 |- ( ( ( ( ph /\ ( q e. U /\ q < C ) ) /\ z e. L ) /\ q < z ) -> z e. U )
40		simplll 533	. . . . . . 7 |- ( ( ( ( ph /\ ( q e. U /\ q < C ) ) /\ z e. L ) /\ q < z ) -> ph )
41	18	adantr 276	. . . . . . 7 |- ( ( ( ( ph /\ ( q e. U /\ q < C ) ) /\ z e. L ) /\ q < z ) -> z e. L )
42		dedekindicc.disj	. . . . . . . . 9 |- ( ph -> ( L i^i U ) = (/) )
43		disj 3541	. . . . . . . . 9 |- ( ( L i^i U ) = (/) <-> A. z e. L -. z e. U )
44	42, 43	sylib 122	. . . . . . . 8 |- ( ph -> A. z e. L -. z e. U )
45	44	r19.21bi 2618	. . . . . . 7 |- ( ( ph /\ z e. L ) -> -. z e. U )
46	40, 41, 45	syl2anc 411	. . . . . 6 |- ( ( ( ( ph /\ ( q e. U /\ q < C ) ) /\ z e. L ) /\ q < z ) -> -. z e. U )
47	39, 46	pm2.65da 665	. . . . 5 |- ( ( ( ph /\ ( q e. U /\ q < C ) ) /\ z e. L ) -> -. q < z )
48	20, 24, 47	nltled 8290	. . . 4 |- ( ( ( ph /\ ( q e. U /\ q < C ) ) /\ z e. L ) -> z <_ q )
49		simplrr 536	. . . 4 |- ( ( ( ph /\ ( q e. U /\ q < C ) ) /\ z e. L ) -> q < C )
50	20, 24, 26, 48, 49	lelttrd 8294	. . 3 |- ( ( ( ph /\ ( q e. U /\ q < C ) ) /\ z e. L ) -> z < C )
51	50	ralrimiva 2603	. 2 |- ( ( ph /\ ( q e. U /\ q < C ) ) -> A. z e. L z < C )
52	10, 51	rexlimddv 2653	1 |- ( ph -> A. z e. L z < C )

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 3197   C_ wss 3198   (/)c0 3492   class class class wbr 4086  (class class class)co 6013   RRcr 8021   < clt 8204   [,]cicc 10116

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 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8113  ax-resscn 8114  ax-pre-ltirr 8134  ax-pre-ltwlin 8135  ax-pre-lttrn 8136

This theorem depends on definitions:  df-bi 117  df-3or 1003  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 2802  df-sbc 3030  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-br 4087  df-opab 4149  df-id 4388  df-po 4391  df-iso 4392  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-iota 5284  df-fun 5326  df-fv 5332  df-ov 6016  df-oprab 6017  df-mpo 6018  df-pnf 8206  df-mnf 8207  df-xr 8208  df-ltxr 8209  df-le 8210  df-icc 10120

This theorem is referenced by:  dedekindicclemub  15341  dedekindicclemloc  15342