ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ivthinclemdisj Unicode version

Theorem ivthinclemdisj 13258
Description: Lemma for ivthinc 13261. The lower and upper cuts are disjoint. (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
ivthinclemdisj  |-  ( ph  ->  ( L  i^i  R
)  =  (/) )
Distinct variable groups:    w, A    x, A    w, B    x, B    w, F    x, F    w, U    ph, x
Allowed substitution hints:    ph( y, w)    A( y)    B( y)    D( x, y, w)    R( x, y, w)    U( x, y)    F( y)    L( x, y, w)

Proof of Theorem ivthinclemdisj
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 fveq2 5486 . . . . . . . 8  |-  ( x  =  z  ->  ( F `  x )  =  ( F `  z ) )
21eleq1d 2235 . . . . . . 7  |-  ( x  =  z  ->  (
( F `  x
)  e.  RR  <->  ( F `  z )  e.  RR ) )
3 ivth.8 . . . . . . . . 9  |-  ( (
ph  /\  x  e.  ( A [,] B ) )  ->  ( F `  x )  e.  RR )
43ralrimiva 2539 . . . . . . . 8  |-  ( ph  ->  A. x  e.  ( A [,] B ) ( F `  x
)  e.  RR )
54adantr 274 . . . . . . 7  |-  ( (
ph  /\  z  e.  L )  ->  A. x  e.  ( A [,] B
) ( F `  x )  e.  RR )
6 fveq2 5486 . . . . . . . . . . . 12  |-  ( w  =  z  ->  ( F `  w )  =  ( F `  z ) )
76breq1d 3992 . . . . . . . . . . 11  |-  ( w  =  z  ->  (
( F `  w
)  <  U  <->  ( F `  z )  <  U
) )
8 ivthinclem.l . . . . . . . . . . 11  |-  L  =  { w  e.  ( A [,] B )  |  ( F `  w )  <  U }
97, 8elrab2 2885 . . . . . . . . . 10  |-  ( z  e.  L  <->  ( z  e.  ( A [,] B
)  /\  ( F `  z )  <  U
) )
109biimpi 119 . . . . . . . . 9  |-  ( z  e.  L  ->  (
z  e.  ( A [,] B )  /\  ( F `  z )  <  U ) )
1110adantl 275 . . . . . . . 8  |-  ( (
ph  /\  z  e.  L )  ->  (
z  e.  ( A [,] B )  /\  ( F `  z )  <  U ) )
1211simpld 111 . . . . . . 7  |-  ( (
ph  /\  z  e.  L )  ->  z  e.  ( A [,] B
) )
132, 5, 12rspcdva 2835 . . . . . 6  |-  ( (
ph  /\  z  e.  L )  ->  ( F `  z )  e.  RR )
14 ivth.3 . . . . . . 7  |-  ( ph  ->  U  e.  RR )
1514adantr 274 . . . . . 6  |-  ( (
ph  /\  z  e.  L )  ->  U  e.  RR )
1611simprd 113 . . . . . 6  |-  ( (
ph  /\  z  e.  L )  ->  ( F `  z )  <  U )
1713, 15, 16ltnsymd 8018 . . . . 5  |-  ( (
ph  /\  z  e.  L )  ->  -.  U  <  ( F `  z ) )
1817intnand 921 . . . 4  |-  ( (
ph  /\  z  e.  L )  ->  -.  ( z  e.  ( A [,] B )  /\  U  <  ( F `  z )
) )
196breq2d 3994 . . . . 5  |-  ( w  =  z  ->  ( U  <  ( F `  w )  <->  U  <  ( F `  z ) ) )
20 ivthinclem.r . . . . 5  |-  R  =  { w  e.  ( A [,] B )  |  U  <  ( F `  w ) }
2119, 20elrab2 2885 . . . 4  |-  ( z  e.  R  <->  ( z  e.  ( A [,] B
)  /\  U  <  ( F `  z ) ) )
2218, 21sylnibr 667 . . 3  |-  ( (
ph  /\  z  e.  L )  ->  -.  z  e.  R )
2322ralrimiva 2539 . 2  |-  ( ph  ->  A. z  e.  L  -.  z  e.  R
)
24 disj 3457 . 2  |-  ( ( L  i^i  R )  =  (/)  <->  A. z  e.  L  -.  z  e.  R
)
2523, 24sylibr 133 1  |-  ( ph  ->  ( L  i^i  R
)  =  (/) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 103    = wceq 1343    e. wcel 2136   A.wral 2444   {crab 2448    i^i cin 3115    C_ wss 3116   (/)c0 3409   class class class wbr 3982   ` cfv 5188  (class class class)co 5842   CCcc 7751   RRcr 7752    < clt 7933   [,]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-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-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-nul 3410  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-br 3983  df-opab 4044  df-xp 4610  df-cnv 4612  df-iota 5153  df-fv 5196  df-pnf 7935  df-mnf 7936  df-xr 7937  df-ltxr 7938  df-le 7939
This theorem is referenced by:  ivthinclemex  13260
  Copyright terms: Public domain W3C validator