Theorem ivthinclemum 13253

Description: Lemma for ivthinc 13261. 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 7948	. . 3 |- ( ph -> A e. RR* )
3		ivth.2	. . . 4 |- ( ph -> B e. RR )
4	3	rexrd 7948	. . 3 |- ( ph -> B e. RR* )
5		ivth.4	. . . 4 |- ( ph -> A < B )
6	1, 3, 5	ltled 8017	. . 3 |- ( ph -> A <_ B )
7		ubicc2 9921	. . 3 |- ( ( A e. RR* /\ B e. RR* /\ A <_ B ) -> B e. ( A [,] B ) )
8	2, 4, 6, 7	syl3anc 1228	. 2 |- ( ph -> B e. ( A [,] B ) )
9		ivth.9	. . . 4 |- ( ph -> ( ( F ` A ) < U /\ U < ( F ` B ) ) )
10	9	simprd 113	. . 3 |- ( ph -> U < ( F ` B ) )
11		fveq2 5486	. . . . 5 |- ( w = B -> ( F ` w ) = ( F ` B ) )
12	11	breq2d 3994	. . . 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 2885	. . 3 |- ( B e. R <-> ( B e. ( A [,] B ) /\ U < ( F ` B ) ) )
15	8, 10, 14	sylanbrc 414	. 2 |- ( ph -> B e. R )
16		eleq1 2229	. . 3 |- ( r = B -> ( r e. R <-> B e. R ) )
17	16	rspcev 2830	. 2 |- ( ( B e. ( A [,] B ) /\ B e. R ) -> E. r e. ( A [,] B ) r e. R )
18	8, 15, 17	syl2anc 409	1 |- ( ph -> E. r e. ( A [,] B ) r e. R )

Syntax hints:   -> wi 4   /\ wa 103   = wceq 1343   e. wcel 2136   E.wrex 2445   {crab 2448   C_ wss 3116   class class class wbr 3982   ` cfv 5188  (class class class)co 5842   CCcc 7751   RRcr 7752   RR*cxr 7932   < clt 7933   <_ cle 7934   [,]cicc 9827   -cn->ccncf 13197

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187  ax-un 4411  ax-setind 4514  ax-cnex 7844  ax-resscn 7845  ax-pre-ltirr 7865  ax-pre-lttrn 7867

This theorem depends on definitions:  df-bi 116  df-3or 969  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-nel 2432  df-ral 2449  df-rex 2450  df-rab 2453  df-v 2728  df-sbc 2952  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-br 3983  df-opab 4044  df-id 4271  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-iota 5153  df-fun 5190  df-fv 5196  df-ov 5845  df-oprab 5846  df-mpo 5847  df-pnf 7935  df-mnf 7936  df-xr 7937  df-ltxr 7938  df-le 7939  df-icc 9831

This theorem is referenced by:  ivthinclemex  13260