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

Theorem iccsupr 10200
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 10189 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A [,] B
)  C_  RR )
2 sstr 3235 . . . . 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 1043 . 2  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  S  C_  ( A [,] B )  /\  C  e.  S )  ->  S  C_  RR )
6 ne0i 3501 . . 3  |-  ( C  e.  S  ->  S  =/=  (/) )
763ad2ant3 1046 . 2  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  S  C_  ( A [,] B )  /\  C  e.  S )  ->  S  =/=  (/) )
8 simplr 529 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  S  C_  ( A [,] B ) )  ->  B  e.  RR )
9 ssel 3221 . . . . . . . 8  |-  ( S 
C_  ( A [,] B )  ->  (
y  e.  S  -> 
y  e.  ( A [,] B ) ) )
10 elicc2 10172 . . . . . . . . 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 1037 . . . . 5  |-  ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  S  C_  ( A [,] B
) )  /\  y  e.  S )  ->  y  <_  B )
1514ralrimiva 2605 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  S  C_  ( A [,] B ) )  ->  A. y  e.  S  y  <_  B )
16 breq2 4092 . . . . . 6  |-  ( x  =  B  ->  (
y  <_  x  <->  y  <_  B ) )
1716ralbidv 2532 . . . . 5  |-  ( x  =  B  ->  ( A. y  e.  S  y  <_  x  <->  A. y  e.  S  y  <_  B ) )
1817rspcev 2910 . . . 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 1043 . 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 1203 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 1004    = wceq 1397    e. wcel 2202    =/= wne 2402   A.wral 2510   E.wrex 2511    C_ wss 3200   (/)c0 3494   class class class wbr 4088  (class class class)co 6017   RRcr 8030    <_ cle 8214   [,]cicc 10125
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145
This theorem depends on definitions:  df-bi 117  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-id 4390  df-po 4393  df-iso 4394  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-iota 5286  df-fun 5328  df-fv 5334  df-ov 6020  df-oprab 6021  df-mpo 6022  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-icc 10129
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator