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

Theorem ivthinclemdisj 15664
Description: Lemma for ivthinc 15667. 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 5690 . . . . . . . 8  |-  ( x  =  z  ->  ( F `  x )  =  ( F `  z ) )
21eleq1d 2307 . . . . . . 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 2623 . . . . . . . 8  |-  ( ph  ->  A. x  e.  ( A [,] B ) ( F `  x
)  e.  RR )
54adantr 276 . . . . . . 7  |-  ( (
ph  /\  z  e.  L )  ->  A. x  e.  ( A [,] B
) ( F `  x )  e.  RR )
6 fveq2 5690 . . . . . . . . . . . 12  |-  ( w  =  z  ->  ( F `  w )  =  ( F `  z ) )
76breq1d 4135 . . . . . . . . . . 11  |-  ( w  =  z  ->  (
( F `  w
)  <  U  <->  ( F `  z )  <  U
) )
8 ivthinclem.l . . . . . . . . . . 11  |-  L  =  { w  e.  ( A [,] B )  |  ( F `  w )  <  U }
97, 8elrab2 2985 . . . . . . . . . 10  |-  ( z  e.  L  <->  ( z  e.  ( A [,] B
)  /\  ( F `  z )  <  U
) )
109biimpi 120 . . . . . . . . 9  |-  ( z  e.  L  ->  (
z  e.  ( A [,] B )  /\  ( F `  z )  <  U ) )
1110adantl 277 . . . . . . . 8  |-  ( (
ph  /\  z  e.  L )  ->  (
z  e.  ( A [,] B )  /\  ( F `  z )  <  U ) )
1211simpld 112 . . . . . . 7  |-  ( (
ph  /\  z  e.  L )  ->  z  e.  ( A [,] B
) )
132, 5, 12rspcdva 2934 . . . . . 6  |-  ( (
ph  /\  z  e.  L )  ->  ( F `  z )  e.  RR )
14 ivth.3 . . . . . . 7  |-  ( ph  ->  U  e.  RR )
1514adantr 276 . . . . . 6  |-  ( (
ph  /\  z  e.  L )  ->  U  e.  RR )
1611simprd 114 . . . . . 6  |-  ( (
ph  /\  z  e.  L )  ->  ( F `  z )  <  U )
1713, 15, 16ltnsymd 8436 . . . . 5  |-  ( (
ph  /\  z  e.  L )  ->  -.  U  <  ( F `  z ) )
1817intnand 943 . . . 4  |-  ( (
ph  /\  z  e.  L )  ->  -.  ( z  e.  ( A [,] B )  /\  U  <  ( F `  z )
) )
196breq2d 4137 . . . . 5  |-  ( w  =  z  ->  ( U  <  ( F `  w )  <->  U  <  ( F `  z ) ) )
20 ivthinclem.r . . . . 5  |-  R  =  { w  e.  ( A [,] B )  |  U  <  ( F `  w ) }
2119, 20elrab2 2985 . . . 4  |-  ( z  e.  R  <->  ( z  e.  ( A [,] B
)  /\  U  <  ( F `  z ) ) )
2218, 21sylnibr 688 . . 3  |-  ( (
ph  /\  z  e.  L )  ->  -.  z  e.  R )
2322ralrimiva 2623 . 2  |-  ( ph  ->  A. z  e.  L  -.  z  e.  R
)
24 disj 3572 . 2  |-  ( ( L  i^i  R )  =  (/)  <->  A. z  e.  L  -.  z  e.  R
)
2523, 24sylibr 134 1  |-  ( ph  ->  ( L  i^i  R
)  =  (/) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   A.wral 2528   {crab 2532    i^i cin 3219    C_ wss 3220   (/)c0 3520   class class class wbr 4125   ` cfv 5372  (class class class)co 6075   CCcc 8167   RRcr 8168    < clt 8350   [,]cicc 10272   -cn->ccncf 15594
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-lttrn 8283
This theorem depends on definitions:  df-bi 117  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-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-xp 4775  df-cnv 4777  df-iota 5332  df-fv 5380  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356
This theorem is referenced by:  ivthinclemex  15666
  Copyright terms: Public domain W3C validator