Theorem ivthinclemum 14955

Description: Lemma for ivthinc 14963. The upper cut is bounded. (Contributed by Jim Kingdon, 18-Feb-2024.)

Hypotheses

Ref	Expression
ivth.1	|- ( ph -> A e. RR )
ivth.2	|- ( ph -> B e. RR )
ivth.3	|- ( ph -> U e. RR )
ivth.4	|- ( ph -> A < B )
ivth.5	|- ( ph -> ( A [,] B ) C_ D )
ivth.7	|- ( ph -> F e. ( D -cn-> CC ) )
ivth.8	|- ( ( ph /\ x e. ( A [,] B ) ) -> ( F ` x ) e. RR )
ivth.9	|- ( ph -> ( ( F ` A ) < U /\ U < ( F ` B ) ) )
ivthinc.i	|- ( ( ( ph /\ x e. ( A [,] B ) ) /\ ( y e. ( A [,] B ) /\ x < y ) ) -> ( F ` x ) < ( F ` y ) )
ivthinclem.l	|- L = { w e. ( A [,] B ) | ( F ` w ) < U }
ivthinclem.r	|- R = { w e. ( A [,] B ) | U < ( F ` w ) }

Assertion

Ref	Expression
ivthinclemum	|- ( ph -> E. r e. ( A [,] B ) r e. R )

Distinct variable groups:   A, r   w, A   B, r   w, B   w, F   R, r   w, U

Allowed substitution hints:   ph( x, y, w, r)   A( x, y)   B( x, y)   D( x, y, w, r)   R( x, y, w)   U( x, y, r)   F( x, y, r)   L( x, y, w, r)

Proof of Theorem ivthinclemum

Step	Hyp	Ref	Expression
1		ivth.1	. . . 4 |- ( ph -> A e. RR )
2	1	rexrd 8093	. . 3 |- ( ph -> A e. RR* )
3		ivth.2	. . . 4 |- ( ph -> B e. RR )
4	3	rexrd 8093	. . 3 |- ( ph -> B e. RR* )
5		ivth.4	. . . 4 |- ( ph -> A < B )
6	1, 3, 5	ltled 8162	. . 3 |- ( ph -> A <_ B )
7		ubicc2 10077	. . 3 |- ( ( A e. RR* /\ B e. RR* /\ A <_ B ) -> B e. ( A [,] B ) )
8	2, 4, 6, 7	syl3anc 1249	. 2 |- ( ph -> B e. ( A [,] B ) )
9		ivth.9	. . . 4 |- ( ph -> ( ( F ` A ) < U /\ U < ( F ` B ) ) )
10	9	simprd 114	. . 3 |- ( ph -> U < ( F ` B ) )
11		fveq2 5561	. . . . 5 |- ( w = B -> ( F ` w ) = ( F ` B ) )
12	11	breq2d 4046	. . . 4 |- ( w = B -> ( U < ( F ` w ) <-> U < ( F ` B ) ) )
13		ivthinclem.r	. . . 4 |- R = { w e. ( A [,] B ) | U < ( F ` w ) }
14	12, 13	elrab2 2923	. . 3 |- ( B e. R <-> ( B e. ( A [,] B ) /\ U < ( F ` B ) ) )
15	8, 10, 14	sylanbrc 417	. 2 |- ( ph -> B e. R )
16		eleq1 2259	. . 3 |- ( r = B -> ( r e. R <-> B e. R ) )
17	16	rspcev 2868	. 2 |- ( ( B e. ( A [,] B ) /\ B e. R ) -> E. r e. ( A [,] B ) r e. R )
18	8, 15, 17	syl2anc 411	1 |- ( ph -> E. r e. ( A [,] B ) r e. R )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1364   e. wcel 2167   E.wrex 2476   {crab 2479   C_ wss 3157   class class class wbr 4034   ` cfv 5259  (class class class)co 5925   CCcc 7894   RRcr 7895   RR*cxr 8077   < clt 8078   <_ cle 8079   [,]cicc 9983   -cn->ccncf 14890

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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-cnex 7987  ax-resscn 7988  ax-pre-ltirr 8008  ax-pre-lttrn 8010

This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-rab 2484  df-v 2765  df-sbc 2990  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-br 4035  df-opab 4096  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-iota 5220  df-fun 5261  df-fv 5267  df-ov 5928  df-oprab 5929  df-mpo 5930  df-pnf 8080  df-mnf 8081  df-xr 8082  df-ltxr 8083  df-le 8084  df-icc 9987

This theorem is referenced by:  ivthinclemex  14962