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

Theorem iccsupr 10158
Description: A nonempty subset of a closed real interval satisfies the conditions for the existence of its supremum. To be useful without excluded middle, we'll probably need to change not equal to apart, and perhaps make other changes, but the theorem does hold as stated here. (Contributed by Paul Chapman, 21-Jan-2008.)
Assertion
Ref Expression
iccsupr  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  S  C_  ( A [,] B )  /\  C  e.  S )  ->  ( S  C_  RR  /\  S  =/=  (/)  /\  E. x  e.  RR  A. y  e.  S  y  <_  x ) )
Distinct variable groups:    y, A    x, B, y    x, S, y
Allowed substitution hints:    A( x)    C( x, y)

Proof of Theorem iccsupr
StepHypRef Expression
1 iccssre 10147 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A [,] B
)  C_  RR )
2 sstr 3232 . . . . 5  |-  ( ( S  C_  ( A [,] B )  /\  ( A [,] B )  C_  RR )  ->  S  C_  RR )
32ancoms 268 . . . 4  |-  ( ( ( A [,] B
)  C_  RR  /\  S  C_  ( A [,] B
) )  ->  S  C_  RR )
41, 3sylan 283 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  S  C_  ( A [,] B ) )  ->  S  C_  RR )
543adant3 1041 . 2  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  S  C_  ( A [,] B )  /\  C  e.  S )  ->  S  C_  RR )
6 ne0i 3498 . . 3  |-  ( C  e.  S  ->  S  =/=  (/) )
763ad2ant3 1044 . 2  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  S  C_  ( A [,] B )  /\  C  e.  S )  ->  S  =/=  (/) )
8 simplr 528 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  S  C_  ( A [,] B ) )  ->  B  e.  RR )
9 ssel 3218 . . . . . . . 8  |-  ( S 
C_  ( A [,] B )  ->  (
y  e.  S  -> 
y  e.  ( A [,] B ) ) )
10 elicc2 10130 . . . . . . . . 9  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( y  e.  ( A [,] B )  <-> 
( y  e.  RR  /\  A  <_  y  /\  y  <_  B ) ) )
1110biimpd 144 . . . . . . . 8  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( y  e.  ( A [,] B )  ->  ( y  e.  RR  /\  A  <_ 
y  /\  y  <_  B ) ) )
129, 11sylan9r 410 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  S  C_  ( A [,] B ) )  ->  ( y  e.  S  ->  ( y  e.  RR  /\  A  <_ 
y  /\  y  <_  B ) ) )
1312imp 124 . . . . . 6  |-  ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  S  C_  ( A [,] B
) )  /\  y  e.  S )  ->  (
y  e.  RR  /\  A  <_  y  /\  y  <_  B ) )
1413simp3d 1035 . . . . 5  |-  ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  S  C_  ( A [,] B
) )  /\  y  e.  S )  ->  y  <_  B )
1514ralrimiva 2603 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  S  C_  ( A [,] B ) )  ->  A. y  e.  S  y  <_  B )
16 breq2 4086 . . . . . 6  |-  ( x  =  B  ->  (
y  <_  x  <->  y  <_  B ) )
1716ralbidv 2530 . . . . 5  |-  ( x  =  B  ->  ( A. y  e.  S  y  <_  x  <->  A. y  e.  S  y  <_  B ) )
1817rspcev 2907 . . . 4  |-  ( ( B  e.  RR  /\  A. y  e.  S  y  <_  B )  ->  E. x  e.  RR  A. y  e.  S  y  <_  x )
198, 15, 18syl2anc 411 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  S  C_  ( A [,] B ) )  ->  E. x  e.  RR  A. y  e.  S  y  <_  x )
20193adant3 1041 . 2  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  S  C_  ( A [,] B )  /\  C  e.  S )  ->  E. x  e.  RR  A. y  e.  S  y  <_  x )
215, 7, 203jca 1201 1  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  S  C_  ( A [,] B )  /\  C  e.  S )  ->  ( S  C_  RR  /\  S  =/=  (/)  /\  E. x  e.  RR  A. y  e.  S  y  <_  x ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1002    = wceq 1395    e. wcel 2200    =/= wne 2400   A.wral 2508   E.wrex 2509    C_ wss 3197   (/)c0 3491   class class class wbr 4082  (class class class)co 6000   RRcr 7994    <_ cle 8178   [,]cicc 10083
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4201  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-setind 4628  ax-cnex 8086  ax-resscn 8087  ax-pre-ltirr 8107  ax-pre-ltwlin 8108  ax-pre-lttrn 8109
This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2801  df-sbc 3029  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-br 4083  df-opab 4145  df-id 4383  df-po 4386  df-iso 4387  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-iota 5277  df-fun 5319  df-fv 5325  df-ov 6003  df-oprab 6004  df-mpo 6005  df-pnf 8179  df-mnf 8180  df-xr 8181  df-ltxr 8182  df-le 8183  df-icc 10087
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator