MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ltrelxr Unicode version

Theorem ltrelxr 8902
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 8888 . 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 936 . . . . . 6  |-  ( ( x  e.  RR  /\  y  e.  RR  /\  x  <RR  y )  <->  ( (
x  e.  RR  /\  y  e.  RR )  /\  x  <RR  y ) )
32opabbii 4099 . . . . 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 4778 . . . . 5  |-  { <. x ,  y >.  |  ( ( x  e.  RR  /\  y  e.  RR )  /\  x  <RR  y ) }  C_  ( RR  X.  RR )
53, 4eqsstri 3221 . . . 4  |-  { <. x ,  y >.  |  ( x  e.  RR  /\  y  e.  RR  /\  x  <RR  y ) }  C_  ( RR  X.  RR )
6 ressxr 8892 . . . . 5  |-  RR  C_  RR*
7 xpss12 4808 . . . . 5  |-  ( ( RR  C_  RR*  /\  RR  C_ 
RR* )  ->  ( RR  X.  RR )  C_  ( RR*  X.  RR* )
)
86, 6, 7mp2an 653 . . . 4  |-  ( RR 
X.  RR )  C_  ( RR*  X.  RR* )
95, 8sstri 3201 . . 3  |-  { <. x ,  y >.  |  ( x  e.  RR  /\  y  e.  RR  /\  x  <RR  y ) }  C_  ( RR*  X.  RR* )
10 snsspr2 3781 . . . . . . 7  |-  {  -oo } 
C_  {  +oo ,  -oo }
11 ssun2 3352 . . . . . . . 8  |-  {  +oo , 
-oo }  C_  ( RR  u.  {  +oo ,  -oo } )
12 df-xr 8887 . . . . . . . 8  |-  RR*  =  ( RR  u.  {  +oo , 
-oo } )
1311, 12sseqtr4i 3224 . . . . . . 7  |-  {  +oo , 
-oo }  C_  RR*
1410, 13sstri 3201 . . . . . 6  |-  {  -oo } 
C_  RR*
156, 14unssi 3363 . . . . 5  |-  ( RR  u.  {  -oo }
)  C_  RR*
16 snsspr1 3780 . . . . . 6  |-  {  +oo } 
C_  {  +oo ,  -oo }
1716, 13sstri 3201 . . . . 5  |-  {  +oo } 
C_  RR*
18 xpss12 4808 . . . . 5  |-  ( ( ( RR  u.  {  -oo } )  C_  RR*  /\  {  +oo }  C_  RR* )  -> 
( ( RR  u.  { 
-oo } )  X.  {  +oo } )  C_  ( RR*  X.  RR* ) )
1915, 17, 18mp2an 653 . . . 4  |-  ( ( RR  u.  {  -oo } )  X.  {  +oo } )  C_  ( RR*  X. 
RR* )
20 xpss12 4808 . . . . 5  |-  ( ( {  -oo }  C_  RR* 
/\  RR  C_  RR* )  ->  ( {  -oo }  X.  RR )  C_  ( RR*  X.  RR* ) )
2114, 6, 20mp2an 653 . . . 4  |-  ( { 
-oo }  X.  RR )  C_  ( RR*  X.  RR* )
2219, 21unssi 3363 . . 3  |-  ( ( ( RR  u.  {  -oo } )  X.  {  +oo } )  u.  ( {  -oo }  X.  RR ) )  C_  ( RR*  X.  RR* )
239, 22unssi 3363 . 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* )
241, 23eqsstri 3221 1  |-  <  C_  ( RR*  X.  RR* )
Colors of variables: wff set class
Syntax hints:    /\ wa 358    /\ w3a 934    e. wcel 1696    u. cun 3163    C_ wss 3165   {csn 3653   {cpr 3654   class class class wbr 4039   {copab 4092    X. cxp 4703   RRcr 8752    <RR cltrr 8757    +oocpnf 8880    -oocmnf 8881   RR*cxr 8882    < clt 8883
This theorem is referenced by:  ltrel  8903  dfle2  10497  dflt2  10498  itg2gt0cn  25006
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-v 2803  df-un 3170  df-in 3172  df-ss 3179  df-pr 3660  df-opab 4094  df-xp 4711  df-xr 8887  df-ltxr 8888
  Copyright terms: Public domain W3C validator