Theorem dedekindicclemeu 15305

Description: Lemma for dedekindicc 15307. Part of proving uniqueness. (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 ) ) )
dedekindicc.ab	|- ( ph -> A < B )
dedekindicclemeu.are	|- ( ph -> C e. ( A [,] B ) )
dedekindicclemeu.ac	|- ( ph -> ( A. q e. L q < C /\ A. r e. U C < r ) )
dedekindicclemeu.bre	|- ( ph -> D e. ( A [,] B ) )
dedekindicclemeu.bc	|- ( ph -> ( A. q e. L q < D /\ A. r e. U D < r ) )
dedekindicclemeu.lt	|- ( ph -> C < D )

Assertion

Ref	Expression
dedekindicclemeu	|- ( ph -> F. )

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

Allowed substitution hints:   ph( r, q)   D( q)

Proof of Theorem dedekindicclemeu

Step	Hyp	Ref	Expression
1		breq1 4086	. . . 4 |- ( q = C -> ( q < C <-> C < C ) )
2		dedekindicclemeu.ac	. . . . . 6 |- ( ph -> ( A. q e. L q < C /\ A. r e. U C < r ) )
3	2	simpld 112	. . . . 5 |- ( ph -> A. q e. L q < C )
4	3	adantr 276	. . . 4 |- ( ( ph /\ C e. L ) -> A. q e. L q < C )
5		simpr 110	. . . 4 |- ( ( ph /\ C e. L ) -> C e. L )
6	1, 4, 5	rspcdva 2912	. . 3 |- ( ( ph /\ C e. L ) -> C < C )
7		dedekindicc.a	. . . . . . 7 |- ( ph -> A e. RR )
8		dedekindicc.b	. . . . . . 7 |- ( ph -> B e. RR )
9		iccssre 10151	. . . . . . 7 |- ( ( A e. RR /\ B e. RR ) -> ( A [,] B ) C_ RR )
10	7, 8, 9	syl2anc 411	. . . . . 6 |- ( ph -> ( A [,] B ) C_ RR )
11		dedekindicclemeu.are	. . . . . 6 |- ( ph -> C e. ( A [,] B ) )
12	10, 11	sseldd 3225	. . . . 5 |- ( ph -> C e. RR )
13	12	ltnrd 8258	. . . 4 |- ( ph -> -. C < C )
14	13	adantr 276	. . 3 |- ( ( ph /\ C e. L ) -> -. C < C )
15	6, 14	pm2.21fal 1415	. 2 |- ( ( ph /\ C e. L ) -> F. )
16		breq2 4087	. . . 4 |- ( r = D -> ( D < r <-> D < D ) )
17		dedekindicclemeu.bc	. . . . . 6 |- ( ph -> ( A. q e. L q < D /\ A. r e. U D < r ) )
18	17	simprd 114	. . . . 5 |- ( ph -> A. r e. U D < r )
19	18	adantr 276	. . . 4 |- ( ( ph /\ D e. U ) -> A. r e. U D < r )
20		simpr 110	. . . 4 |- ( ( ph /\ D e. U ) -> D e. U )
21	16, 19, 20	rspcdva 2912	. . 3 |- ( ( ph /\ D e. U ) -> D < D )
22		dedekindicclemeu.bre	. . . . . 6 |- ( ph -> D e. ( A [,] B ) )
23	10, 22	sseldd 3225	. . . . 5 |- ( ph -> D e. RR )
24	23	ltnrd 8258	. . . 4 |- ( ph -> -. D < D )
25	24	adantr 276	. . 3 |- ( ( ph /\ D e. U ) -> -. D < D )
26	21, 25	pm2.21fal 1415	. 2 |- ( ( ph /\ D e. U ) -> F. )
27		dedekindicclemeu.lt	. . 3 |- ( ph -> C < D )
28		breq2 4087	. . . . 5 |- ( r = D -> ( C < r <-> C < D ) )
29		eleq1 2292	. . . . . 6 |- ( r = D -> ( r e. U <-> D e. U ) )
30	29	orbi2d 795	. . . . 5 |- ( r = D -> ( ( C e. L \/ r e. U ) <-> ( C e. L \/ D e. U ) ) )
31	28, 30	imbi12d 234	. . . 4 |- ( r = D -> ( ( C < r -> ( C e. L \/ r e. U ) ) <-> ( C < D -> ( C e. L \/ D e. U ) ) ) )
32		breq1 4086	. . . . . . 7 |- ( q = C -> ( q < r <-> C < r ) )
33		eleq1 2292	. . . . . . . 8 |- ( q = C -> ( q e. L <-> C e. L ) )
34	33	orbi1d 796	. . . . . . 7 |- ( q = C -> ( ( q e. L \/ r e. U ) <-> ( C e. L \/ r e. U ) ) )
35	32, 34	imbi12d 234	. . . . . 6 |- ( q = C -> ( ( q < r -> ( q e. L \/ r e. U ) ) <-> ( C < r -> ( C e. L \/ r e. U ) ) ) )
36	35	ralbidv 2530	. . . . 5 |- ( q = C -> ( A. r e. ( A [,] B ) ( q < r -> ( q e. L \/ r e. U ) ) <-> A. r e. ( A [,] B ) ( C < r -> ( C e. L \/ r e. U ) ) ) )
37		dedekindicc.loc	. . . . 5 |- ( ph -> A. q e. ( A [,] B ) A. r e. ( A [,] B ) ( q < r -> ( q e. L \/ r e. U ) ) )
38	36, 37, 11	rspcdva 2912	. . . 4 |- ( ph -> A. r e. ( A [,] B ) ( C < r -> ( C e. L \/ r e. U ) ) )
39	31, 38, 22	rspcdva 2912	. . 3 |- ( ph -> ( C < D -> ( C e. L \/ D e. U ) ) )
40	27, 39	mpd 13	. 2 |- ( ph -> ( C e. L \/ D e. U ) )
41	15, 26, 40	mpjaodan 803	1 |- ( ph -> F. )

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

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-ltirr 8111  ax-pre-ltwlin 8112  ax-pre-lttrn 8113

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 2801  df-sbc 3029  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-opab 4146  df-id 4384  df-po 4387  df-iso 4388  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-iota 5278  df-fun 5320  df-fv 5326  df-ov 6004  df-oprab 6005  df-mpo 6006  df-pnf 8183  df-mnf 8184  df-xr 8185  df-ltxr 8186  df-le 8187  df-icc 10091

This theorem is referenced by:  dedekindicclemicc  15306