Theorem dedekindicclemeu 13678

Description: Lemma for dedekindicc 13680. 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 4001	. . . 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 2844	. . 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 9924	. . . . . . 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 3154	. . . . 5 |- ( ph -> C e. RR )
13	12	ltnrd 8043	. . . 4 |- ( ph -> -. C < C )
14	13	adantr 276	. . 3 |- ( ( ph /\ C e. L ) -> -. C < C )
15	6, 14	pm2.21fal 1373	. 2 |- ( ( ph /\ C e. L ) -> F. )
16		breq2 4002	. . . 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 2844	. . 3 |- ( ( ph /\ D e. U ) -> D < D )
22		dedekindicclemeu.bre	. . . . . 6 |- ( ph -> D e. ( A [,] B ) )
23	10, 22	sseldd 3154	. . . . 5 |- ( ph -> D e. RR )
24	23	ltnrd 8043	. . . 4 |- ( ph -> -. D < D )
25	24	adantr 276	. . 3 |- ( ( ph /\ D e. U ) -> -. D < D )
26	21, 25	pm2.21fal 1373	. 2 |- ( ( ph /\ D e. U ) -> F. )
27		dedekindicclemeu.lt	. . 3 |- ( ph -> C < D )
28		breq2 4002	. . . . 5 |- ( r = D -> ( C < r <-> C < D ) )
29		eleq1 2238	. . . . . 6 |- ( r = D -> ( r e. U <-> D e. U ) )
30	29	orbi2d 790	. . . . 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 4001	. . . . . . 7 |- ( q = C -> ( q < r <-> C < r ) )
33		eleq1 2238	. . . . . . . 8 |- ( q = C -> ( q e. L <-> C e. L ) )
34	33	orbi1d 791	. . . . . . 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 2475	. . . . 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 2844	. . . 4 |- ( ph -> A. r e. ( A [,] B ) ( C < r -> ( C e. L \/ r e. U ) ) )
39	31, 38, 22	rspcdva 2844	. . 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 798	1 |- ( ph -> F. )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 708   = wceq 1353   F. wfal 1358   e. wcel 2146   A.wral 2453   E.wrex 2454   i^i cin 3126   C_ wss 3127   (/)c0 3420   class class class wbr 3998  (class class class)co 5865   RRcr 7785   < clt 7966   [,]cicc 9860

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 614  ax-in2 615  ax-io 709  ax-5 1445  ax-7 1446  ax-gen 1447  ax-ie1 1491  ax-ie2 1492  ax-8 1502  ax-10 1503  ax-11 1504  ax-i12 1505  ax-bndl 1507  ax-4 1508  ax-17 1524  ax-i9 1528  ax-ial 1532  ax-i5r 1533  ax-13 2148  ax-14 2149  ax-ext 2157  ax-sep 4116  ax-pow 4169  ax-pr 4203  ax-un 4427  ax-setind 4530  ax-cnex 7877  ax-resscn 7878  ax-pre-ltirr 7898  ax-pre-ltwlin 7899  ax-pre-lttrn 7900

This theorem depends on definitions:  df-bi 117  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1459  df-sb 1761  df-eu 2027  df-mo 2028  df-clab 2162  df-cleq 2168  df-clel 2171  df-nfc 2306  df-ne 2346  df-nel 2441  df-ral 2458  df-rex 2459  df-rab 2462  df-v 2737  df-sbc 2961  df-dif 3129  df-un 3131  df-in 3133  df-ss 3140  df-pw 3574  df-sn 3595  df-pr 3596  df-op 3598  df-uni 3806  df-br 3999  df-opab 4060  df-id 4287  df-po 4290  df-iso 4291  df-xp 4626  df-rel 4627  df-cnv 4628  df-co 4629  df-dm 4630  df-iota 5170  df-fun 5210  df-fv 5216  df-ov 5868  df-oprab 5869  df-mpo 5870  df-pnf 7968  df-mnf 7969  df-xr 7970  df-ltxr 7971  df-le 7972  df-icc 9864

This theorem is referenced by:  dedekindicclemicc  13679