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

Theorem ltrelxr 8132
Description: 'Less than' is a relation on extended reals. (Contributed by Mario Carneiro, 28-Apr-2015.)
Assertion
Ref Expression
ltrelxr  |-  <  C_  ( RR*  X.  RR* )

Proof of Theorem ltrelxr
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-ltxr 8111 . 2  |-  <  =  ( { <. x ,  y
>.  |  ( x  e.  RR  /\  y  e.  RR  /\  x  <RR  y ) }  u.  (
( ( RR  u.  { -oo } )  X. 
{ +oo } )  u.  ( { -oo }  X.  RR ) ) )
2 df-3an 982 . . . . . 6  |-  ( ( x  e.  RR  /\  y  e.  RR  /\  x  <RR  y )  <->  ( (
x  e.  RR  /\  y  e.  RR )  /\  x  <RR  y ) )
32opabbii 4110 . . . . 5  |-  { <. x ,  y >.  |  ( x  e.  RR  /\  y  e.  RR  /\  x  <RR  y ) }  =  { <. x ,  y
>.  |  ( (
x  e.  RR  /\  y  e.  RR )  /\  x  <RR  y ) }
4 opabssxp 4748 . . . . 5  |-  { <. x ,  y >.  |  ( ( x  e.  RR  /\  y  e.  RR )  /\  x  <RR  y ) }  C_  ( RR  X.  RR )
53, 4eqsstri 3224 . . . 4  |-  { <. x ,  y >.  |  ( x  e.  RR  /\  y  e.  RR  /\  x  <RR  y ) }  C_  ( RR  X.  RR )
6 rexpssxrxp 8116 . . . 4  |-  ( RR 
X.  RR )  C_  ( RR*  X.  RR* )
75, 6sstri 3201 . . 3  |-  { <. x ,  y >.  |  ( x  e.  RR  /\  y  e.  RR  /\  x  <RR  y ) }  C_  ( RR*  X.  RR* )
8 ressxr 8115 . . . . . 6  |-  RR  C_  RR*
9 snsspr2 3781 . . . . . . 7  |-  { -oo } 
C_  { +oo , -oo }
10 ssun2 3336 . . . . . . . 8  |-  { +oo , -oo }  C_  ( RR  u.  { +oo , -oo } )
11 df-xr 8110 . . . . . . . 8  |-  RR*  =  ( RR  u.  { +oo , -oo } )
1210, 11sseqtrri 3227 . . . . . . 7  |-  { +oo , -oo }  C_  RR*
139, 12sstri 3201 . . . . . 6  |-  { -oo } 
C_  RR*
148, 13unssi 3347 . . . . 5  |-  ( RR  u.  { -oo }
)  C_  RR*
15 snsspr1 3780 . . . . . 6  |-  { +oo } 
C_  { +oo , -oo }
1615, 12sstri 3201 . . . . 5  |-  { +oo } 
C_  RR*
17 xpss12 4781 . . . . 5  |-  ( ( ( RR  u.  { -oo } )  C_  RR*  /\  { +oo }  C_  RR* )  -> 
( ( RR  u.  { -oo } )  X. 
{ +oo } )  C_  ( RR*  X.  RR* )
)
1814, 16, 17mp2an 426 . . . 4  |-  ( ( RR  u.  { -oo } )  X.  { +oo } )  C_  ( RR*  X. 
RR* )
19 xpss12 4781 . . . . 5  |-  ( ( { -oo }  C_  RR* 
/\  RR  C_  RR* )  ->  ( { -oo }  X.  RR )  C_  ( RR*  X.  RR* ) )
2013, 8, 19mp2an 426 . . . 4  |-  ( { -oo }  X.  RR )  C_  ( RR*  X.  RR* )
2118, 20unssi 3347 . . 3  |-  ( ( ( RR  u.  { -oo } )  X.  { +oo } )  u.  ( { -oo }  X.  RR ) )  C_  ( RR*  X.  RR* )
227, 21unssi 3347 . 2  |-  ( {
<. x ,  y >.  |  ( x  e.  RR  /\  y  e.  RR  /\  x  <RR  y ) }  u.  (
( ( RR  u.  { -oo } )  X. 
{ +oo } )  u.  ( { -oo }  X.  RR ) ) ) 
C_  ( RR*  X.  RR* )
231, 22eqsstri 3224 1  |-  <  C_  ( RR*  X.  RR* )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    /\ w3a 980    e. wcel 2175    u. cun 3163    C_ wss 3165   {csn 3632   {cpr 3633   class class class wbr 4043   {copab 4103    X. cxp 4672   RRcr 7923    <RR cltrr 7928   +oocpnf 8103   -oocmnf 8104   RR*cxr 8105    < clt 8106
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-io 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-ext 2186
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1375  df-nf 1483  df-sb 1785  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-v 2773  df-un 3169  df-in 3171  df-ss 3178  df-pr 3639  df-opab 4105  df-xp 4680  df-xr 8110  df-ltxr 8111
This theorem is referenced by:  ltrel  8133
  Copyright terms: Public domain W3C validator