Theorem dedekindicclemeu 15655

Description: Lemma for dedekindicc 15657. 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 4128	. . . 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 2934	. . 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 10336	. . . . . . 7 |- ( ( A e. RR /\ B e. RR ) -> ( A [,] B ) C_ RR )
10	7, 8, 9	syl2anc 415	. . . . . 6 |- ( ph -> ( A [,] B ) C_ RR )
11		dedekindicclemeu.are	. . . . . 6 |- ( ph -> C e. ( A [,] B ) )
12	10, 11	sseldd 3249	. . . . 5 |- ( ph -> C e. RR )
13	12	ltnrd 8427	. . . 4 |- ( ph -> -. C < C )
14	13	adantr 276	. . 3 |- ( ( ph /\ C e. L ) -> -. C < C )
15	6, 14	pm2.21fal 1422	. 2 |- ( ( ph /\ C e. L ) -> F. )
16		breq2 4129	. . . 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 2934	. . 3 |- ( ( ph /\ D e. U ) -> D < D )
22		dedekindicclemeu.bre	. . . . . 6 |- ( ph -> D e. ( A [,] B ) )
23	10, 22	sseldd 3249	. . . . 5 |- ( ph -> D e. RR )
24	23	ltnrd 8427	. . . 4 |- ( ph -> -. D < D )
25	24	adantr 276	. . 3 |- ( ( ph /\ D e. U ) -> -. D < D )
26	21, 25	pm2.21fal 1422	. 2 |- ( ( ph /\ D e. U ) -> F. )
27		dedekindicclemeu.lt	. . 3 |- ( ph -> C < D )
28		breq2 4129	. . . . 5 |- ( r = D -> ( C < r <-> C < D ) )
29		eleq1 2301	. . . . . 6 |- ( r = D -> ( r e. U <-> D e. U ) )
30	29	orbi2d 802	. . . . 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 4128	. . . . . . 7 |- ( q = C -> ( q < r <-> C < r ) )
33		eleq1 2301	. . . . . . . 8 |- ( q = C -> ( q e. L <-> C e. L ) )
34	33	orbi1d 803	. . . . . . 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 2550	. . . . 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 2934	. . . 4 |- ( ph -> A. r e. ( A [,] B ) ( C < r -> ( C e. L \/ r e. U ) ) )
39	31, 38, 22	rspcdva 2934	. . 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 810	1 |- ( ph -> F. )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 720   = wceq 1402   F. wfal 1407   e. wcel 2209   A.wral 2528   E.wrex 2529   i^i cin 3219   C_ wss 3220   (/)c0 3520   class class class wbr 4125  (class class class)co 6075   RRcr 8168   < clt 8350   [,]cicc 10272

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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283

This theorem depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-id 4433  df-po 4436  df-iso 4437  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-iota 5332  df-fun 5374  df-fv 5380  df-ov 6078  df-oprab 6079  df-mpo 6080  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-icc 10276

This theorem is referenced by:  dedekindicclemicc  15656